Home
last modified time | relevance | path

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

12345678910>>...74

/external/guava/guava/src/com/google/common/collect/
DBstCountBasedBalancePolicies.java52 BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right) { in noRebalancePolicy()
53 return checkNotNull(nodeFactory).createNode(source, left, right); in noRebalancePolicy()
58 public N combine(BstNodeFactory<N> nodeFactory, @Nullable N left, @Nullable N right) { in noRebalancePolicy() argument
59 if (left == null) { in noRebalancePolicy()
62 return left; in noRebalancePolicy()
63 } else if (countAggregate.treeValue(left) > countAggregate.treeValue(right)) { in noRebalancePolicy()
65 left, left.childOrNull(LEFT), combine(nodeFactory, left.childOrNull(RIGHT), right)); in noRebalancePolicy()
67 return nodeFactory.createNode(right, combine(nodeFactory, left, right.childOrNull(LEFT)), in noRebalancePolicy()
85 BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right) {
86 long countL = countAggregate.treeValue(left);
[all …]
DComparisonChain.java67 Comparable left, Comparable right) {
68 return classify(left.compareTo(right));
71 @Nullable T left, @Nullable T right, Comparator<T> comparator) {
72 return classify(comparator.compare(left, right));
74 @Override public ComparisonChain compare(int left, int right) {
75 return classify(Ints.compare(left, right));
77 @Override public ComparisonChain compare(long left, long right) {
78 return classify(Longs.compare(left, right));
80 @Override public ComparisonChain compare(float left, float right) {
81 return classify(Float.compare(left, right));
[all …]
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/
DDES.java285 int work, right, left; in desFunc() local
287 left = (in[inOff + 0] & 0xff) << 24; in desFunc()
288 left |= (in[inOff + 1] & 0xff) << 16; in desFunc()
289 left |= (in[inOff + 2] & 0xff) << 8; in desFunc()
290 left |= (in[inOff + 3] & 0xff); in desFunc()
297 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
299 left ^= (work << 4); in desFunc()
300 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
302 left ^= (work << 16); in desFunc()
303 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DDESEngine.java407 int work, right, left; in desFunc() local
409 left = (in[inOff + 0] & 0xff) << 24; in desFunc()
410 left |= (in[inOff + 1] & 0xff) << 16; in desFunc()
411 left |= (in[inOff + 2] & 0xff) << 8; in desFunc()
412 left |= (in[inOff + 3] & 0xff); in desFunc()
419 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
421 left ^= (work << 4); in desFunc()
422 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
424 left ^= (work << 16); in desFunc()
425 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
Dv8-splay.js52 left: GeneratePayloadTree(depth - 1, key),
167 node.left = this.root_;
172 node.left = this.root_.left;
173 this.root_.left = null;
196 if (!this.root_.left) {
200 this.root_ = this.root_.left;
242 } else if (this.root_.left) {
243 return this.findMax(this.root_.left);
281 var dummy, left, right;
282 dummy = left = right = new SplayTree.Node(null, null);
[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/webkit/PerformanceTests/SunSpider/tests/v8-v4/
Dv8-splay.js52 left: GeneratePayloadTree(depth - 1, key),
167 node.left = this.root_;
172 node.left = this.root_.left;
173 this.root_.left = null;
196 if (!this.root_.left) {
200 this.root_ = this.root_.left;
242 } else if (this.root_.left) {
243 return this.findMax(this.root_.left);
281 var dummy, left, right;
282 dummy = left = right = new SplayTree.Node(null, null);
[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/chromium-trace/trace-viewer/src/importer/v8/
Dsplaytree.js61 node.left = this.root_;
66 node.left = this.root_.left;
67 this.root_.left = null;
90 if (!this.root_.left) {
94 this.root_ = this.root_.left;
130 while (current.left) {
131 current = current.left;
167 } else if (this.root_.left) {
168 return this.findMax(this.root_.left);
216 var dummy, left, right;
[all …]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
Dv8-splay.js52 left: GeneratePayloadTree(depth - 1, tag),
168 node.left = this.root_;
173 node.left = this.root_.left;
174 this.root_.left = null;
197 if (!this.root_.left) {
201 this.root_ = this.root_.left;
258 } else if (this.root_.left) {
259 return this.findMax(this.root_.left);
297 var dummy, left, right;
298 dummy = left = right = new SplayTree.Node(null, null);
[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/webkit/Source/WebCore/html/parser/
DHTMLEntitySearch.cpp35 const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* r… in halfway() argument
37 return &left[(right - left) / 2]; in halfway()
63 const HTMLEntityTableEntry* left = m_first; in findFirst() local
65 if (left == right) in findFirst()
66 return left; in findFirst()
67 CompareResult result = compare(left, nextCharacter); in findFirst()
69 return left; in findFirst()
72 while (left + 1 < right) { in findFirst()
73 const HTMLEntityTableEntry* probe = halfway(left, right); in findFirst()
76 left = probe; in findFirst()
[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()
156 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/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/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/zlib/src/examples/
Denough.c200 local big_t count(int syms, int len, int left) in count() argument
210 if (syms == left) in count()
214 assert(syms > left && left > 0 && len < max); in count()
217 index = INDEX(syms, left, len); in count()
224 least = (left << 1) - syms; in count()
231 most = (((code_t)left << (max - len)) - syms) / in count()
237 got = count(syms - use, len + 1, (left - use) << 1); in count()
255 local int beenhere(int syms, int len, int left, int mem, int rem) in beenhere() argument
264 index = INDEX(syms, left, len); in beenhere()
319 local void examine(int syms, int len, int left, int mem, int rem) in examine() argument
[all …]
Dgzjoin.c80 unsigned left; /* bytes remaining at next */ member
112 in->left = 0; in bopen()
126 if (in->left != 0) in bload()
130 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left); in bload()
133 in->left += (unsigned)len; in bload()
134 } while (len != 0 && in->left < CHUNK); in bload()
139 #define bget(in) (in->left ? 0 : bload(in), \
140 in->left ? (in->left--, *(in->next)++) : \
163 if (skip <= in->left) { in bskip()
164 in->left -= skip; in bskip()
[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/icu4c/common/
Duarrsort.c31 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
32 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
36 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
37 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
41 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
42 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
123 int32_t left, right; in subQuickSort() local
132 left=start; in subQuickSort()
140 cmp(context, array+left*itemSize, px)<0 in subQuickSort()
142 ++left; in subQuickSort()
[all …]
/external/zlib/src/contrib/blast/
Dblast.c40 unsigned left; /* available input at in */ member
73 if (s->left == 0) { in bits()
74 s->left = s->infun(s->inhow, &(s->in)); in bits()
75 if (s->left == 0) longjmp(s->env, 1); /* out of input */ in bits()
78 s->left--; in bits()
131 int left; /* bits left in next or left to process */ in decode() local
135 left = s->bitcnt; in decode()
140 while (left--) { in decode()
155 left = (MAXBITS+1) - len; in decode()
156 if (left == 0) break; in decode()
[all …]
/external/guava/guava/src/com/google/common/io/
DLimitInputStream.java35 private long left; field in LimitInputStream
48 left = limit; in LimitInputStream()
52 return (int) Math.min(in.available(), left); in available()
57 mark = left; in mark()
62 if (left == 0) { in read()
68 --left; in read()
74 if (left == 0) { in read()
78 len = (int) Math.min(len, left); in read()
81 left -= result; in read()
95 left = mark; in reset()
[all …]
/external/webkit/Source/WebCore/platform/graphics/gpu/
DPODIntervalTree.h124 IntervalNode* left = node->left(); in searchForOverlapsFrom() local
125 if (left in searchForOverlapsFrom()
128 && !(left->data().maxHigh() < interval.low())) in searchForOverlapsFrom()
129 searchForOverlapsFrom(left, interval, res); in searchForOverlapsFrom()
147 IntervalNode* left = node->left(); in updateNode() local
148 if (left) { in updateNode()
149 if (*curMax < left->data().maxHigh()) in updateNode()
150 curMax = &left->data().maxHigh(); in updateNode()
171 IntervalNode* left = node->left(); in checkInvariantsFromNode() local
173 if (left) { in checkInvariantsFromNode()
[all …]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/objectdescriptors/
DBitReaderBuffer.java19 int left = 8 - position % 8; in readBits()
21 if (i <= left) { in readBits()
22 rc = (v << (position % 8) & 0xFF) >> ((position % 8) + (left - i)); in readBits()
25 int now = left; in readBits()
26 int then = i - left; in readBits()
40 int left = 8 - position % 8;
41 if (left == 8) {
42 left = 0;
44 readBits(left);
45 return left;

12345678910>>...74