/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | StateCluster.java | 30 /** A Cluster object points to the left/right (start and end) states of a 34 public NFAState left; field in class:StateCluster 37 public StateCluster(NFAState left, NFAState right) { argument 38 this.left = left;
|
/external/clang/test/Modules/Inputs/ |
H A D | diamond_left.h | 5 float left(float *);
|
H A D | diamond_right.h | 6 int left, right; member in struct:left_and_right
|
H A D | category_left.h | 4 -(void)left; 8 -(void)left;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ComparisonChain.java | 75 Comparable left, Comparable right) { 76 return classify(left.compareTo(right)); 79 @Nullable T left, @Nullable T right, Comparator<T> comparator) { 80 return classify(comparator.compare(left, right)); 82 @Override public ComparisonChain compare(int left, int right) { 83 return classify(Ints.compare(left, right)); 85 @Override public ComparisonChain compare(long left, long right) { 86 return classify(Longs.compare(left, right)); 88 @Override public ComparisonChain compare(float left, float right) { 89 return classify(Float.compare(left, righ 118 compare( @ullable Comparable left, @Nullable Comparable right) argument 122 compare(@ullable T left, @Nullable T right, @Nullable Comparator<T> comparator) argument 126 compare(int left, int right) argument 129 compare(long left, long right) argument 132 compare(float left, float right) argument 135 compare(double left, double right) argument 138 compareTrueFirst(boolean left, boolean right) argument 141 compareFalseFirst(boolean left, boolean right) argument 154 compare( Comparable<?> left, Comparable<?> right) argument 161 compare( @ullable T left, @Nullable T right, Comparator<T> comparator) argument 169 compare(int left, int right) argument 176 compare(long left, long right) argument 183 compare(float left, float right) argument 190 compare(double left, double right) argument 199 compareTrueFirst(boolean left, boolean right) argument 208 compareFalseFirst(boolean left, boolean right) argument [all...] |
/external/v8/benchmarks/spinning-balls/ |
H A D | splay-tree.js | 78 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; 165 // the left subtree. 168 } else if (this.root_.left) { 169 return this.findMax(this.root_.left); 204 // the L tree of the algorithm. The left chil [all...] |
/external/v8/test/mjsunit/regress/ |
H A D | regress-1439135.js | 30 var left = "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX"; 33 var cons = left + right;
|
H A D | regress-95485.js | 29 var left = 'XXX'; 32 var cons = left + right;
|
/external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/mock/ |
H A D | MockRectF.java | 26 //public float left;
40 it.left = rhs.left;
47 public void $init(float left, float top, float right, float bottom) {
argument 48 it.left = left;
61 it.left = it.left + dx;
69 public void offsetTo(float left, float top) {
argument 71 it.right = left [all...] |
/external/v8/tools/ |
H A D | splaytree.js | 80 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; 182 // the left subtree. 185 } else if (this.root_.left) { [all...] |
/external/openssh/openbsd-compat/ |
H A D | realpath.c | 49 * in which case the path which caused trouble is left in (resolved). 59 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local 69 left_len = strlcpy(left, path + 1, sizeof(left)); 76 left_len = strlcpy(left, path, sizeof(left)); 78 if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) { 84 * Iterate over path components in `left'. 88 * Extract the next path component and adjust `left' 91 p = strchr(left, '/'); [all...] |
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/objectdescriptors/ |
H A D | BitReaderBuffer.java | 19 int left = 8 - position % 8; 21 if (i <= left) { 22 rc = (v << (position % 8) & 0xFF) >> ((position % 8) + (left - i)); 25 int now = left; 26 int then = i - left; 40 int left = 8 - position % 8; 41 if (left == 8) { 42 left = 0; 44 readBits(left); 45 return left; [all...] |
H A D | BitWriterBuffer.java | 20 int left = 8 - position % 8; 21 if (numBits <= left) { 24 current += i << (left - numBits); 28 int bitsSecondWrite = numBits - left; 29 writeBits(i >> bitsSecondWrite, left);
|
/external/clang/test/CodeGenCXX/ |
H A D | microsoft-abi-multiple-nonvirtual-inheritance.cpp | 4 virtual void left(); 15 virtual void left(); 25 child->left(); 36 void ChildOverride::left() { function in class:ChildOverride 37 // CHECK: define x86_thiscallcc void @"\01?left@ChildOverride@@UAEXXZ"(%struct.ChildOverride* %[[THIS:.*]]) 54 child->left(); 186 virtual void left();
|
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | Pair.java | 25 protected ASTree left, right; field in class:Pair 28 left = _left; 37 sbuf.append(left == null ? "<null>" : left.toString()); 44 public ASTree getLeft() { return left; } 48 public void setLeft(ASTree _left) { left = _left; }
|
/external/libunwind/scripts/ |
H A D | kernel-diff.sh | 6 left=$(eval echo $l) 8 # echo $left $right 9 diff -up $left $right
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowRect.java | 14 public void __constructor__(int left, int top, int right, int bottom) { argument 15 realRect.left = left; 22 realRect.left = otherRect.left; 30 set(rect.left, rect.top, rect.right, rect.bottom); 34 public void set(int left, int top, int right, int bottom) { argument 35 realRect.left = left; 43 return realRect.right - realRect.left; 104 intersect(int left, int top, int right, int bottom) argument [all...] |
/external/clang/test/Modules/ |
H A D | diamond-pch.c | 12 left(&f); 24 lr.left = 17;
|
H A D | diamond.c | 13 left(&f); 25 lr.left = 17;
|
/external/libcxx/test/std/input.output/iostreams.base/std.ios.manip/adjustfield.manip/ |
H A D | left.pass.cpp | 14 // ios_base& left(ios_base& str); 26 std::ios_base& r = std::left(ios); 28 assert(ios.flags() & std::ios::left);
|
/external/v8/benchmarks/ |
H A D | splay.js | 57 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; 260 // the left subtree. 263 } else if (this.root_.left) { 264 return this.findMax(this.root_.left); [all...] |
/external/v8/test/mjsunit/compiler/ |
H A D | shift-shr.js | 7 // Check the results of `left >>> right`. The result is always unsigned (and 9 function test_shr(left) { 13 var temp = left >>> i;
|
/external/apache-xml/src/main/java/org/apache/xpath/operations/ |
H A D | Equals.java | 38 * @param left non-null reference to the evaluated left operand. 45 public XObject operate(XObject left, XObject right) argument 48 return left.equals(right) ? XBoolean.S_TRUE : XBoolean.S_FALSE; 65 XObject left = m_left.execute(xctxt, true); 68 boolean result = left.equals(right) ? true : false; 69 left.detach();
|
/external/v8/src/compiler/ |
H A D | machine-operator-reducer.cc | 52 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x 54 return ReplaceInt32(m.left().Value() & m.right().Value()); 56 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x & x => x 61 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x 64 return ReplaceInt32(m.left().Value() | m.right().Value()); 66 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x | x => x 67 if (m.left().IsWord32Shl() && m.right().IsWord32Shr()) { 68 Int32BinopMatcher mleft(m.left().node()); 70 if (mleft.left().node() == mright.left() [all...] |
/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | aes-ctr.c | 28 size_t j, len, left = data_len; local 38 while (left > 0) { 41 len = (left < AES_BLOCK_SIZE) ? left : AES_BLOCK_SIZE; 45 left -= len;
|