Home
last modified time | relevance | path

Searched refs:right (Results 1 – 25 of 1874) sorted by relevance

12345678910>>...75

/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
60 return right; in noRebalancePolicy()
61 } else if (right == null) { 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()
68 right.childOrNull(RIGHT)); in noRebalancePolicy()
85 BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right) {
[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
292 right = (in[inOff + 4] & 0xff) << 24; in desFunc()
293 right |= (in[inOff + 5] & 0xff) << 16; in desFunc()
294 right |= (in[inOff + 6] & 0xff) << 8; in desFunc()
295 right |= (in[inOff + 7] & 0xff); in desFunc()
297 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
298 right ^= work; in desFunc()
300 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
301 right ^= work; in desFunc()
303 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
/external/v8/tools/
Dsplaytree.js81 node.right = this.root_.right;
82 this.root_.right = null;
84 node.right = this.root_;
110 this.root_ = this.root_.right;
112 var right = this.root_.right;
118 this.root_.right = right;
163 while (current.right) {
164 current = current.right;
233 var dummy, left, right;
234 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/chromium-trace/trace-viewer/src/importer/v8/
Dsplaytree.js62 node.right = this.root_.right;
63 this.root_.right = null;
65 node.right = this.root_;
91 this.root_ = this.root_.right;
93 var right = this.root_.right;
99 this.root_.right = right;
145 while (current.right) {
146 current = current.right;
216 var dummy, left, right;
217 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DDESEngine.java407 int work, right, left; in desFunc() local
414 right = (in[inOff + 4] & 0xff) << 24; in desFunc()
415 right |= (in[inOff + 5] & 0xff) << 16; in desFunc()
416 right |= (in[inOff + 6] & 0xff) << 8; in desFunc()
417 right |= (in[inOff + 7] & 0xff); in desFunc()
419 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
420 right ^= work; in desFunc()
422 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
423 right ^= work; in desFunc()
425 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
/external/v8/benchmarks/spinning-balls/
Dsplay-tree.js79 node.right = this.root_.right;
80 this.root_.right = null;
82 node.right = this.root_;
108 this.root_ = this.root_.right;
110 var right = this.root_.right;
116 this.root_.right = right;
146 while (current.right) {
147 current = current.right;
207 var dummy, left, right;
208 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
Dv8-splay.js53 right: GeneratePayloadTree(depth - 1, tag)
169 node.right = this.root_.right;
170 this.root_.right = null;
172 node.right = this.root_;
198 this.root_ = this.root_.right;
200 var right = this.root_.right;
206 this.root_.right = right;
236 while (current.right) {
237 current = current.right;
297 var dummy, left, right;
[all …]
/external/v8/benchmarks/
Dsplay.js58 right: GeneratePayloadTree(depth - 1, tag)
174 node.right = this.root_.right;
175 this.root_.right = null;
177 node.right = this.root_;
203 this.root_ = this.root_.right;
205 var right = this.root_.right;
211 this.root_.right = right;
241 while (current.right) {
242 current = current.right;
302 var dummy, left, right;
[all …]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
Dv8-splay.js53 right: GeneratePayloadTree(depth - 1, key)
168 node.right = this.root_.right;
169 this.root_.right = null;
171 node.right = this.root_;
197 this.root_ = this.root_.right;
199 var right = this.root_.right;
205 this.root_.right = right;
281 var dummy, left, right;
282 dummy = left = right = new SplayTree.Node(null, null);
292 current.left = tmp.right;
[all …]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
Dv8-splay.js53 right: GeneratePayloadTree(depth - 1, key)
168 node.right = this.root_.right;
169 this.root_.right = null;
171 node.right = this.root_;
197 this.root_ = this.root_.right;
199 var right = this.root_.right;
205 this.root_.right = right;
281 var dummy, left, right;
282 dummy = left = right = new SplayTree.Node(null, null);
292 current.left = tmp.right;
[all …]
/external/qemu/
Dd3des.c324 register unsigned long fval, work, right, leftt; in desfunc() local
328 right = block[1]; in desfunc()
329 work = ((leftt >> 4) ^ right) & 0x0f0f0f0fL; in desfunc()
330 right ^= work; in desfunc()
332 work = ((leftt >> 16) ^ right) & 0x0000ffffL; in desfunc()
333 right ^= work; in desfunc()
335 work = ((right >> 2) ^ leftt) & 0x33333333L; in desfunc()
337 right ^= (work << 2); in desfunc()
338 work = ((right >> 8) ^ leftt) & 0x00ff00ffL; in desfunc()
340 right ^= (work << 8); in desfunc()
[all …]
/external/webkit/Source/WebCore/html/parser/
DHTMLEntitySearch.cpp35 … HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right) in halfway() argument
37 return &left[(right - left) / 2]; in halfway()
64 const HTMLEntityTableEntry* right = m_last; in findFirst() local
65 if (left == right) in findFirst()
71 return right; in findFirst()
72 while (left + 1 < right) { in findFirst()
73 const HTMLEntityTableEntry* probe = halfway(left, right); in findFirst()
79 right = probe; in findFirst()
82 ASSERT(left + 1 == right); in findFirst()
83 return right; in findFirst()
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
DNFAFactory.java86 while ( s!=alt.right ) { in optimizeAlternative()
120 NFAState right = newState(); in build_Atom() local
122 right.associatedASTNode = associatedAST; in build_Atom()
123 transitionBetweenStates(left, right, label); in build_Atom()
124 StateCluster g = new StateCluster(left, right); in build_Atom()
138 NFAState right = newState(); in build_Set() local
140 right.associatedASTNode = associatedAST; in build_Set()
142 Transition e = new Transition(label,right); in build_Set()
144 StateCluster g = new StateCluster(left, right); in build_Set()
165 NFAState right = newState(); in build_Range() local
[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
17 realRect.right = right; in __constructor__()
24 realRect.right = otherRect.right; 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
37 realRect.right = right; 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()
72 sb.append(realRect.right); in toString()
81 return x > realRect.left && x < realRect.right in contains()
[all …]
/external/wpa_supplicant_8/src/crypto/
Ddes-internal.c320 u32 work, right, leftt; in desfunc() local
324 right = block[1]; in desfunc()
326 work = ((leftt >> 4) ^ right) & 0x0f0f0f0fL; in desfunc()
327 right ^= work; in desfunc()
330 work = ((leftt >> 16) ^ right) & 0x0000ffffL; in desfunc()
331 right ^= work; in desfunc()
334 work = ((right >> 2) ^ leftt) & 0x33333333L; in desfunc()
336 right ^= (work << 2); in desfunc()
338 work = ((right >> 8) ^ leftt) & 0x00ff00ffL; in desfunc()
340 right ^= (work << 8); in desfunc()
[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()
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
138 SkTSwap(*pivot, *right); in SkTQSort_Partition()
140 while (left < right) { in SkTQSort_Partition()
147 SkTSwap(*newPivot, *right); in SkTQSort_Partition()
156 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
157 while (left < right) { in SkTIntroSort()
159 SkTHeapSort<T>(left, right - left + 1, lessThan); in SkTIntroSort()
164 T* pivot = left + ((right - left) >> 1); in SkTIntroSort()
[all …]
DSkScalar.cpp22 int right = 0; in SkScalarInterpFunc() local
23 while (right < length && searchKey > keys[right]) in SkScalarInterpFunc()
24 right++; in SkScalarInterpFunc()
27 if (length == right) in SkScalarInterpFunc()
29 if (0 == right) in SkScalarInterpFunc()
32 SkScalar rightKey = keys[right]; in SkScalarInterpFunc()
33 SkScalar leftKey = keys[right-1]; in SkScalarInterpFunc()
35 return SkScalarInterp(values[right-1], values[right], fract); in SkScalarInterpFunc()
/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
133 right=limit; in subQuickSort()
145 cmp(context, px, array+(right-1)*itemSize)<0 in subQuickSort()
147 --right; in subQuickSort()
[all …]
/external/skia/legacy/src/core/
DSkScalar.cpp22 int right = 0; in SkScalarInterpFunc() local
23 while (right < length && searchKey > keys[right]) in SkScalarInterpFunc()
24 right++; in SkScalarInterpFunc()
27 if (length == right) in SkScalarInterpFunc()
29 if (0 == right) in SkScalarInterpFunc()
32 SkScalar rightKey = keys[right]; in SkScalarInterpFunc()
33 SkScalar leftKey = keys[right-1]; in SkScalarInterpFunc()
35 return SkScalarInterp(values[right-1], values[right], fract); in SkScalarInterpFunc()
/external/e2fsprogs/e2fsck/
Ddict.c52 #define right dict_right macro
87 lower = upper->right; in rotate_left()
88 upper->right = lowleft = lower->left; in rotate_left()
99 assert (upper == upparent->right); in rotate_left()
100 upparent->right = lower; in rotate_left()
117 upper->left = lowright = lower->right; in rotate_right()
122 if (upper == upparent->right) { in rotate_right()
123 upparent->right = lower; in rotate_right()
129 lower->right = upper; in rotate_right()
143 free_nodes(dict, node->right, nil); in free_nodes()
[all …]
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/
DTypes.h238 bool sameElementType(const TType& right) const { in sameElementType() argument
239 return type == right.type && in sameElementType()
240 size == right.size && in sameElementType()
241 matrix == right.matrix && in sameElementType()
242 structure == right.structure; in sameElementType()
244 bool operator==(const TType& right) const {
245 return type == right.type &&
246 size == right.size &&
247 matrix == right.matrix &&
248 array == right.array && (!array || arraySize == right.arraySize) &&
[all …]
/external/javassist/src/main/javassist/compiler/ast/
DASTList.java26 private ASTList right; field in ASTList
30 right = _tail; in ASTList()
35 right = null; in ASTList()
44 public ASTree getRight() { return right; } in getRight()
49 right = (ASTList)_right; in setRight()
64 public ASTList tail() { return right; } in tail()
67 right = _tail; in setTail()
82 list = list.right; in toString()
102 list = list.right; in length()
118 list = list.right; in sublist()
[all …]
/external/chromium/chrome/browser/resources/shared/js/cr/ui/
Dposition_util.js74 right: docElement.clientWidth property
105 if (anchorRect.right + popupRect.width > availRect.width &&
112 anchorRect.right + popupRect.width <= availRect.width) {
121 style.left = style.right = style.top = style.bottom = 'auto'
138 if (anchorRect.right + popupRect.width <= availRect.width)
139 style.left = anchorRect.right + 'px';
141 style.right = '0';
145 style.right = availRect.width - anchorRect.left + 'px';
157 if (anchorRect.right - popupRect.width >= 0) {
158 style.right = availRect.width - anchorRect.right + 'px';
[all …]
/external/replicaisland/src/com/replica/replicaisland/
DQuickSorter.java45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { in quicksort() argument
46 if (right <= left) return; in quicksort()
47 int i = partition(a, left, right, comparator); in quicksort()
49 quicksort(a, i + 1, right, comparator); in quicksort()
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { in partition() argument
55 int j = right; in partition()
57 while (comparator.compare(a[++i], a[right]) < 0) { // find item on left to swap in partition()
59 while (comparator.compare(a[right], a[--j]) < 0) { // find item on right to swap in partition()
72 a[i] = a[right]; in partition()
73 a[right] = swap; in partition()

12345678910>>...75