Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 1816) sorted by relevance

12345678910>>...73

/external/guava/guava/src/com/google/common/collect/
DComparisonChain.java75 Comparable left, Comparable right) {
76 return classify(left.compareTo(right));
79 @Nullable T left, @Nullable T right, Comparator<T> comparator) {
80 return classify(comparator.compare(left, right));
82 @Override public ComparisonChain compare(int left, int right) {
83 return classify(Ints.compare(left, right));
85 @Override public ComparisonChain compare(long left, long right) {
86 return classify(Longs.compare(left, right));
88 @Override public ComparisonChain compare(float left, float right) {
89 return classify(Float.compare(left, right));
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DDESEngine.java408 int work, right, left; in desFunc() local
410 left = (in[inOff + 0] & 0xff) << 24; in desFunc()
411 left |= (in[inOff + 1] & 0xff) << 16; in desFunc()
412 left |= (in[inOff + 2] & 0xff) << 8; in desFunc()
413 left |= (in[inOff + 3] & 0xff); in desFunc()
420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
422 left ^= (work << 4); in desFunc()
423 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
425 left ^= (work << 16); in desFunc()
426 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
/external/toybox/kconfig/
Dexpr.c20 e->left.sym = sym; in expr_alloc_symbol()
29 e->left.expr = ce; in expr_alloc_one()
38 e->left.expr = e1; in expr_alloc_two()
48 e->left.sym = s1; in expr_alloc_comp()
78 e->left = org->left; in expr_copy()
81 e->left.expr = expr_copy(org->left.expr); in expr_copy()
85 e->left.sym = org->left.sym; in expr_copy()
91 e->left.expr = expr_copy(org->left.expr); in expr_copy()
113 expr_free(e->left.expr); in expr_free()
120 expr_free(e->left.expr); in expr_free()
[all …]
/external/v8/benchmarks/spinning-balls/
Dsplay-tree.js78 node.left = this.root_;
83 node.left = this.root_.left;
84 this.root_.left = null;
107 if (!this.root_.left) {
111 this.root_ = this.root_.left;
168 } else if (this.root_.left) {
169 return this.findMax(this.root_.left);
207 var dummy, left, right;
208 dummy = left = right = new SplayTree.Node(null, null);
212 if (!current.left) {
[all …]
/external/v8/tools/
Dsplaytree.js80 node.left = this.root_;
85 node.left = this.root_.left;
86 this.root_.left = null;
109 if (!this.root_.left) {
113 this.root_ = this.root_.left;
148 while (current.left) {
149 current = current.left;
185 } else if (this.root_.left) {
186 return this.findMax(this.root_.left);
233 var dummy, left, right;
[all …]
/external/v8/src/compiler/
Dmachine-operator-reducer.cc52 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x in Reduce()
54 return ReplaceInt32(m.left().Value() & m.right().Value()); in Reduce()
56 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x & x => x in Reduce()
61 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x in Reduce()
64 return ReplaceInt32(m.left().Value() | m.right().Value()); in Reduce()
66 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x | x => x in Reduce()
67 if (m.left().IsWord32Shl() && m.right().IsWord32Shr()) { in Reduce()
68 Int32BinopMatcher mleft(m.left().node()); in Reduce()
70 if (mleft.left().node() == mright.left().node()) { in Reduce()
74 if (mrightright.left().Is(32) && in Reduce()
[all …]
/external/v8/benchmarks/
Dsplay.js57 left: GeneratePayloadTree(depth - 1, tag),
173 node.left = this.root_;
178 node.left = this.root_.left;
179 this.root_.left = null;
202 if (!this.root_.left) {
206 this.root_ = this.root_.left;
263 } else if (this.root_.left) {
264 return this.findMax(this.root_.left);
302 var dummy, left, right;
303 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/skia/src/core/
DSkTSort.h121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
122 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
125 while (left < hole && lessThan(insert, *(hole - 1))) { in SkTInsertionSort()
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
139 T* newPivot = left; in SkTQSort_Partition()
140 while (left < right) { in SkTQSort_Partition()
141 if (lessThan(*left, pivotValue)) { in SkTQSort_Partition()
142 SkTSwap(*left, *newPivot); in SkTQSort_Partition()
145 left += 1; in SkTQSort_Partition()
163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
DNFAFactory.java85 NFAState s = alt.left; in optimizeAlternative()
119 NFAState left = newState(); in build_Atom() local
121 left.associatedASTNode = associatedAST; in build_Atom()
123 transitionBetweenStates(left, right, label); in build_Atom()
124 StateCluster g = new StateCluster(left, right); in build_Atom()
137 NFAState left = newState(); in build_Set() local
139 left.associatedASTNode = associatedAST; in build_Set()
143 left.addTransition(e); in build_Set()
144 StateCluster g = new StateCluster(left, right); in build_Set()
164 NFAState left = newState(); in build_Range() local
[all …]
/external/libvpx/libvpx/vp9/common/
Dvp9_reconintra.c41 const uint8_t *left) { \
42 type##_predictor(dst, stride, size, above, left); \
52 const uint8_t *above, const uint8_t *left) { in d207_predictor() argument
57 dst[r * stride] = ROUND_POWER_OF_TWO(left[r] + left[r + 1], 1); in d207_predictor()
58 dst[(bs - 1) * stride] = left[bs - 1]; in d207_predictor()
63 dst[r * stride] = ROUND_POWER_OF_TWO(left[r] + left[r + 1] * 2 + in d207_predictor()
64 left[r + 2], 2); in d207_predictor()
65 dst[(bs - 2) * stride] = ROUND_POWER_OF_TWO(left[bs - 2] + in d207_predictor()
66 left[bs - 1] * 3, 2); in d207_predictor()
67 dst[(bs - 1) * stride] = left[bs - 1]; in d207_predictor()
[all …]
Dvp9_rtcd_defs.pl51 …d207_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
54 …_d45_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
57 …_d63_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
60 …p9_h_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
64 …d117_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
67 …d135_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
70 …d153_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
73 …p9_v_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
77 …9_tm_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
81 …9_dc_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
[all …]
/external/openssh/openbsd-compat/
Drealpath.c59 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; in realpath() local
69 left_len = strlcpy(left, path + 1, sizeof(left)); in realpath()
76 left_len = strlcpy(left, path, sizeof(left)); in realpath()
78 if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) { in realpath()
91 p = strchr(left, '/'); in realpath()
92 s = p ? p : left + left_len; in realpath()
93 if (s - left >= sizeof(next_token)) { in realpath()
97 memcpy(next_token, left, s - left); in realpath()
98 next_token[s - left] = '\0'; in realpath()
99 left_len -= s - left; in realpath()
[all …]
/external/jmonkeyengine/engine/src/core/com/jme3/scene/control/
DBillboardControl.java54 private Vector3f left; field in BillboardControl
86 left = new Vector3f(); in BillboardControl()
152 Vector3f xzp = left; in rotateCameraAligned()
193 left.set(camera.getLeft()).negateLocal(); in rotateScreenAligned()
194 orient.fromAxes(left, camera.getUp(), look); in rotateScreenAligned()
217 spatial.getParent().getWorldRotation().mult(look, left); // coopt left for our own in rotateAxial()
219 left.x *= 1.0f / spatial.getWorldScale().x; in rotateAxial()
220 left.y *= 1.0f / spatial.getWorldScale().y; in rotateAxial()
221 left.z *= 1.0f / spatial.getWorldScale().z; in rotateAxial()
224 float lengthSquared = left.x * left.x + left.z * left.z; in rotateAxial()
[all …]
/external/pdfium/core/src/fxcrt/
Dfx_basic_coords.cpp11 if (left > right) { in Normalize()
12 int temp = left; in Normalize()
13 left = right; in Normalize()
27 left = left > src_n.left ? left : src_n.left; in Intersect()
31 if (left > right || top > bottom) { in Intersect()
32 left = top = right = bottom = 0; in Intersect()
40 left = left < other.left ? left : other.left; in Union()
68 left = (FX_FLOAT)(rect.left); in CFX_FloatRect()
76 if (left > right) { in Normalize()
77 temp = left; in Normalize()
[all …]
/external/pdfium/core/include/fxcrt/
Dfx_coordinates.h241 void Set(baseType left, baseType top, baseType width, baseType height) in Set() argument
243 … FXT_RECT::left = left, FXT_RECT::top = top, FXT_RECT::width = width, FXT_RECT::height = height; in Set()
245 void Set(baseType left, baseType top, const FXT_SIZE &size) in Set() argument
247 FXT_RECT::left = left, FXT_RECT::top = top, FXT_RECT::Size(size); in Set()
263 FXT_RECT::left = FXT_RECT::top = FXT_RECT::width = FXT_RECT::height = 0; in Reset()
267 left += p.x, top += p.y;
272 left -= p.x, top -= p.y;
277 return left + width; in right()
286 left += width; in Normalize()
296 left += dx; in Offset()
[all …]
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
DShadowRect.java14 public void __constructor__(int left, int top, int right, int bottom) { in __constructor__() argument
15 realRect.left = left; in __constructor__()
22 realRect.left = otherRect.left; in __constructor__()
30 set(rect.left, rect.top, rect.right, rect.bottom); in set()
34 public void set(int left, int top, int right, int bottom) { in set() argument
35 realRect.left = left; in set()
43 return realRect.right - realRect.left; in width()
60 return realRect.left == r.left && realRect.top == r.top && realRect.right == r.right in equals()
68 sb.append(realRect.left); in toString()
81 return x > realRect.left && x < realRect.right in contains()
[all …]
/external/pdfium/fpdfsdk/src/pdfwindow/
DPWL_Utils.cpp76 rcRet.left = PWL_MIN(rect1.left,rect2.left); in MaxRect()
86 return CPDF_Rect(rect.left + x,rect.bottom + y, in OffsetRect()
92 return rcChild.left >= rcParent.left && rcChild.bottom >= rcParent.bottom && in ContainsRect()
98 FX_FLOAT left = rect1.left > rect2.left ? rect1.left : rect2.left; in IntersectRect() local
103 return left < right && bottom < top; in IntersectRect()
143 FX_FLOAT fWidth = crBBox.right - crBBox.left; in GetAP_Check()
194 pts[j].x += crBBox.left; in GetAP_Check()
226 FX_FLOAT fWidth = crBBox.right - crBBox.left; in GetAP_Circle()
229 CPDF_Point pt1(crBBox.left,crBBox.bottom + fHeight / 2); in GetAP_Circle()
230 CPDF_Point pt2(crBBox.left + fWidth / 2,crBBox.top); in GetAP_Circle()
[all …]
/external/e2fsprogs/e2fsck/
Ddict.c51 #define left dict_left macro
69 #define dict_root(D) ((D)->nilnode.left)
88 upper->right = lowleft = lower->left; in rotate_left()
96 if (upper == upparent->left) { in rotate_left()
97 upparent->left = lower; in rotate_left()
103 lower->left = upper; in rotate_left()
116 lower = upper->left; in rotate_right()
117 upper->left = lowright = lower->right; in rotate_right()
125 assert (upper == upparent->left); in rotate_right()
126 upparent->left = lower; in rotate_right()
[all …]
/external/zlib/src/examples/
Denough.c203 local big_t count(int syms, int len, int left) in count() argument
213 if (syms == left) in count()
217 assert(syms > left && left > 0 && len < max); in count()
220 index = INDEX(syms, left, len); in count()
227 least = (left << 1) - syms; in count()
234 most = (((code_t)left << (max - len)) - syms) / in count()
240 got = count(syms - use, len + 1, (left - use) << 1); in count()
258 local int beenhere(int syms, int len, int left, int mem, int rem) in beenhere() argument
267 index = INDEX(syms, left, len); in beenhere()
322 local void examine(int syms, int len, int left, int mem, int rem) in examine() argument
[all …]
Dgzjoin.c81 unsigned left; /* bytes remaining at next */ member
113 in->left = 0; in bopen()
127 if (in->left != 0) in bload()
131 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left); in bload()
134 in->left += (unsigned)len; in bload()
135 } while (len != 0 && in->left < CHUNK); in bload()
140 #define bget(in) (in->left ? 0 : bload(in), \
141 in->left ? (in->left--, *(in->next)++) : \
164 if (skip <= in->left) { in bskip()
165 in->left -= skip; in bskip()
[all …]
/external/zlib/src/contrib/blast/
Dblast.c42 unsigned left; /* available input at in */ member
75 if (s->left == 0) { in bits()
76 s->left = s->infun(s->inhow, &(s->in)); in bits()
77 if (s->left == 0) longjmp(s->env, 1); /* out of input */ in bits()
80 s->left--; in bits()
133 int left; /* bits left in next or left to process */ in decode() local
137 left = s->bitcnt; in decode()
142 while (left--) { in decode()
157 left = (MAXBITS+1) - len; in decode()
158 if (left == 0) break; in decode()
[all …]
/external/protobuf/java/src/main/java/com/google/protobuf/
DRopeByteString.java115 private final ByteString left; field in RopeByteString
129 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument
130 this.left = left; in RopeByteString()
132 leftLength = left.size(); in RopeByteString()
134 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
151 static ByteString concatenate(ByteString left, ByteString right) { in concatenate() argument
154 (left instanceof RopeByteString) ? (RopeByteString) left : null; in concatenate()
156 result = left; in concatenate()
157 } else if (left.size() == 0) { in concatenate()
160 int newLength = left.size() + right.size(); in concatenate()
[all …]
/external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/mock/
DMockRectF.java40 it.left = rhs.left; in $init()
47 public void $init(float left, float top, float right, float bottom) { in $init() argument
48 it.left = left; in $init()
61 it.left = it.left + dx; in offset()
69 public void offsetTo(float left, float top) { in offsetTo() argument
71 it.right = left + width(); in offsetTo()
74 it.left = left; in offsetTo()
87 return it.right - it.left; in width()
/external/opencv/cv/src/
Dcvutils.cpp113 int top, int left, int cn, const uchar* ) in icvCopyReplicateBorder_8u() argument
118 if( srcstep == dststep && dst + dststep*top + left*cn == src && in icvCopyReplicateBorder_8u()
132 return ifunc( src, srcstep, srcroi, dstroi, top, left ); in icvCopyReplicateBorder_8u()
147 return func( src, srcstep, srcroi, dst, dststep, dstroi, top, left ); in icvCopyReplicateBorder_8u()
161 left *= cn; in icvCopyReplicateBorder_8u()
165 if( idst + left != isrc ) in icvCopyReplicateBorder_8u()
167 idst[j + left] = isrc[j]; in icvCopyReplicateBorder_8u()
168 for( j = left - 1; j >= 0; j-- ) in icvCopyReplicateBorder_8u()
170 for( j = left+srcroi.width; j < dstroi.width; j++ ) in icvCopyReplicateBorder_8u()
180 left *= cn; in icvCopyReplicateBorder_8u()
[all …]
/external/icu/icu4c/source/common/
Duarrsort.c38 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
39 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
43 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
44 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
48 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
49 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
171 int32_t left, right; in subQuickSort() local
180 left=start; in subQuickSort()
188 cmp(context, array+left*itemSize, px)<0 in subQuickSort()
190 ++left; in subQuickSort()
[all …]

12345678910>>...73