| /external/guava/guava/src/com/google/common/collect/ |
| D | ComparisonChain.java | 75 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/pdfium/core/fxcrt/ |
| D | fx_basic_coords.cpp | 30 if (left > right) { in Normalize()
32 left = right; in Normalize()
33 right = temp; in Normalize()
47 right = right < src_n.right ? right : src_n.right; in Intersect()
49 if (left > right || top > bottom) { in Intersect()
50 left = top = right = bottom = 0; in Intersect()
79 right = (FX_FLOAT)(rect.right); in CFX_FloatRect()
85 if (left > right) { in Normalize()
87 left = right; in Normalize()
88 right = temp; in Normalize()
[all …]
|
| /external/v8/src/compiler/ |
| D | machine-operator-reducer.cc | 169 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
172 base::bits::RotateRight32(m.left().Value(), m.right().Value())); in Reduce()
179 return ReplaceBool(m.left().Value() == m.right().Value()); in Reduce()
181 if (m.left().IsInt32Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
184 node->ReplaceInput(1, msub.right().node()); in Reduce()
194 return ReplaceBool(m.left().Value() == m.right().Value()); in Reduce()
196 if (m.left().IsInt64Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
199 node->ReplaceInput(1, msub.right().node()); in Reduce()
216 if (m.right().Is(0)) return Replace(m.right().node()); // x * 0 => 0 in Reduce()
217 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x in Reduce()
[all …]
|
| D | node-matchers.h | 247 const Right& right() const { return right_; } in right() function
249 bool IsFoldable() const { return left().HasValue() && right().HasValue(); } in IsFoldable()
250 bool LeftEqualsRight() const { return left().node() == right().node(); } in LeftEqualsRight()
256 node()->ReplaceInput(1, right().node()); in SwapInputs()
261 if (left().HasValue() && !right().HasValue()) { in PutConstantOnRight()
290 if (m.right().HasValue()) {
292 m.right().Value();
298 if (m.right().HasValue()) {
300 m.right().Value();
384 Matcher right_matcher(this->right().node(), true); in Initialize()
[all …]
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
| D | DESEngine.java | 408 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/ |
| D | splaytree.js | 81 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/ |
| D | splay-tree.js | 79 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/ |
| D | splay.js | 58 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/ |
| D | d3des.c | 336 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/ |
| D | expr.c | 39 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/ltp/utils/ffsb-6.0-rc2/ |
| D | rbt.c | 44 node->parent = node->right = node->left = NULL; in rbnode_construct()
56 rbnode_destruct(node->right, d); in rbnode_destruct()
68 int irightdepth = (node->right) ? rbnode_depth(node->right) : 0; in rbnode_depth()
89 while (node->right) in rbnode_maximum()
90 node = node->right; in rbnode_maximum()
110 if (node->right) { in rbnode_successor()
117 succ_node = node->right; in rbnode_successor()
128 while (succ_node && prev_node == succ_node->right) { in rbnode_successor()
151 while (pred_node->right) in rbnode_predecessor()
152 pred_node = pred_node->right; in rbnode_predecessor()
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | NFAFactory.java | 86 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/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| D | ShadowRect.java | 14 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/ |
| D | des-internal.c | 320 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/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | RopeByteString.java | 119 private final ByteString right; field in RopeByteString
132 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument
134 this.right = right; in RopeByteString()
136 totalLength = leftLength + right.size(); in RopeByteString()
137 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
155 static ByteString concatenate(ByteString left, ByteString right) { in concatenate() argument
156 if (right.size() == 0) { in concatenate()
161 return right; in concatenate()
164 final int newLength = left.size() + right.size(); in concatenate()
168 return concatenateBytes(left, right); in concatenate()
[all …]
|
| /external/ImageMagick/MagickCore/ |
| D | splay-tree.c | 79 *right; member
199 node->right=(NodeInfo *) NULL; in AddValueToSplayTree()
205 node->right=node->left->right; in AddValueToSplayTree()
206 node->left->right=(NodeInfo *) NULL; in AddValueToSplayTree()
210 node->right=splay_tree->root; in AddValueToSplayTree()
211 node->left=node->right->left; in AddValueToSplayTree()
212 node->right->left=(NodeInfo *) NULL; in AddValueToSplayTree()
262 node->right=(NodeInfo *) NULL; in LinkSplayTreeNodes()
264 node->right=LinkSplayTreeNodes(nodes,bisect+1,high); in LinkSplayTreeNodes()
374 node=splay_tree->root->right; in CloneSplayTree()
[all …]
|
| /external/syslinux/com32/sysdump/ |
| D | rbtree.c | 60 tree = tree->right; in rb_search()
73 struct rbtree *x = h->right; in rotate_left()
74 h->right = x->left; in rotate_left()
84 h->left = x->right; in rotate_right()
85 x->right = h; in rotate_right()
86 x->red = x->right->red; in rotate_right()
87 x->right->red = true; in rotate_right()
95 h->right->red = !h->right->red; in color_flip()
100 node->left = node->right = NULL; in rb_insert()
108 if (is_red(tree->left) && is_red(tree->right)) in rb_insert()
[all …]
|
| /external/eigen/unsupported/test/ |
| D | cxx11_tensor_concatenation.cpp | 20 Tensor<int, 3, DataLayout> right(3, 3, 1); in test_dimension_failures() local
22 right.setRandom(); in test_dimension_failures()
25 Tensor<int, 3, DataLayout> concatenation = left.concatenate(right, 0); in test_dimension_failures()
28 VERIFY_RAISES_ASSERT(concatenation = left.concatenate(right, 1)); in test_dimension_failures()
29 VERIFY_RAISES_ASSERT(concatenation = left.concatenate(right, 2)); in test_dimension_failures()
32 VERIFY_RAISES_ASSERT(concatenation = left.concatenate(right, 3)); in test_dimension_failures()
33 VERIFY_RAISES_ASSERT(concatenation = left.concatenate(right, -1)); in test_dimension_failures()
40 Tensor<int, 3, DataLayout> right(2, 3, 1); in test_static_dimension_failure() local
45 Tensor<int, 3, DataLayout> concatenation = left.concatenate(right, 0); in test_static_dimension_failure()
51 .concatenate(right, 0); in test_static_dimension_failure()
[all …]
|
| /external/e2fsprogs/lib/support/ |
| D | dict.c | 58 #define right dict_right macro
93 lower = upper->right; in rotate_left()
94 upper->right = lowleft = lower->left; in rotate_left()
105 dict_assert (upper == upparent->right); in rotate_left()
106 upparent->right = lower; in rotate_left()
123 upper->left = lowright = lower->right; in rotate_right()
128 if (upper == upparent->right) { in rotate_right()
129 upparent->right = lower; in rotate_right()
135 lower->right = upper; in rotate_right()
149 free_nodes(dict, node->right, nil); in free_nodes()
[all …]
|
| /external/skia/src/core/ |
| D | SkTSort.h | 120 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
121 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
138 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
140 SkTSwap(*pivot, *right); in SkTQSort_Partition()
142 while (left < right) { in SkTQSort_Partition()
149 SkTSwap(*newPivot, *right); in SkTQSort_Partition()
165 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
167 if (right - left < 32) { in SkTIntroSort()
168 SkTInsertionSort(left, right, lessThan); in SkTIntroSort()
173 SkTHeapSort<T>(left, right - left + 1, lessThan); in SkTIntroSort()
[all …]
|
| D | SkScalar.cpp | 21 int right = 0; in SkScalarInterpFunc() local
22 while (right < length && searchKey > keys[right]) in SkScalarInterpFunc()
23 right++; in SkScalarInterpFunc()
26 if (length == right) in SkScalarInterpFunc()
28 if (0 == right) in SkScalarInterpFunc()
31 SkScalar rightKey = keys[right]; in SkScalarInterpFunc()
32 SkScalar leftKey = keys[right-1]; in SkScalarInterpFunc()
34 return SkScalarInterp(values[right-1], values[right], fract); in SkScalarInterpFunc()
|
| /external/clang/test/SemaCXX/ |
| D | cxx1y-variable-templates_in_class.cpp | 14 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/javassist/src/main/javassist/compiler/ast/ |
| D | ASTList.java | 26 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/ |
| D | uarrsort.c | 40 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
41 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
45 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
46 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
50 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
51 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
173 int32_t left, right; in subQuickSort() local
183 right=limit; in subQuickSort()
195 cmp(context, px, array+(right-1)*itemSize)<0 in subQuickSort()
197 --right; in subQuickSort()
[all …]
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/ |
| D | Trans.java | 93 int right = -1; in trans() local
95 right = line.indexOf('>'); in trans()
96 if (right < 0) { in trans()
97 right = line.length()-1; in trans()
99 buf.append(line.substring(0, right+1)); in trans()
100 if (DEBUG) System.out.println("*S:" + line.substring(0, right+1)); in trans()
104 int left = line.indexOf('<', right+1); in trans()
106 if (right < line.length()-1) { in trans()
107 buf.append(trans.transliterate(line.substring(right+1))); in trans()
108 if (DEBUG) System.out.println("T:" + line.substring(right+1)); in trans()
[all …]
|