Searched refs:right (Results 1 - 25 of 2377) sorted by relevance

1234567891011>>

/external/clang/test/Modules/Inputs/
H A Ddiamond_right.h3 double right(double *);
6 int left, right; member in struct:left_and_right
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DStateCluster.java30 /** A Cluster object points to the left/right (start and end) states of a
35 public NFAState right; field in class:StateCluster
37 public StateCluster(NFAState left, NFAState right) { argument
39 this.right = right;
/external/chromium_org/components/dom_distiller/core/
H A Darticle_entry_unittest.cc32 ArticleEntry right; local
34 right.set_entry_id("entry1");
35 EXPECT_FALSE(AreEntriesEqual(left, right));
36 right = left;
37 EXPECT_TRUE(AreEntriesEqual(left, right));
40 EXPECT_FALSE(AreEntriesEqual(left, right));
41 right.set_title("a different title");
42 EXPECT_FALSE(AreEntriesEqual(left, right));
43 right.set_title("a title");
44 EXPECT_TRUE(AreEntriesEqual(left, right));
[all...]
/external/chromium_org/third_party/WebKit/Source/core/animation/animatable/
H A DAnimatableValue.cpp52 PassRefPtrWillBeRawPtr<AnimatableValue> AnimatableValue::interpolate(const AnimatableValue* left, const AnimatableValue* right, double fraction) argument
55 ASSERT(right);
57 ASSERT(!right->isNeutral());
59 if (fraction && fraction != 1 && left->isSameType(right))
60 return left->interpolateTo(right, fraction);
62 return defaultInterpolateTo(left, right, fraction);
65 double AnimatableValue::distance(const AnimatableValue* left, const AnimatableValue* right) argument
68 ASSERT(right);
70 if (left->isSameType(right))
71 return left->distanceTo(right);
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkScalar.cpp22 int right = 0; local
23 while (right < length && searchKey > keys[right])
24 right++;
27 if (length == right)
29 if (0 == right)
31 // Otherwise, interpolate between right - 1 and right.
32 SkScalar rightKey = keys[right];
33 SkScalar leftKey = keys[right
[all...]
/external/skia/src/core/
H A DSkScalar.cpp22 int right = 0; local
23 while (right < length && searchKey > keys[right])
24 right++;
27 if (length == right)
29 if (0 == right)
31 // Otherwise, interpolate between right - 1 and right.
32 SkScalar rightKey = keys[right];
33 SkScalar leftKey = keys[right
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) argument
16 SkTSwap(*pivot, *right);
18 while (left < right) {
25 SkTSwap(*newPivot, *right);
30 void QSort(T* left, T* right) argument
32 if (left >= right) {
35 T* pivot = left + (right - left >> 1);
36 pivot = QSort_Partition(left, right, pivot);
38 QSort(pivot + 1, right);
42 static T** QSort_Partition(T** left, T** right, argument
59 QSort(T** left, T** right) argument
71 QSort_Partition(S& context, T* left, T* right, T* pivot, bool (*lessThan)(S&, const T, const T)) argument
89 QSort(S& context, T* left, T* right, bool (*lessThan)(S& , const T, const T)) argument
[all...]
/external/skia/experimental/Intersection/
H A DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) argument
16 SkTSwap(*pivot, *right);
18 while (left < right) {
25 SkTSwap(*newPivot, *right);
30 void QSort(T* left, T* right) argument
32 if (left >= right) {
35 T* pivot = left + (right - left >> 1);
36 pivot = QSort_Partition(left, right, pivot);
38 QSort(pivot + 1, right);
42 static T** QSort_Partition(T** left, T** right, argument
59 QSort(T** left, T** right) argument
71 QSort_Partition(S& context, T* left, T* right, T* pivot, bool (*lessThan)(S&, const T, const T)) argument
89 QSort(S& context, T* left, T* right, bool (*lessThan)(S& , const T, const T)) argument
[all...]
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/
H A Dutility.js16 var right = this.length - 1;
17 while (left <= right) {
18 var mid = Math.floor((left + right) / 2);
22 right = mid - 1;
32 * @param {Array.<*>} right
35 var intersectionOfSorted = function(left, right) {
38 var idx = right.indexOf(current, from);
/external/chromium_org/v8/benchmarks/spinning-balls/
H A 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;
112 // Splay to make sure that the new root has an empty right child.
114 // Insert the original right child as the right chil
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-1439135.js31 var right = "YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY";
33 var cons = left + right;
H A Dregress-95485.js30 var right = 'YYY';
32 var cons = left + right;
/external/clang/test/CodeGenCXX/
H A Dmicrosoft-abi-multiple-nonvirtual-inheritance.cpp8 virtual void right();
16 virtual void right();
68 child->right();
69 // When calling a right base's virtual method, one needs to adjust 'this' at
84 void ChildOverride::right() { function in class:ChildOverride
85 // CHECK: define x86_thiscallcc void @"\01?right@ChildOverride@@UAEXXZ"(i8*
87 // ChildOverride::right gets 'this' cast to Right* in ECX (i.e. this+4) so we
106 child->right();
107 // When calling a right child's virtual method, one needs to adjust 'this' at
126 virtual void right();
129 void GrandchildOverride::right() { function in class:GrandchildOverride
[all...]
/external/chromium_org/v8/tools/
H A 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;
114 // Splay to make sure that the new root has an empty right child.
116 // Insert the original right child as the right chil
[all...]
/external/chromium_org/ui/gfx/geometry/
H A Dinsets.cc15 Insets::Insets(int top, int left, int bottom, int right) argument
16 : InsetsBase<Insets, int>(top, left, bottom, right) {}
22 return base::StringPrintf("%d,%d,%d,%d", top(), left(), bottom(), right());
H A Dinsets_f.cc15 InsetsF::InsetsF(float top, float left, float bottom, float right) argument
16 : InsetsBase<InsetsF, float>(top, left, bottom, right) {}
22 return base::StringPrintf("%f,%f,%f,%f", top(), left(), bottom(), right());
/external/chromium-trace/trace-viewer/src/tracing/importer/v8/
H A 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;
96 // Splay to make sure that the new root has an empty right child.
98 // Insert the original right child as the right chil
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/
H A DTestExpressionFeatures.g3116 | e '^'<assoc=right>^ e
121 | e ('='<assoc=right>^
122 |'+='<assoc=right>^
123 |'-='<assoc=right>^
124 |'*='<assoc=right>^
125 |'/='<assoc=right>^
126 |'&='<assoc=right>^
127 |'|='<assoc=right>^
128 |'^='<assoc=right>^
129 |'>>='<assoc=right>
[all...]
/external/guava/guava/src/com/google/common/collect/
H A 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));
107 compare( @ullable Comparable left, @Nullable Comparable right) argument
111 compare(@ullable T left, @Nullable T right, @Nullable Comparator<T> comparator) argument
115 compare(int left, int right) argument
118 compare(long left, long right) argument
121 compare(float left, float right) argument
124 compare(double left, double right) argument
127 compare(boolean left, boolean right) argument
140 compare( Comparable<?> left, Comparable<?> right) argument
147 compare( @ullable T left, @Nullable T right, Comparator<T> comparator) argument
155 compare(int left, int right) argument
162 compare(long left, long right) argument
169 compare(float left, float right) argument
176 compare(double left, double right) argument
183 compare(boolean left, boolean right) argument
[all...]
H A DBstCountBasedBalancePolicies.java52 BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right) {
53 return checkNotNull(nodeFactory).createNode(source, left, right);
58 public N combine(BstNodeFactory<N> nodeFactory, @Nullable N left, @Nullable N right) {
60 return right;
61 } else if (right == null) {
63 } else if (countAggregate.treeValue(left) > countAggregate.treeValue(right)) {
65 left, left.childOrNull(LEFT), combine(nodeFactory, left.childOrNull(RIGHT), right));
67 return nodeFactory.createNode(right, combine(nodeFactory, left, right.childOrNull(LEFT)),
68 right
[all...]
/external/chromium_org/remoting/base/
H A Dtyped_buffer_unittest.cc52 TypedBuffer<Data> right(sizeof(int));
56 EXPECT_TRUE(right.get());
57 EXPECT_EQ(right.length(), sizeof(int));
59 Data* raw_ptr = right.get();
60 left = right.Pass();
68 EXPECT_FALSE(right.get());
69 EXPECT_EQ(right.length(), 0u);
75 TypedBuffer<Data> right(sizeof(int) * 2);
79 EXPECT_TRUE(right.get());
80 EXPECT_EQ(right
[all...]
/external/chromium_org/third_party/WebKit/Source/core/html/parser/
H A DHTMLEntitySearch.cpp33 static const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right) argument
35 return &left[(right - left) / 2];
60 const HTMLEntityTableEntry* right = m_last; local
61 if (left == right)
67 return right;
68 while (left + 1 < right) {
69 const HTMLEntityTableEntry* probe = halfway(left, right);
75 right = probe;
78 ASSERT(left + 1 == right);
79 return right;
85 const HTMLEntityTableEntry* right = m_last; local
[all...]
/external/chromium_org/v8/src/compiler/
H A Dmachine-operator-reducer.cc51 if (m.right().Is(0)) return Replace(m.right().node()); // x & 0 => 0
52 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x
54 return ReplaceInt32(m.left().Value() & m.right().Value());
61 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x
62 if (m.right().Is(-1)) return Replace(m.right().node()); // x | -1 => -1
64 return ReplaceInt32(m.left().Value() | m.right().Value());
67 if (m.left().IsWord32Shl() && m.right().IsWord32Shr()) {
69 Int32BinopMatcher mright(m.right()
[all...]
/external/javassist/src/main/javassist/compiler/ast/
H A DDoubleConst.java44 public ASTree compute(int op, ASTree right) { argument
45 if (right instanceof IntConst)
46 return compute0(op, (IntConst)right);
47 else if (right instanceof DoubleConst)
48 return compute0(op, (DoubleConst)right);
53 private DoubleConst compute0(int op, DoubleConst right) { argument
56 || right.type == TokenId.DoubleConstant)
61 return compute(op, this.value, right.value, newType);
64 private DoubleConst compute0(int op, IntConst right) { argument
65 return compute(op, this.value, (double)right
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DQuickSorter.java44 // quicksort a[left] to a[right]
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { argument
46 if (right <= left) return;
47 int i = partition(a, left, right, comparator);
49 quicksort(a, i + 1, right, comparator);
52 // partition a[left] to a[right], assumes left < right
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { argument
55 int j = right;
57 while (comparator.compare(a[++i], a[right]) <
[all...]

Completed in 805 milliseconds

1234567891011>>