/external/javassist/src/main/javassist/compiler/ast/ |
DoubleConst.java | 44 public ASTree compute(int op, ASTree right) { 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) { 56 || right.type == TokenId.DoubleConstant) 61 return compute(op, this.value, right.value, newType); 64 private DoubleConst compute0(int op, IntConst right) { 65 return compute(op, this.value, (double)right.value, this.type) [all...] |
/external/v8/benchmarks/ |
splay.js | 58 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 child [all...] |
/external/v8/benchmarks/spinning-balls/ |
splay-tree.js | 79 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 child of the ne [all...] |
/bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
tsearch.c | 20 struct node_t *left, *right; member in struct:node_t 41 &(*rootp)->right; /* T4: follow right branch */ 47 q->left = q->right = (struct node_t *)0; 70 &(*rootp)->right; /* follow right branch */ 74 r = (*rootp)->right; /* D1: */ 77 else if (r != (struct node_t *)0) { /* Right link is null? */ 84 r->left = q->right; 86 q->right = (*rootp)->right [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
TestExpressionFeatures.g3 | 116 | 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/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/ |
shadow-handler.js | 53 function mergeShadow(left, right) { 54 while (left.lengths.length < Math.max(left.lengths.length, right.lengths.length)) 56 while (right.lengths.length < Math.max(left.lengths.length, right.lengths.length)) 57 right.lengths.push({px: 0}); 59 if (left.inset != right.inset || !!left.color != !!right.color) { 67 var mergedDimensions = scope.mergeDimensions(left.lengths[i], right.lengths[i], i == 2); 72 if (left.color && right.color) { 73 var mergedColor = scope.mergeColors(left.color, right.color) [all...] |
/external/llvm/test/Transforms/JumpThreading/ |
implied-cond.ll | 11 br i1 %c0, label %left, label %right 15 ; CHECK: br i1 %c0, label %left0, label %right 23 br i1 %c1, label %left0, label %right 29 right: 41 br i1 %c0, label %left, label %right 45 ; CHECK: br i1 %c0, label %left0, label %right 53 br i1 %c1, label %left0, label %right 59 right: 69 ; CHECK: br i1 %c0, label %cont, label %right 71 ; CHECK: br i1 %c, label %left0, label %right [all...] |
/external/markdown/tests/extensions-x-tables/ |
tables.html | 42 <th align="right">Value</th> 48 <td align="right">$1600</td> 52 <td align="right">$12</td> 56 <td align="right">$1</td> 83 <th align="right">baz</th> 90 <td align="right" /> 95 <td align="right">W</td>
|
/external/skia/tests/ |
BlitMaskClip.cpp | 23 int right = x + width; variable 24 REPORTER_ASSERT(fReporter, right > fBounds.fLeft && right <= fBounds.fRight); 56 for (int right = left + 1; right <= b.fRight; right++) { 57 SkIRect clipRect = {left, top, right, bottom};
|
/external/chromium-trace/catapult/tracing/tracing/extras/importer/v8/ |
splaytree.html | 62 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 child of the ne [all...] |
/external/v8/tools/ |
splaytree.js | 81 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 child of the ne [all...] |
/cts/tests/tests/view/src/android/view/cts/ |
GravityTest.java | 53 assertEquals(21, mOutRect.right); 58 assertEquals(26, mOutRect.right); 63 assertEquals(21, mOutRect.right); 68 assertEquals(21, mOutRect.right); 74 assertEquals(21, mOutRect.right); 79 assertEquals(26, mOutRect.right); 84 assertEquals(21, mOutRect.right); 89 assertEquals(21, mOutRect.right); 95 assertEquals(12, mOutRect.right); 100 assertEquals(17, mOutRect.right); [all...] |
/external/sl4a/ScriptingLayerForAndroid/src/org/connectbot/util/ |
SelectionArea.java | 26 * left and right to keep it in the correct orientation. 32 private int right; field in class:SelectionArea 42 top = left = bottom = right = 0; 113 setRight(right - 1); 120 setRight(right + 1); 131 this.left = right = checkBounds(left, maxColumns); 135 return Math.min(left, right); 138 private void setRight(int right) { 139 this.right = checkBounds(right, maxColumns) [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/lang/ |
UCharacterDirection.java | 43 return "Left-to-Right"; 45 return "Right-to-Left"; 65 return "Left-to-Right Embedding"; 67 return "Left-to-Right Override"; 69 return "Right-to-Left Arabic"; 71 return "Right-to-Left Embedding"; 73 return "Right-to-Left Override"; 83 return "Left-to-Right Isolate"; 85 return "Right-to-Left Isolate";
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/ |
UCharacterDirectionTest.java | 53 String name[] = {"Left-to-Right", 54 "Right-to-Left", 64 "Left-to-Right Embedding", 65 "Left-to-Right Override", 66 "Right-to-Left Arabic", 67 "Right-to-Left Embedding", 68 "Right-to-Left Override", 73 "Left-to-Right Isolate", 74 "Right-to-Left Isolate",
|
/external/icu/icu4c/source/common/ |
uarrsort.h | 31 * @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/icu/icu4c/source/i18n/ |
dtrule.cpp | 69 DateTimeRule::operator=(const DateTimeRule& right) { 70 if (this != &right) { 71 fMonth = right.fMonth; 72 fDayOfMonth = right.fDayOfMonth; 73 fDayOfWeek = right.fDayOfWeek; 74 fWeekInMonth = right.fWeekInMonth; 75 fMillisInDay = right.fMillisInDay; 76 fDateRuleType = right.fDateRuleType; 77 fTimeRuleType = right.fTimeRuleType;
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/lang/ |
UCharacterDirection.java | 44 return "Left-to-Right"; 46 return "Right-to-Left"; 66 return "Left-to-Right Embedding"; 68 return "Left-to-Right Override"; 70 return "Right-to-Left Arabic"; 72 return "Right-to-Left Embedding"; 74 return "Right-to-Left Override"; 84 return "Left-to-Right Isolate"; 86 return "Right-to-Left Isolate";
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/ |
UCharacterDirectionTest.java | 49 String name[] = {"Left-to-Right", 50 "Right-to-Left", 60 "Left-to-Right Embedding", 61 "Left-to-Right Override", 62 "Right-to-Left Arabic", 63 "Right-to-Left Embedding", 64 "Right-to-Left Override", 69 "Left-to-Right Isolate", 70 "Right-to-Left Isolate",
|
/external/markdown/MarkdownTest/Tests_2007/ |
Backslash escapes.html | 13 <p>Right brace: }</p> 17 <p>Right bracket: ]</p> 21 <p>Right paren: )</p> 47 Right brace: \} 51 Right bracket: \] 55 Right paren: \) 82 <p>Right brace: <code>\}</code></p> 86 <p>Right bracket: <code>\]</code></p> 90 <p>Right paren: <code>\)</code></p>
|
/frameworks/compile/mclinker/include/mcld/ADT/ |
TreeBase.h | 23 NodeBase* right; member in class:mcld::NodeBase 26 NodeBase() : left(NULL), right(NULL) {} 57 bool isRoot() const { return (m_pNode->right == m_pNode); } 60 return ((m_pNode->right) != (m_pNode->right->right)); 64 return ((m_pNode->left) != (m_pNode->left->right)); 83 this->m_pNode = this->m_pNode->right; 95 this->m_pNode->right = pOther;
|
/external/lzma/CPP/7zip/Common/ |
FilePathAutoRename.cpp | 45 unsigned left = 1, right = (1 << 30);
local 46 while (left != right)
48 unsigned mid = (left + right) / 2;
52 right = mid;
54 return !MakeAutoName(name, extension, right, fullProcessedPath);
|
UniqBlocks.cpp | 9 unsigned left = 0, right = Sorted.Size();
local 10 while (left != right)
12 unsigned mid = (left + right) / 2;
17 right = mid;
26 right = mid;
|
/external/webrtc/webrtc/modules/desktop_capture/ |
desktop_geometry.cc | 18 return point.x() >= left() && point.x() < right() && 23 return rect.left() >= left() && rect.right() <= right() && 30 right_ = std::min(right(), rect.right());
|
/frameworks/base/services/core/java/com/android/server/notification/ |
GlobalSortKeyComparator.java | 25 public int compare(NotificationRecord left, NotificationRecord right) { 29 if (right.getGlobalSortKey() == null) { 30 throw new IllegalStateException("Missing right global sort key: " + right); 32 return left.getGlobalSortKey().compareTo(right.getGlobalSortKey());
|