| /external/guava/guava/src/com/google/common/collect/ |
| D | ComparisonChain.java | 72 public ComparisonChain compare(Comparable left, Comparable right) {
73 return classify(left.compareTo(right));
78 @Nullable T left, @Nullable T right, Comparator<T> comparator) {
79 return classify(comparator.compare(left, right));
83 public ComparisonChain compare(int left, int right) {
84 return classify(Ints.compare(left, right));
88 public ComparisonChain compare(long left, long right) {
89 return classify(Longs.compare(left, right));
93 public ComparisonChain compare(float left, float right) {
94 return classify(Float.compare(left, right));
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | ComparisonChain.java | 72 public ComparisonChain compare(Comparable left, Comparable right) {
73 return classify(left.compareTo(right));
78 @NullableDecl T left, @NullableDecl T right, Comparator<T> comparator) {
79 return classify(comparator.compare(left, right));
83 public ComparisonChain compare(int left, int right) {
84 return classify(Ints.compare(left, right));
88 public ComparisonChain compare(long left, long right) {
89 return classify(Longs.compare(left, right));
93 public ComparisonChain compare(float left, float right) {
94 return classify(Float.compare(left, right));
[all …]
|
| /external/grpc-grpc/src/core/lib/avl/ |
| D | avl.cc | 54 unref_node(vtable, node->right, user_data); in unref_node()
67 calculate_height(node->right)); in calculate_height()
73 assert_invariants(n->right); in assert_invariants()
75 assert(labs(node_height(n->left) - node_height(n->right)) <= 1); in assert_invariants()
83 grpc_avl_node* right) { in new_node() argument
89 node->right = assert_invariants(right); in new_node()
90 node->height = 1 + GPR_MAX(node_height(left), node_height(right)); in new_node()
108 return get(vtable, node->right, key, user_data); in get()
128 grpc_avl_node* right, void* user_data) { in rotate_left() argument
129 grpc_avl_node* n = new_node(vtable->copy_key(right->key, user_data), in rotate_left()
[all …]
|
| /external/v8/src/builtins/ |
| D | number.tq | 340 let right: JSAny = rightArg;
345 typeswitch (right) {
346 case (right: Smi): {
347 return math::TrySmiAdd(left, right) otherwise goto Float64s(
348 SmiToFloat64(left), SmiToFloat64(right));
350 case (right: HeapNumber): {
351 goto Float64s(SmiToFloat64(left), Convert<float64>(right));
353 case (right: BigInt): {
354 goto Numerics(left, right);
356 case (right: String): {
[all …]
|
| /external/v8/src/compiler/ |
| D | machine-operator-reducer.cc | 306 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
309 m.left().ResolvedValue(), m.right().ResolvedValue() & 31)); in Reduce()
320 m.right().ResolvedValue()); in Reduce()
322 if (m.left().IsInt64Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
325 node->ReplaceInput(1, msub.right().node()); in Reduce()
342 if (m.right().Is(0)) return Replace(m.right().node()); // x * 0 => 0 in Reduce()
343 if (m.right().Is(1)) return Replace(m.left().node()); // x * 1 => x in Reduce()
346 m.right().ResolvedValue())); in Reduce()
348 if (m.right().Is(-1)) { // x * -1 => 0 - x in Reduce()
354 if (m.right().IsPowerOf2()) { // x * 2^n => x << n in Reduce()
[all …]
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
| D | DESEngine.java | 409 int work, right, left; in desFunc() local
412 right = Pack.bigEndianToInt(in, inOff + 4); in desFunc()
414 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
415 right ^= work; in desFunc()
417 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
418 right ^= work; in desFunc()
420 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
422 right ^= (work << 2); in desFunc()
423 work = ((right >>> 8) ^ left) & 0x00ff00ff; in desFunc()
425 right ^= (work << 8); in desFunc()
[all …]
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/engines/ |
| D | DESEngine.java | 411 int work, right, left; in desFunc() local
414 right = Pack.bigEndianToInt(in, inOff + 4); in desFunc()
416 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
417 right ^= work; in desFunc()
419 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
420 right ^= work; in desFunc()
422 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
424 right ^= (work << 2); in desFunc()
425 work = ((right >>> 8) ^ left) & 0x00ff00ff; in desFunc()
427 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/u-boot/scripts/kconfig/ |
| D | expr.c | 38 e->right.expr = e2; in expr_alloc_two()
47 e->right.sym = s2; in expr_alloc_comp()
88 e->right.sym = org->right.sym; in expr_copy()
94 e->right.expr = expr_copy(org->right.expr); in expr_copy()
127 expr_free(e->right.expr); in expr_free()
155 __expr_eliminate_eq(type, &e1->right.expr, &e2); in __expr_eliminate_eq()
160 __expr_eliminate_eq(type, &e1, &e2->right.expr); in __expr_eliminate_eq()
264 return e1->left.sym == e2->left.sym && e1->right.sym == e2->right.sym; in expr_eq()
315 e->right.expr = expr_eliminate_yn(e->right.expr); in expr_eliminate_yn()
319 expr_free(e->right.expr); in expr_eliminate_yn()
[all …]
|
| /external/mesa3d/src/util/ |
| D | rb_tree.c | 90 while (node->right) in rb_node_maximum()
91 node = node->right; in rb_node_maximum()
119 assert(u == p->right); in rb_tree_splice()
120 p->right = v; in rb_tree_splice()
129 assert(x && x->right); in rb_tree_rotate_left()
131 struct rb_node *y = x->right; in rb_tree_rotate_left()
132 x->right = y->left; in rb_tree_rotate_left()
146 y->left = x->right; in rb_tree_rotate_right()
147 if (x->right) in rb_tree_rotate_right()
148 rb_node_set_parent(x->right, y); in rb_tree_rotate_right()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
| D | GCNILPSched.cpp | 43 const SUnit *pickBest(const SUnit *left, const SUnit *right);
133 static int BUCompareLatency(const SUnit *left, const SUnit *right) { in BUCompareLatency() argument
137 int RHeight = (int)right->getHeight(); in BUCompareLatency()
150 int RDepth = right->getDepth(); in BUCompareLatency()
153 << ") depth " << LDepth << " vs SU (" << right->NodeNum in BUCompareLatency()
157 if (left->Latency != right->Latency) in BUCompareLatency()
158 return left->Latency > right->Latency ? 1 : -1; in BUCompareLatency()
163 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) in pickBest() argument
170 int spread = (int)left->getDepth() - (int)right->getDepth(); in pickBest()
173 << left->getDepth() << " != SU(" << right->NodeNum in pickBest()
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | cost_estimator.cc | 21 Costs CombineCosts(const Costs& left, const Costs& right) { in CombineCosts() argument
27 result.execution_time += right.execution_time; in CombineCosts()
28 result.compute_time += right.compute_time; in CombineCosts()
29 result.memory_time += right.memory_time; in CombineCosts()
30 result.intermediate_memory_time += right.intermediate_memory_time; in CombineCosts()
31 result.intermediate_memory_read_time += right.intermediate_memory_read_time; in CombineCosts()
32 result.intermediate_memory_write_time += right.intermediate_memory_write_time; in CombineCosts()
34 if (right.max_per_op_buffers != kMemoryUnknown) { in CombineCosts()
36 std::max(left.max_per_op_buffers, right.max_per_op_buffers); in CombineCosts()
38 if (right.max_per_op_streaming != kMemoryUnknown) { in CombineCosts()
[all …]
|
| /external/antlr/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/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 | 135 private final ByteString right; field in RopeByteString
146 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument
148 this.right = right; in RopeByteString()
150 totalLength = leftLength + right.size(); in RopeByteString()
151 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
167 static ByteString concatenate(ByteString left, ByteString right) { in concatenate() argument
168 if (right.size() == 0) { in concatenate()
173 return right; in concatenate()
176 final int newLength = left.size() + right.size(); in concatenate()
180 return concatenateBytes(left, right); in concatenate()
[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/ImageMagick/MagickCore/ |
| D | splay-tree.c | 80 *right; member
200 node->right=(NodeInfo *) NULL; in AddValueToSplayTree()
206 node->right=node->left->right; in AddValueToSplayTree()
207 node->left->right=(NodeInfo *) NULL; in AddValueToSplayTree()
211 node->right=splay_tree->root; in AddValueToSplayTree()
212 node->left=node->right->left; in AddValueToSplayTree()
213 node->right->left=(NodeInfo *) NULL; in AddValueToSplayTree()
263 node->right=(NodeInfo *) NULL; in LinkSplayTreeNodes()
265 node->right=LinkSplayTreeNodes(nodes,bisect+1,high); in LinkSplayTreeNodes()
375 node=splay_tree->root->right; in CloneSplayTree()
[all …]
|
| /external/pdfium/core/fxcrt/ |
| D | fx_coordinates.cpp | 42 static_assert(offsetof(FX_RECT, right) == offsetof(RECT, right),
50 static_assert(sizeof(FX_RECT::right) == sizeof(RECT::right),
59 if (left > right) in Normalize()
60 std::swap(left, right); in Normalize()
71 right = std::min(right, src_n.right); in Intersect()
73 if (left > right || top > bottom) { in Intersect()
74 left = top = right = bottom = 0; in Intersect()
80 : left(rect.left), bottom(rect.top), right(rect.right), top(rect.bottom) {} in CFX_FloatRect()
101 if (left > right) in Normalize()
102 std::swap(left, right); in Normalize()
[all …]
|
| /external/aac/libAACenc/src/ |
| D | tonality.cpp | 138 FIXP_DBL right; in FDKaacEnc_CalculateFullTonality() local
140 right = chaosMeasurePerLine[j]; in FDKaacEnc_CalculateFullTonality()
141 right = right - (right >> 2); in FDKaacEnc_CalculateFullTonality()
142 left = right + (left >> 2); in FDKaacEnc_CalculateFullTonality()
145 right = chaosMeasurePerLine[j + 1]; in FDKaacEnc_CalculateFullTonality()
146 right = right - (right >> 2); in FDKaacEnc_CalculateFullTonality()
147 left = right + (left >> 2); in FDKaacEnc_CalculateFullTonality()
151 right = chaosMeasurePerLine[j]; in FDKaacEnc_CalculateFullTonality()
152 right = right - (right >> 2); in FDKaacEnc_CalculateFullTonality()
153 left = right + (left >> 2); in FDKaacEnc_CalculateFullTonality()
|
| /external/f2fs-tools/fsck/ |
| D | dict.c | 53 #define right dict_right macro
87 lower = upper->right; in rotate_left()
88 upper->right = lowleft = lower->left; in rotate_left()
99 dict_assert(upper == upparent->right); in rotate_left()
100 upparent->right = lower; in rotate_left()
116 upper->left = lowright = lower->right; in rotate_right()
121 if (upper == upparent->right) { in rotate_right()
122 upparent->right = lower; in rotate_right()
128 lower->right = upper; in rotate_right()
141 free_nodes(dict, node->right, nil); in free_nodes()
[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/skqp/src/core/ |
| D | SkTSort.h | 123 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
124 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
141 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
144 swap(*pivot, *right); in SkTQSort_Partition()
146 while (left < right) { in SkTQSort_Partition()
153 swap(*newPivot, *right); in SkTQSort_Partition()
169 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
171 if (right - left < 32) { in SkTIntroSort()
172 SkTInsertionSort(left, right, lessThan); in SkTIntroSort()
177 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/skia/src/core/ |
| D | SkTSort.h | 123 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
124 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
141 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
144 swap(*pivot, *right); in SkTQSort_Partition()
146 while (left < right) { in SkTQSort_Partition()
153 swap(*newPivot, *right); in SkTQSort_Partition()
169 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
171 if (right - left < 32) { in SkTIntroSort()
172 SkTInsertionSort(left, right, lessThan); in SkTIntroSort()
177 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()
|