Searched refs:right (Results 1 - 25 of 1095) 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/skia/legacy/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/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/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/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-trace/trace-viewer/src/importer/v8/
H A Dsplaytree.js62 node.right = this.root_.right;
63 this.root_.right = null;
65 node.right = this.root_;
91 this.root_ = this.root_.right;
93 var right = this.root_.right;
95 // Splay to make sure that the new root has an empty right child.
97 // 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/webkit/Source/WebCore/html/parser/
H A DHTMLEntitySearch.cpp35 const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right) argument
37 return &left[(right - left) / 2];
64 const HTMLEntityTableEntry* right = m_last; local
65 if (left == right)
71 return right;
72 while (left + 1 < right) {
73 const HTMLEntityTableEntry* probe = halfway(left, right);
79 right = probe;
82 ASSERT(left + 1 == right);
83 return right;
89 const HTMLEntityTableEntry* right = m_last; local
[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...]
H A DPair.java25 protected ASTree left, right; field in class:Pair
29 right = _right;
39 sbuf.append(right == null ? "<null>" : right.toString());
46 public ASTree getRight() { return right; }
50 public void setRight(ASTree _right) { right = _right; }
H A DASTList.java22 * The right subtree must be an ASTList object or null.
26 private ASTList right; field in class:ASTList
30 right = _tail;
35 right = null;
44 public ASTree getRight() { return right; }
49 right = (ASTList)_right;
64 public ASTList tail() { return right; }
67 right = _tail;
82 list = list.right;
102 list = list.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...]
/external/apache-xml/src/main/java/org/apache/xpath/operations/
H A DBool.java38 * @param right non-null reference to the evaluated right operand.
44 public XObject operate(XObject right) throws javax.xml.transform.TransformerException argument
47 if (XObject.CLASS_BOOLEAN == right.getType())
48 return right;
50 return right.bool() ? XBoolean.S_TRUE : XBoolean.S_FALSE;
H A DNumber.java38 * @param right non-null reference to the evaluated right operand.
44 public XObject operate(XObject right) throws javax.xml.transform.TransformerException argument
47 if (XObject.CLASS_NUMBER == right.getType())
48 return right;
50 return new XNumber(right.num());
H A DString.java37 * @param right non-null reference to the evaluated right operand.
43 public XObject operate(XObject right) throws javax.xml.transform.TransformerException argument
45 return (XString)right.xstr(); // semi-safe cast.
H A DEquals.java39 * @param right non-null reference to the evaluated right operand.
45 public XObject operate(XObject left, XObject right) argument
48 return left.equals(right) ? XBoolean.S_TRUE : XBoolean.S_FALSE;
66 XObject right = m_right.execute(xctxt, true);
68 boolean result = left.equals(right) ? true : false;
70 right.detach();
/external/icu4c/common/
H A Duarrsort.h31 * @param right Pointer to the "right" item.
33 * <0 if left<right
34 * ==0 if left==right
35 * >0 if left>right
40 UComparator(const void *context, const void *left, const void *right);
68 uprv_uint16Comparator(const void *context, const void *left, const void *right);
75 uprv_int32Comparator(const void *context, const void *left, const void *right);
82 uprv_uint32Comparator(const void *context, const void *left, const void *right);
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowRect.java14 public void __constructor__(int left, int top, int right, int bottom) { argument
17 realRect.right = right;
24 realRect.right = otherRect.right;
30 set(rect.left, rect.top, rect.right, rect.bottom);
34 public void set(int left, int top, int right, int bottom) { argument
37 realRect.right = right;
43 return realRect.right
104 intersect(int left, int top, int right, int bottom) argument
[all...]
/external/v8/benchmarks/
H A Dsplay.js58 right: GeneratePayloadTree(depth - 1, tag)
97 // Verify that the splay tree has the right size.
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;
207 // Splay to make sure that the new root has an empty right chil
[all...]
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
H A Dv8-splay.js53 right: GeneratePayloadTree(depth - 1, tag)
92 // Verify that the splay tree has the right size.
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;
202 // Splay to make sure that the new root has an empty right chil
[all...]

Completed in 656 milliseconds

1234567891011>>