Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 3454) sorted by relevance

12345678910>>...139

/external/chromium_org/third_party/skia/experimental/Intersection/
DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) in QSort_Partition() argument
17 T* newPivot = left; in QSort_Partition()
18 while (left < right) { in QSort_Partition()
19 if (*left < pivotValue) { in QSort_Partition()
20 SkTSwap(*left, *newPivot); in QSort_Partition()
23 left += 1; 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()
[all …]
/external/skia/experimental/Intersection/
DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) in QSort_Partition() argument
17 T* newPivot = left; in QSort_Partition()
18 while (left < right) { in QSort_Partition()
19 if (*left < pivotValue) { in QSort_Partition()
20 SkTSwap(*left, *newPivot); in QSort_Partition()
23 left += 1; 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()
[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
59 if (left == null) { in noRebalancePolicy()
62 return left; 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()
85 BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right) {
86 long countL = countAggregate.treeValue(left);
[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/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DDESEngine.java408 int work, right, left; in desFunc() local
410 left = (in[inOff + 0] & 0xff) << 24; in desFunc()
411 left |= (in[inOff + 1] & 0xff) << 16; in desFunc()
412 left |= (in[inOff + 2] & 0xff) << 8; in desFunc()
413 left |= (in[inOff + 3] & 0xff); in desFunc()
420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
422 left ^= (work << 4); in desFunc()
423 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
425 left ^= (work << 16); in desFunc()
426 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
Dv8-splay.js52 left: GeneratePayloadTree(depth - 1, key),
167 node.left = this.root_;
172 node.left = this.root_.left;
173 this.root_.left = null;
196 if (!this.root_.left) {
200 this.root_ = this.root_.left;
242 } else if (this.root_.left) {
243 return this.findMax(this.root_.left);
281 var dummy, left, right;
282 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/chromium_org/v8/benchmarks/spinning-balls/
Dsplay-tree.js78 node.left = this.root_;
83 node.left = this.root_.left;
84 this.root_.left = null;
107 if (!this.root_.left) {
111 this.root_ = this.root_.left;
168 } else if (this.root_.left) {
169 return this.findMax(this.root_.left);
207 var dummy, left, right;
208 dummy = left = right = new SplayTree.Node(null, null);
212 if (!current.left) {
[all …]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/
Dv8-splay.js52 left: GeneratePayloadTree(depth - 1, key),
167 node.left = this.root_;
172 node.left = this.root_.left;
173 this.root_.left = null;
196 if (!this.root_.left) {
200 this.root_ = this.root_.left;
242 } else if (this.root_.left) {
243 return this.findMax(this.root_.left);
281 var dummy, left, right;
282 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/chromium-trace/trace-viewer/src/tracing/importer/v8/
Dsplaytree.js62 node.left = this.root_;
67 node.left = this.root_.left;
68 this.root_.left = null;
91 if (!this.root_.left) {
95 this.root_ = this.root_.left;
131 while (current.left) {
132 current = current.left;
168 } else if (this.root_.left) {
169 return this.findMax(this.root_.left);
217 var dummy, left, right;
[all …]
/external/chromium_org/v8/tools/
Dsplaytree.js80 node.left = this.root_;
85 node.left = this.root_.left;
86 this.root_.left = null;
109 if (!this.root_.left) {
113 this.root_ = this.root_.left;
148 while (current.left) {
149 current = current.left;
185 } else if (this.root_.left) {
186 return this.findMax(this.root_.left);
233 var dummy, left, right;
[all …]
/external/chromium_org/v8/src/compiler/
Dmachine-operator-reducer.cc52 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x in Reduce()
54 return ReplaceInt32(m.left().Value() & m.right().Value()); in Reduce()
56 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x & x => x in Reduce()
61 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x in Reduce()
64 return ReplaceInt32(m.left().Value() | m.right().Value()); in Reduce()
66 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x | x => x in Reduce()
67 if (m.left().IsWord32Shl() && m.right().IsWord32Shr()) { in Reduce()
68 Int32BinopMatcher mleft(m.left().node()); in Reduce()
70 if (mleft.left().node() == mright.left().node()) { in Reduce()
74 if (mrightright.left().Is(32) && in Reduce()
[all …]
/external/chromium_org/v8/benchmarks/
Dsplay.js57 left: GeneratePayloadTree(depth - 1, tag),
173 node.left = this.root_;
178 node.left = this.root_.left;
179 this.root_.left = null;
202 if (!this.root_.left) {
206 this.root_ = this.root_.left;
263 } else if (this.root_.left) {
264 return this.findMax(this.root_.left);
302 var dummy, left, right;
303 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/
Dv8-splay.js52 left: GeneratePayloadTree(depth - 1, tag),
168 node.left = this.root_;
173 node.left = this.root_.left;
174 this.root_.left = null;
197 if (!this.root_.left) {
201 this.root_ = this.root_.left;
258 } else if (this.root_.left) {
259 return this.findMax(this.root_.left);
297 var dummy, left, right;
298 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/chromium_org/tools/gn/
Doperators.cc122 const Token& left, in ExecuteEquals() argument
125 const Value* old_value = scope->GetValue(left.value(), false); in ExecuteEquals()
136 *err = Err(op_node->left()->GetRange(), "Replacing nonempty list.", in ExecuteEquals()
146 left.value().as_string() + " = []\nbefore reassigning.")); in ExecuteEquals()
153 if (right.type() == Value::LIST && left.value() == kSourcesName) { in ExecuteEquals()
157 Value* set_value = scope->SetValue(left.value(), in ExecuteEquals()
163 scope->SetValue(left.value(), right, op_node->right()); in ExecuteEquals()
181 Value* left, in ValuePlusEquals() argument
185 switch (left->type()) { in ValuePlusEquals()
190 left->int_value() += right.int_value(); in ValuePlusEquals()
[all …]
/external/chromium_org/chrome/browser/sync_file_system/drive_backend/
Ddrive_backend_test_util.cc22 void ExpectEquivalentDetails(const FileDetails& left, in ExpectEquivalentDetails() argument
25 for (int i = 0; i < left.parent_folder_ids_size(); ++i) in ExpectEquivalentDetails()
26 EXPECT_TRUE(parents.insert(left.parent_folder_ids(i)).second); in ExpectEquivalentDetails()
29 EXPECT_EQ(1u, parents.erase(left.parent_folder_ids(i))); in ExpectEquivalentDetails()
32 EXPECT_EQ(left.title(), right.title()); in ExpectEquivalentDetails()
33 EXPECT_EQ(left.file_kind(), right.file_kind()); in ExpectEquivalentDetails()
34 EXPECT_EQ(left.md5(), right.md5()); in ExpectEquivalentDetails()
35 EXPECT_EQ(left.etag(), right.etag()); in ExpectEquivalentDetails()
36 EXPECT_EQ(left.creation_time(), right.creation_time()); in ExpectEquivalentDetails()
37 EXPECT_EQ(left.modification_time(), right.modification_time()); in ExpectEquivalentDetails()
[all …]
/external/chromium_org/third_party/WebKit/Source/core/html/parser/
DHTMLEntitySearch.cpp33 static const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableE… in halfway() argument
35 return &left[(right - left) / 2]; in halfway()
59 const HTMLEntityTableEntry* left = m_first; in findFirst() local
61 if (left == right) in findFirst()
62 return left; in findFirst()
63 CompareResult result = compare(left, nextCharacter); in findFirst()
65 return left; in findFirst()
68 while (left + 1 < right) { in findFirst()
69 const HTMLEntityTableEntry* probe = halfway(left, right); in findFirst()
72 left = probe; in findFirst()
[all …]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
Dvp9_reconintra.c39 const uint8_t *left) { \
40 type##_predictor(dst, stride, size, above, left); \
47 const uint16_t *left, int bd) { \
48 high_##type##_predictor(dst, stride, size, above, left, bd); \
73 const uint16_t *left, int bd) { in high_d207_predictor() argument
80 dst[r * stride] = ROUND_POWER_OF_TWO(left[r] + left[r + 1], 1); in high_d207_predictor()
82 dst[(bs - 1) * stride] = left[bs - 1]; in high_d207_predictor()
87 dst[r * stride] = ROUND_POWER_OF_TWO(left[r] + left[r + 1] * 2 + in high_d207_predictor()
88 left[r + 2], 2); in high_d207_predictor()
90 dst[(bs - 2) * stride] = ROUND_POWER_OF_TWO(left[bs - 2] + in high_d207_predictor()
[all …]
/external/chromium_org/third_party/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()
125 while (left < hole && lessThan(insert, *(hole - 1))) { in SkTInsertionSort()
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
139 T* newPivot = left; in SkTQSort_Partition()
140 while (left < right) { in SkTQSort_Partition()
141 if (lessThan(*left, pivotValue)) { in SkTQSort_Partition()
142 SkTSwap(*left, *newPivot); in SkTQSort_Partition()
145 left += 1; in SkTQSort_Partition()
163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
[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()
125 while (left < hole && lessThan(insert, *(hole - 1))) { in SkTInsertionSort()
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
139 T* newPivot = left; in SkTQSort_Partition()
140 while (left < right) { in SkTQSort_Partition()
141 if (lessThan(*left, pivotValue)) { in SkTQSort_Partition()
142 SkTSwap(*left, *newPivot); in SkTQSort_Partition()
145 left += 1; in SkTQSort_Partition()
163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
[all …]
/external/chromium_org/components/dom_distiller/core/
Darticle_entry_unittest.cc31 ArticleEntry left; in TEST() local
33 left.set_entry_id("entry0"); in TEST()
35 EXPECT_FALSE(AreEntriesEqual(left, right)); in TEST()
36 right = left; in TEST()
37 EXPECT_TRUE(AreEntriesEqual(left, right)); in TEST()
39 left.set_title("a title"); in TEST()
40 EXPECT_FALSE(AreEntriesEqual(left, right)); in TEST()
42 EXPECT_FALSE(AreEntriesEqual(left, right)); in TEST()
44 EXPECT_TRUE(AreEntriesEqual(left, right)); in TEST()
48 *left.add_pages() = left_page; in TEST()
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
DNFAFactory.java85 NFAState s = alt.left; in optimizeAlternative()
119 NFAState left = newState(); in build_Atom() local
121 left.associatedASTNode = associatedAST; in build_Atom()
123 transitionBetweenStates(left, right, label); in build_Atom()
124 StateCluster g = new StateCluster(left, right); in build_Atom()
137 NFAState left = newState(); in build_Set() local
139 left.associatedASTNode = associatedAST; in build_Set()
143 left.addTransition(e); in build_Set()
144 StateCluster g = new StateCluster(left, right); in build_Set()
164 NFAState left = 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
15 realRect.left = left; in __constructor__()
22 realRect.left = otherRect.left; 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
35 realRect.left = left; 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()
68 sb.append(realRect.left); in toString()
81 return x > realRect.left && x < realRect.right in contains()
[all …]
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
Dinttree.c76 it->nil->left = it->nil; in IT_create()
82 it->root->left = it->nil; in IT_create()
131 x->right=y->left; in LeftRotate()
133 if (y->left != it->nil) in LeftRotate()
134 y->left->parent=x; /* used to use sentinel here */ in LeftRotate()
142 if (x == x->parent->left) in LeftRotate()
143 x->parent->left=y; in LeftRotate()
146 y->left=x; in LeftRotate()
149 x->maxHigh=ITMax(x->left->maxHigh,ITMax(x->right->maxHigh,x->high)); in LeftRotate()
195 x=y->left; in RightRotate()
[all …]
/external/pdfium/core/src/fxcrt/
Dfx_basic_coords.cpp10 if (left > right) { in Normalize()
11 int temp = left; in Normalize()
12 left = right; in Normalize()
26 left = left > src_n.left ? left : src_n.left; in Intersect()
30 if (left > right || top > bottom) { in Intersect()
31 left = top = right = bottom = 0; in Intersect()
39 left = left < other.left ? left : other.left; in Union()
68 left = (FX_FLOAT)(rect.left); in CFX_FloatRect()
76 if (left > right) { in Normalize()
77 temp = left; in Normalize()
[all …]
/external/pdfium/core/include/fxcrt/
Dfx_coordinates.h235 void Set(baseType left, baseType top, baseType width, baseType height) in Set() argument
237 … FXT_RECT::left = left, FXT_RECT::top = top, FXT_RECT::width = width, FXT_RECT::height = height; in Set()
239 void Set(baseType left, baseType top, const FXT_SIZE &size) in Set() argument
241 FXT_RECT::left = left, FXT_RECT::top = top, FXT_RECT::Size(size); in Set()
257 FXT_RECT::left = FXT_RECT::top = FXT_RECT::width = FXT_RECT::height = 0; in Reset()
261 left += p.x, top += p.y;
266 left -= p.x, top -= p.y;
271 return left + width; in right()
280 left += width; in Normalize()
290 left += dx; in Offset()
[all …]

12345678910>>...139