Searched refs:left (Results 1 - 25 of 1998) sorted by relevance

1234567891011>>

/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
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 Ddiamond_left.h5 float left(float *);
H A Ddiamond_right.h6 int left, right; member in struct:left_and_right
H A Dcategory_left.h4 -(void)left;
8 -(void)left;
/external/clang/test/Modules/
H A Dva_list.cpp5 @import left; variable
H A Ddiamond-pch.c12 left(&f);
24 lr.left = 17;
H A Ddiamond.c13 left(&f);
25 lr.left = 17;
/external/jline/src/src/test/java/jline/
H A DTestCompletion.java59 new Buffer("f baz").left().left().left().left().
62 new Buffer("b foo").left().left().left().left().
65 new Buffer("foo b baz").left().left()
[all...]
/external/syslinux/com32/elflink/ldlinux/
H A Dgetadv.c42 size_t left; local
45 left = syslinux_adv_size();
47 while (left >= 2) {
50 left -= 2;
55 if (left < plen)
64 left -= plen;
H A Dsetadv.c51 size_t rleft, left; local
63 rleft = left = syslinux_adv_size();
64 p = advtmp = alloca(left);
65 memcpy(p, syslinux_adv_ptr(), left); /* Make working copy */
88 left -= plen;
94 /* Now (p, left) reflects the position to write in and how much space
98 if (left < size + 2) {
107 left -= size + 2;
110 memset(p, 0, left);
/external/guava/guava/src/com/google/common/collect/
H A DComparisonChain.java75 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 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;
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/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/mock/
H A DMockRectF.java26 //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 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;
182 // the left subtree.
185 } else if (this.root_.left) {
[all...]
/external/openssh/openbsd-compat/
H A Drealpath.c51 * in which case the path which caused trouble is left in (resolved).
61 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local
71 left_len = strlcpy(left, path + 1, sizeof(left));
78 left_len = strlcpy(left, path, sizeof(left));
80 if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) {
86 * Iterate over path components in `left'.
90 * Extract the next path component and adjust `left'
93 p = strchr(left, '/');
[all...]
/external/syslinux/com32/sysdump/
H A Drbtree.c37 * Simple implementation of a left-leaning red-black tree with 64-bit
43 * information about left-leaning red-black trees.
57 tree = tree->left;
74 h->right = x->left;
75 x->left = h;
76 x->red = x->left->red;
77 x->left->red = true;
83 struct rbtree *x = h->left;
84 h->left = x->right;
94 h->left
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/objectdescriptors/
H A DBitReaderBuffer.java19 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...]
/external/clang/test/CodeGenCXX/
H A Dmicrosoft-abi-multiple-nonvirtual-inheritance.cpp4 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 DPair.java25 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 Dkernel-diff.sh6 left=$(eval echo $l)
8 # echo $left $right
9 diff -up $left $right
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowRect.java14 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/libvpx/libvpx/vpx_dsp/
H A Dintrapred.c22 const uint8_t *above, const uint8_t *left) {
26 for (r = 0; r < bs - 1; ++r) dst[r * stride] = AVG2(left[r], left[r + 1]);
27 dst[(bs - 1) * stride] = left[bs - 1];
32 dst[r * stride] = AVG3(left[r], left[r + 1], left[r + 2]);
33 dst[(bs - 2) * stride] = AVG3(left[bs - 2], left[bs - 1], left[b
21 d207_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
45 d63_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
62 d45_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
81 d117_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
106 d135_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
134 d153_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
157 v_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
168 h_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
179 tm_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
191 dc_128_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
203 dc_left_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
218 dc_top_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
232 dc_predictor(uint8_t *dst, ptrdiff_t stride, int bs, const uint8_t *above, const uint8_t *left) argument
250 vpx_he_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
264 vpx_ve_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
283 vpx_d207_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
299 vpx_d63_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
322 vpx_d63e_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
346 vpx_d45_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
367 vpx_d45e_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
388 vpx_d117_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
411 vpx_d135_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
432 vpx_d153_predictor_4x4_c(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
457 highbd_d207_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
488 highbd_d63_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
504 highbd_d45_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
520 highbd_d117_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
547 highbd_d135_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
577 highbd_d153_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
602 highbd_v_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
614 highbd_h_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
626 highbd_tm_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
640 highbd_dc_128_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
653 highbd_dc_left_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
669 highbd_dc_top_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
685 highbd_dc_predictor(uint16_t *dst, ptrdiff_t stride, int bs, const uint16_t *above, const uint16_t *left, int bd) argument
705 vpx_highbd_d207_predictor_4x4_c(uint16_t *dst, ptrdiff_t stride, const uint16_t *above, const uint16_t *left, int bd) argument
723 vpx_highbd_d63_predictor_4x4_c(uint16_t *dst, ptrdiff_t stride, const uint16_t *above, const uint16_t *left, int bd) argument
748 vpx_highbd_d45_predictor_4x4_c(uint16_t *dst, ptrdiff_t stride, const uint16_t *above, const uint16_t *left, int bd) argument
770 vpx_highbd_d117_predictor_4x4_c(uint16_t *dst, ptrdiff_t stride, const uint16_t *above, const uint16_t *left, int bd) argument
795 vpx_highbd_d135_predictor_4x4_c(uint16_t *dst, ptrdiff_t stride, const uint16_t *above, const uint16_t *left, int bd) argument
817 vpx_highbd_d153_predictor_4x4_c(uint16_t *dst, ptrdiff_t stride, const uint16_t *above, const uint16_t *left, int bd) argument
[all...]
/external/libcxx/test/std/input.output/iostreams.base/std.ios.manip/adjustfield.manip/
H A Dleft.pass.cpp14 // 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 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;
260 // the left subtree.
263 } else if (this.root_.left) {
264 return this.findMax(this.root_.left);
[all...]
/external/apache-xml/src/main/java/org/apache/xpath/operations/
H A DEquals.java38 * @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();

Completed in 8858 milliseconds

1234567891011>>