Home
last modified time | relevance | path

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

12345678910>>...107

/external/chromium_org/chrome/browser/sync_file_system/drive_backend/
Ddrive_backend_test_util.cc23 const ServiceMetadata& right) { in ExpectEquivalentServiceMetadata() argument
24 EXPECT_EQ(left.largest_change_id(), right.largest_change_id()); in ExpectEquivalentServiceMetadata()
25 EXPECT_EQ(left.sync_root_tracker_id(), right.sync_root_tracker_id()); in ExpectEquivalentServiceMetadata()
26 EXPECT_EQ(left.next_tracker_id(), right.next_tracker_id()); in ExpectEquivalentServiceMetadata()
30 const FileDetails& right) { in ExpectEquivalentDetails() argument
35 for (int i = 0; i < right.parent_folder_ids_size(); ++i) in ExpectEquivalentDetails()
39 EXPECT_EQ(left.title(), right.title()); in ExpectEquivalentDetails()
40 EXPECT_EQ(left.file_kind(), right.file_kind()); in ExpectEquivalentDetails()
41 EXPECT_EQ(left.md5(), right.md5()); in ExpectEquivalentDetails()
42 EXPECT_EQ(left.etag(), right.etag()); in ExpectEquivalentDetails()
[all …]
/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/chromium_org/third_party/skia/experimental/Intersection/
DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) in QSort_Partition() argument
16 SkTSwap(*pivot, *right); in QSort_Partition()
18 while (left < right) { in QSort_Partition()
25 SkTSwap(*newPivot, *right); in QSort_Partition()
30 void QSort(T* left, T* right) in QSort() argument
32 if (left >= right) { in QSort()
35 T* pivot = left + (right - left >> 1); in QSort()
36 pivot = QSort_Partition(left, right, pivot); in QSort()
38 QSort(pivot + 1, right); in QSort()
42 static T** QSort_Partition(T** left, T** right, T** pivot) in QSort_Partition() argument
[all …]
/external/skia/experimental/Intersection/
DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) in QSort_Partition() argument
16 SkTSwap(*pivot, *right); in QSort_Partition()
18 while (left < right) { in QSort_Partition()
25 SkTSwap(*newPivot, *right); in QSort_Partition()
30 void QSort(T* left, T* right) in QSort() argument
32 if (left >= right) { in QSort()
35 T* pivot = left + (right - left >> 1); in QSort()
36 pivot = QSort_Partition(left, right, pivot); in QSort()
38 QSort(pivot + 1, right); in QSort()
42 static T** QSort_Partition(T** left, T** right, T** pivot) in QSort_Partition() argument
[all …]
/external/chromium-trace/trace-viewer/src/tracing/importer/v8/
Dsplaytree.js63 node.right = this.root_.right;
64 this.root_.right = null;
66 node.right = this.root_;
92 this.root_ = this.root_.right;
94 var right = this.root_.right;
100 this.root_.right = right;
146 while (current.right) {
147 current = current.right;
217 var dummy, left, right;
218 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/chromium_org/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/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/chromium_org/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/chromium_org/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/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/third_party/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/ui/
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/chromium_org/components/dom_distiller/core/
Darticle_entry_unittest.cc32 ArticleEntry right; in TEST() local
34 right.set_entry_id("entry1"); in TEST()
35 EXPECT_FALSE(AreEntriesEqual(left, right)); in TEST()
36 right = left; in TEST()
37 EXPECT_TRUE(AreEntriesEqual(left, right)); in TEST()
40 EXPECT_FALSE(AreEntriesEqual(left, right)); in TEST()
41 right.set_title("a different title"); in TEST()
42 EXPECT_FALSE(AreEntriesEqual(left, right)); in TEST()
43 right.set_title("a title"); in TEST()
44 EXPECT_TRUE(AreEntriesEqual(left, right)); in TEST()
[all …]
/external/chromium_org/tools/gn/
Doperators.cc123 const Value& right, in ExecuteEquals() argument
134 right.type() == Value::LIST && in ExecuteEquals()
135 !right.list_value().empty()) { in ExecuteEquals()
143 base::IntToString(static_cast<int>(right.list_value().size())) + in ExecuteEquals()
153 if (right.type() == Value::LIST && left.value() == kSourcesName) { in ExecuteEquals()
159 set_value->list_value().reserve(right.list_value().size()); in ExecuteEquals()
160 AppendFilteredSourcesToValue(scope, right, set_value); in ExecuteEquals()
163 scope->SetValue(left.value(), right, op_node->right()); in ExecuteEquals()
182 const Value& right, in ValuePlusEquals() argument
188 switch (right.type()) { in ValuePlusEquals()
[all …]
/external/chromium_org/third_party/WebKit/Source/core/html/parser/
DHTMLEntitySearch.cpp33 … HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right) in halfway() argument
35 return &left[(right - left) / 2]; in halfway()
60 const HTMLEntityTableEntry* right = m_last; in findFirst() local
61 if (left == right) in findFirst()
67 return right; in findFirst()
68 while (left + 1 < right) { in findFirst()
69 const HTMLEntityTableEntry* probe = halfway(left, right); in findFirst()
75 right = probe; in findFirst()
78 ASSERT(left + 1 == right); in findFirst()
79 return right; in findFirst()
[all …]
/external/chromium_org/webkit/data/test_shell/sort/
Dsort-quick.js3 function sort_quick(sort, left, right) { argument
6 right = sort.size - 1;
8 if (left < right) {
9 var pivot = left + Math.floor(Math.random()*(right-left));
11 partition(sort, left, right, pivot);
15 function partition(sort, left, right, pivot) { argument
16 sort.swap(pivot, right);
17 sort.add_work(function(){partition_step(sort, left, right, pivot, left, left);});
20 function partition_step(sort, left, right, pivot, i, j) { argument
21 if (i < right) {
[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/chromium_org/ppapi/cpp/
Drect.cc27 void Rect::Inset(int32_t left, int32_t top, int32_t right, int32_t bottom) { in Inset() argument
29 set_width(std::max<int32_t>(width() - left - right, 0)); in Inset()
39 return (point_x >= x()) && (point_x < right()) && in Contains()
44 return (rect.x() >= x() && rect.right() <= right() && in Contains()
49 return !(rect.x() >= right() || rect.right() <= x() || in Intersects()
56 int32_t rr = std::min(right(), rect.right()); in Intersect()
74 int32_t rr = std::max(right(), rect.right()); in Union()
89 int32_t rr = right(); in Subtract()
95 rx = rect.right(); in Subtract()
99 } else if (rect.x() <= x() && rect.right() >= right()) { in Subtract()
[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.cpp10 if (left > right) { in Normalize()
12 left = right; in Normalize()
13 right = temp; in Normalize()
28 right = right < src_n.right ? right : src_n.right; in Intersect()
30 if (left > right || top > bottom) { in Intersect()
31 left = top = right = bottom = 0; in Intersect()
40 right = right > other.right ? right : other.right; in Union()
69 right = (FX_FLOAT)(rect.right); in CFX_FloatRect()
76 if (left > right) { in Normalize()
78 left = right; in Normalize()
[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/chromium_org/remoting/base/
Dtyped_buffer_unittest.cc52 TypedBuffer<Data> right(sizeof(int)); in TEST() local
56 EXPECT_TRUE(right.get()); in TEST()
57 EXPECT_EQ(right.length(), sizeof(int)); in TEST()
59 Data* raw_ptr = right.get(); in TEST()
60 left = right.Pass(); in TEST()
68 EXPECT_FALSE(right.get()); in TEST()
69 EXPECT_EQ(right.length(), 0u); in TEST()
75 TypedBuffer<Data> right(sizeof(int) * 2); in TEST() local
79 EXPECT_TRUE(right.get()); in TEST()
80 EXPECT_EQ(right.length(), sizeof(int) * 2); in TEST()
[all …]

12345678910>>...107