Home
last modified time | relevance | path

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

12345678910>>...105

/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/v8/src/compiler/
Dmachine-operator-reducer.cc140 if (m.right().Is(0)) return Replace(m.left().node()); // x ^ 0 => x in Reduce()
142 return ReplaceInt32(m.left().Value() ^ m.right().Value()); in Reduce()
145 if (m.left().IsWord32Xor() && m.right().Is(-1)) { in Reduce()
147 if (mleft.right().Is(-1)) { // (x ^ -1) ^ -1 => x in Reduce()
157 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in Reduce()
159 return ReplaceInt32(m.left().Value() >> m.right().Value()); in Reduce()
167 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
170 base::bits::RotateRight32(m.left().Value(), m.right().Value())); in Reduce()
177 return ReplaceBool(m.left().Value() == m.right().Value()); in Reduce()
179 if (m.left().IsInt32Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DDESEngine.java408 int work, right, left; in desFunc() local
415 right = (in[inOff + 4] & 0xff) << 24; in desFunc()
416 right |= (in[inOff + 5] & 0xff) << 16; in desFunc()
417 right |= (in[inOff + 6] & 0xff) << 8; in desFunc()
418 right |= (in[inOff + 7] & 0xff); in desFunc()
420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
421 right ^= work; in desFunc()
423 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
424 right ^= work; in desFunc()
426 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/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/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/libvncserver/common/
Dd3des.c336 register unsigned long fval, work, right, leftt; in desfunc() local
340 right = block[1]; in desfunc()
341 work = ((leftt >> 4) ^ right) & 0x0f0f0f0fL; in desfunc()
342 right ^= work; in desfunc()
344 work = ((leftt >> 16) ^ right) & 0x0000ffffL; in desfunc()
345 right ^= work; in desfunc()
347 work = ((right >> 2) ^ leftt) & 0x33333333L; in desfunc()
349 right ^= (work << 2); in desfunc()
350 work = ((right >> 8) ^ leftt) & 0x00ff00ffL; in desfunc()
352 right ^= (work << 8); in desfunc()
[all …]
/external/toybox/kconfig/
Dexpr.c39 e->right.expr = e2; in expr_alloc_two()
49 e->right.sym = s2; in expr_alloc_comp()
86 e->right.sym = org->right.sym; in expr_copy()
92 e->right.expr = expr_copy(org->right.expr); in expr_copy()
121 expr_free(e->right.expr); in expr_free()
139 __expr_eliminate_eq(type, &e1->right.expr, &e2); in __expr_eliminate_eq()
144 __expr_eliminate_eq(type, &e1, &e2->right.expr); in __expr_eliminate_eq()
203 return e1->left.sym == e2->left.sym && e1->right.sym == e2->right.sym; in expr_eq()
243 e->right.expr = expr_eliminate_yn(e->right.expr); in expr_eliminate_yn()
247 expr_free(e->right.expr); in expr_eliminate_yn()
[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/avahi/avahi-core/
Dprioq.c67 n = n->right; in get_node_at_xy()
100 a->parent->right = a; in exchange_nodes()
109 r = a->right; in exchange_nodes()
110 if ((a->right = b->right)) in exchange_nodes()
111 a->right->parent = a; in exchange_nodes()
112 if ((b->right = r)) in exchange_nodes()
113 b->right->parent = b; in exchange_nodes()
116 if ((b->right = a->right)) in exchange_nodes()
117 b->right->parent = b; in exchange_nodes()
118 a->right = b; in exchange_nodes()
[all …]
/external/robolectric/v1/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/pdfium/core/src/fxcrt/
Dfx_basic_coords.cpp13 if (left > right) { in Normalize()
15 left = right; in Normalize()
16 right = temp; in Normalize()
30 right = right < src_n.right ? right : src_n.right; in Intersect()
32 if (left > right || top > bottom) { in Intersect()
33 left = top = right = bottom = 0; in Intersect()
41 right = right > other.right ? right : other.right; in Union()
70 right = (FX_FLOAT)(rect.right); in CFX_FloatRect()
76 if (left > right) { in Normalize()
78 left = right; in Normalize()
[all …]
/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/protobuf/java/src/main/java/com/google/protobuf/
DRopeByteString.java116 private final ByteString right; field in RopeByteString
129 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument
131 this.right = right; in RopeByteString()
133 totalLength = leftLength + right.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
155 if (right.size() == 0) { in concatenate()
158 result = right; in concatenate()
160 int newLength = left.size() + right.size(); in concatenate()
164 result = concatenateBytes(left, right); in concatenate()
[all …]
/external/clang/test/SemaCXX/
Dcxx1y-variable-templates_in_class.cpp14 template<typename T, typename T0> static CONST T right = T(100); member in A
15 template<typename T> static CONST T right<T,int> = 5; member in A
16 …template<typename T> CONST int right<int,T>; // expected-error {{member 'right' declared as a tem… member in A
17 …template<typename T> CONST float right<float,T> = 5; // expected-error {{member 'right' declared … member in A
18 …template<> static CONST int right<int,int> = 7; // expected-error {{explicit specialization … member in A
19 …template<> static CONST float right<float,int>; // expected-error {{explicit specialization … member in A
20 …template static CONST int right<int,int>; // expected-error {{template specialization requires… member in A
26 template<typename T, typename T0> static CONST T right = T(100); member in out_of_line::B0
27 template<typename T> static CONST T right<T,int> = T(5); member in out_of_line::B0
29 template<> CONST int B0::right<int,int> = 7; member in out_of_line::B0
[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()
163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
165 if (right - left < 32) { in SkTIntroSort()
166 SkTInsertionSort(left, right, lessThan); in SkTIntroSort()
171 SkTHeapSort<T>(left, right - left + 1, lessThan); 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/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/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
181 right=limit; in subQuickSort()
193 cmp(context, px, array+(right-1)*itemSize)<0 in subQuickSort()
195 --right; in subQuickSort()
[all …]
/external/v8/src/compiler/arm64/
Dinstruction-selector-arm64.cc187 if (mright.right().Is(0xff) || mright.right().Is(0xffff)) { in TryMatchAnyExtend()
188 int32_t mask = mright.right().Value(); in TryMatchAnyExtend()
200 if ((mright.right().Is(16) && mleft_of_right.right().Is(16)) || in TryMatchAnyExtend()
201 (mright.right().Is(24) && mleft_of_right.right().Is(24))) { in TryMatchAnyExtend()
202 int32_t shift = mright.right().Value(); in TryMatchAnyExtend()
238 Node* right_node = m.right().node(); in VisitBinop()
261 inputs[input_count++] = g.UseImmediate(m_shift.right().node()); in VisitBinop()
268 inputs[input_count++] = g.UseImmediate(m_shift.right().node()); in VisitBinop()
311 if (m.right().HasValue() && (m.right().Value() < 0) && in VisitAddSub()
312 g.CanBeImmediate(-m.right().Value(), kArithmeticImm)) { in VisitAddSub()
[all …]
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/
DTrans.java91 int right = -1; in trans() local
93 right = line.indexOf('>'); in trans()
94 if (right < 0) { in trans()
95 right = line.length()-1; in trans()
97 buf.append(line.substring(0, right+1)); in trans()
98 if (DEBUG) System.out.println("*S:" + line.substring(0, right+1)); in trans()
102 int left = line.indexOf('<', right+1); in trans()
104 if (right < line.length()-1) { in trans()
105 buf.append(trans.transliterate(line.substring(right+1))); in trans()
106 if (DEBUG) System.out.println("T:" + line.substring(right+1)); in trans()
[all …]
/external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/
Dshadow-handler.js53 function mergeShadow(left, right) { argument
54 while (left.lengths.length < Math.max(left.lengths.length, right.lengths.length))
56 while (right.lengths.length < Math.max(left.lengths.length, right.lengths.length))
57 right.lengths.push({px: 0});
59 if (left.inset != right.inset || !!left.color != !!right.color) {
67 var mergedDimensions = scope.mergeDimensions(left.lengths[i], right.lengths[i], i == 2);
72 if (left.color && right.color) {
73 var mergedColor = scope.mergeColors(left.color, right.color);
90 function mergeNestedRepeatedShadow(nestedMerge, separator, left, right) { argument
96 for (var i = 0; i < left.length || i < right.length; i++) {
[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()
/external/v8/test/webkit/
Dorder-of-operations-expected.txt24 PASS (function(){ leftRight = ""; left() > right(); return leftRight; })() is "LeftRight"
25 PASS (function(){ leftRight = ""; left() >= right(); return leftRight; })() is "LeftRight"
26 PASS (function(){ leftRight = ""; left() < right(); return leftRight; })() is "LeftRight"
27 PASS (function(){ leftRight = ""; left() <= right(); return leftRight; })() is "LeftRight"
28 PASS (function(){ leftRight = ""; left() + right(); return leftRight; })() is "LeftRight"
29 PASS (function(){ leftRight = ""; left() - right(); return leftRight; })() is "LeftRight"
30 PASS (function(){ leftRight = ""; left() / right(); return leftRight; })() is "LeftRight"
31 PASS (function(){ leftRight = ""; left() * right(); return leftRight; })() is "LeftRight"
32 PASS (function(){ leftRight = ""; left() % right(); return leftRight; })() is "LeftRight"
33 PASS (function(){ leftRight = ""; left() << right(); return leftRight; })() is "LeftRight"
[all …]

12345678910>>...105