Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 3167) sorted by relevance

12345678910>>...127

/external/guava/guava/src/com/google/common/collect/
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, right));
[all …]
/external/libvpx/libvpx/vpx_dsp/
Dintrapred.c22 const uint8_t *above, const uint8_t *left) { in d207_predictor() argument
26 for (r = 0; r < bs - 1; ++r) dst[r * stride] = AVG2(left[r], left[r + 1]); in d207_predictor()
27 dst[(bs - 1) * stride] = left[bs - 1]; in d207_predictor()
32 dst[r * stride] = AVG3(left[r], left[r + 1], left[r + 2]); in d207_predictor()
33 dst[(bs - 2) * stride] = AVG3(left[bs - 2], left[bs - 1], left[bs - 1]); in d207_predictor()
34 dst[(bs - 1) * stride] = left[bs - 1]; in d207_predictor()
38 for (c = 0; c < bs - 2; ++c) dst[(bs - 1) * stride + c] = left[bs - 1]; in d207_predictor()
46 const uint8_t *above, const uint8_t *left) { in d63_predictor() argument
49 (void)left; in d63_predictor()
63 const uint8_t *above, const uint8_t *left) { in d45_predictor() argument
[all …]
Dvpx_dsp_rtcd_defs.pl40 …d207_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
43 …_d45_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
46 …d45e_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
48 …_d63_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
51 …d63e_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
53 …px_h_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
56 …x_he_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
58 …d117_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
60 …d135_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
63 …d153_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
[all …]
/external/toybox/kconfig/
Dexpr.c20 e->left.sym = sym; in expr_alloc_symbol()
29 e->left.expr = ce; in expr_alloc_one()
38 e->left.expr = e1; in expr_alloc_two()
48 e->left.sym = s1; in expr_alloc_comp()
78 e->left = org->left; in expr_copy()
81 e->left.expr = expr_copy(org->left.expr); in expr_copy()
85 e->left.sym = org->left.sym; in expr_copy()
91 e->left.expr = expr_copy(org->left.expr); in expr_copy()
113 expr_free(e->left.expr); in expr_free()
120 expr_free(e->left.expr); in expr_free()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DDESEngine.java408 int work, right, left; in desFunc() local
410 left = (in[inOff + 0] & 0xff) << 24; in desFunc()
411 left |= (in[inOff + 1] & 0xff) << 16; in desFunc()
412 left |= (in[inOff + 2] & 0xff) << 8; in desFunc()
413 left |= (in[inOff + 3] & 0xff); in desFunc()
420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
422 left ^= (work << 4); in desFunc()
423 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
425 left ^= (work << 16); in desFunc()
426 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
/external/pdfium/core/fxcrt/
Dfx_coordinates.cpp30 if (left > right) in Normalize()
31 std::swap(left, right); in Normalize()
40 left = std::max(left, src_n.left); in Intersect()
44 if (left > right || top > bottom) { in Intersect()
45 left = top = right = bottom = 0; in Intersect()
50 left = rect.left; in CFX_FloatRect()
75 if (left > right) in Normalize()
76 std::swap(left, right); in Normalize()
82 left = 0.0f; in Reset()
92 left = std::max(left, other.left); in Intersect()
[all …]
Dfx_coordinates.h182 FX_RECT() : left(0), top(0), right(0), bottom(0) {} in FX_RECT()
183 FX_RECT(int l, int t, int r, int b) : left(l), top(t), right(r), bottom(b) {} in FX_RECT()
185 int Width() const { return right - left; } in Width()
187 bool IsEmpty() const { return right <= left || bottom <= top; } in IsEmpty()
192 w -= left; in Valid()
203 left += dx; in Offset()
210 return left == src.left && right == src.right && top == src.top &&
215 return x >= left && x < right && y >= top && y < bottom; in Contains()
218 int32_t left; member
229 : left(l), bottom(b), right(r), top(t) {} in CFX_FloatRect()
[all …]
/external/v8/benchmarks/spinning-balls/
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;
168 } else if (this.root_.left) {
169 return this.findMax(this.root_.left);
207 var dummy, left, right;
208 dummy = left = right = new SplayTree.Node(null, null);
212 if (!current.left) {
[all …]
/external/v8/tools/
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;
185 } else if (this.root_.left) {
186 return this.findMax(this.root_.left);
233 var dummy, left, right;
[all …]
/external/zlib/src/contrib/blast/
Dblast.c46 unsigned left; /* available input at in */ member
79 if (s->left == 0) { in bits()
80 s->left = s->infun(s->inhow, &(s->in)); in bits()
81 if (s->left == 0) longjmp(s->env, 1); /* out of input */ in bits()
84 s->left--; in bits()
137 int left; /* bits left in next or left to process */ in decode() local
141 left = s->bitcnt; in decode()
146 while (left--) { in decode()
161 left = (MAXBITS+1) - len; in decode()
162 if (left == 0) break; in decode()
[all …]
/external/v8/benchmarks/
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;
263 } else if (this.root_.left) {
264 return this.findMax(this.root_.left);
302 var dummy, left, right;
303 dummy = left = right = new SplayTree.Node(null, null);
[all …]
/external/jacoco/org.jacoco.doc/docroot/doc/resources/
Ddoc.css2 padding-left:18px;
4 background-position:left center;
9 padding-left:18px;
11 background-position:left center;
16 padding-left:18px;
18 background-position:left center;
23 margin-left:20px;
24 padding-left:4px;
25 border-left:#cccca0 4px solid;
30 margin-left:20px;
[all …]
/external/ltp/utils/ffsb-6.0-rc2/
Drbt.c44 node->parent = node->right = node->left = NULL; in rbnode_construct()
57 rbnode_destruct(node->left, d); in rbnode_destruct()
69 int ileftdepth = (node->left) ? rbnode_depth(node->left) : 0; in rbnode_depth()
80 while (node->left) in rbnode_minimum()
81 node = node->left; in rbnode_minimum()
118 while (succ_node->left) in rbnode_successor()
119 succ_node = succ_node->left; in rbnode_successor()
143 if (node->left) { in rbnode_predecessor()
150 pred_node = node->left; in rbnode_predecessor()
161 while (pred_node && prev_node == pred_node->left) { in rbnode_predecessor()
[all …]
/external/v8/src/compiler/
Dmachine-operator-reducer.cc170 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
173 base::bits::RotateRight32(m.left().Value(), m.right().Value())); in Reduce()
180 return ReplaceBool(m.left().Value() == m.right().Value()); in Reduce()
182 if (m.left().IsInt32Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
183 Int32BinopMatcher msub(m.left().node()); in Reduce()
184 node->ReplaceInput(0, msub.left().node()); in Reduce()
195 return ReplaceBool(m.left().Value() == m.right().Value()); in Reduce()
197 if (m.left().IsInt64Sub() && m.right().Is(0)) { // x - y == 0 => x == y in Reduce()
198 Int64BinopMatcher msub(m.left().node()); in Reduce()
199 node->ReplaceInput(0, msub.left().node()); in Reduce()
[all …]
/external/curl/lib/
Dversion.c108 size_t left = sizeof(version); in curl_version() local
115 left -= len; in curl_version()
118 if(left > 1) { in curl_version()
119 len = Curl_ssl_version(ptr + 1, left - 1); in curl_version()
123 left -= ++len; in curl_version()
129 len = snprintf(ptr, left, " zlib/%s", zlibVersion()); in curl_version()
130 left -= len; in curl_version()
134 len = snprintf(ptr, left, "%s", " brotli/"); in curl_version()
135 left -= len; in curl_version()
137 len = brotli_version(ptr, left); in curl_version()
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
DNFAFactory.java85 NFAState s = alt.left; in optimizeAlternative()
119 NFAState left = newState(); in build_Atom() local
121 left.associatedASTNode = associatedAST; in build_Atom()
123 transitionBetweenStates(left, right, label); in build_Atom()
124 StateCluster g = new StateCluster(left, right); in build_Atom()
137 NFAState left = newState(); in build_Set() local
139 left.associatedASTNode = associatedAST; in build_Set()
143 left.addTransition(e); in build_Set()
144 StateCluster g = new StateCluster(left, right); in build_Set()
164 NFAState left = newState(); in build_Range() local
[all …]
/external/skqp/src/core/
DSkTSort.h120 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
121 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
130 } while (left < hole && lessThan(insert, *(hole - 1))); in SkTInsertionSort()
138 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
141 T* newPivot = left; in SkTQSort_Partition()
142 while (left < right) { in SkTQSort_Partition()
143 if (lessThan(*left, pivotValue)) { in SkTQSort_Partition()
144 SkTSwap(*left, *newPivot); in SkTQSort_Partition()
147 left += 1; in SkTQSort_Partition()
165 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
[all …]
/external/skia/src/core/
DSkTSort.h120 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
121 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
130 } while (left < hole && lessThan(insert, *(hole - 1))); in SkTInsertionSort()
138 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
141 T* newPivot = left; in SkTQSort_Partition()
142 while (left < right) { in SkTQSort_Partition()
143 if (lessThan(*left, pivotValue)) { in SkTQSort_Partition()
144 SkTSwap(*left, *newPivot); in SkTQSort_Partition()
147 left += 1; in SkTQSort_Partition()
165 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
[all …]
/external/ImageMagick/MagickCore/
Dsplay-tree.c78 *left, member
198 node->left=(NodeInfo *) NULL; in AddValueToSplayTree()
204 node->left=splay_tree->root; in AddValueToSplayTree()
205 node->right=node->left->right; in AddValueToSplayTree()
206 node->left->right=(NodeInfo *) NULL; in AddValueToSplayTree()
211 node->left=node->right->left; in AddValueToSplayTree()
212 node->right->left=(NodeInfo *) NULL; in AddValueToSplayTree()
258 node->left=(NodeInfo *) NULL; in LinkSplayTreeNodes()
260 node->left=LinkSplayTreeNodes(nodes,low,bisect-1); in LinkSplayTreeNodes()
340 while (node->left != (NodeInfo *) NULL) in GetFirstSplayTreeNode()
[all …]
/external/syslinux/com32/sysdump/
Drbtree.c57 tree = tree->left; in rb_search()
74 h->right = x->left; in rotate_left()
75 x->left = h; in rotate_left()
76 x->red = x->left->red; in rotate_left()
77 x->left->red = true; in rotate_left()
83 struct rbtree *x = h->left; in rotate_right()
84 h->left = x->right; in rotate_right()
94 h->left->red = !h->left->red; in color_flip()
100 node->left = node->right = NULL; in rb_insert()
108 if (is_red(tree->left) && is_red(tree->right)) in rb_insert()
[all …]
/external/jline/src/src/test/java/jline/
DTestCompletion.java59 new Buffer("f baz").left().left().left().left(). in testArgumentCompletor()
62 new Buffer("b foo").left().left().left().left(). in testArgumentCompletor()
65 new Buffer("foo b baz").left().left().left().left(). in testArgumentCompletor()
68 new Buffer("foo f baz").left().left().left().left(). in testArgumentCompletor()
/external/e2fsprogs/lib/support/
Ddict.c57 #define left dict_left macro
75 #define dict_root(D) ((D)->nilnode.left)
94 upper->right = lowleft = lower->left; in rotate_left()
102 if (upper == upparent->left) { in rotate_left()
103 upparent->left = lower; in rotate_left()
109 lower->left = upper; in rotate_left()
122 lower = upper->left; in rotate_right()
123 upper->left = lowright = lower->right; in rotate_right()
131 dict_assert (upper == upparent->left); in rotate_right()
132 upparent->left = lower; in rotate_right()
[all …]
/external/f2fs-tools/fsck/
Ddict.c52 #define left dict_left macro
70 #define dict_root(D) ((D)->nilnode.left)
88 upper->right = lowleft = lower->left; in rotate_left()
96 if (upper == upparent->left) { in rotate_left()
97 upparent->left = lower; in rotate_left()
103 lower->left = upper; in rotate_left()
115 lower = upper->left; in rotate_right()
116 upper->left = lowright = lower->right; in rotate_right()
124 dict_assert(upper == upparent->left); in rotate_right()
125 upparent->left = lower; in rotate_right()
[all …]
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
DShadowRect.java14 public void __constructor__(int left, int top, int right, int bottom) { in __constructor__() argument
15 realRect.left = left; in __constructor__()
22 realRect.left = otherRect.left; in __constructor__()
30 set(rect.left, rect.top, rect.right, rect.bottom); in set()
34 public void set(int left, int top, int right, int bottom) { in set() argument
35 realRect.left = left; in set()
43 return realRect.right - realRect.left; in width()
60 return realRect.left == r.left && realRect.top == r.top && realRect.right == r.right in equals()
68 sb.append(realRect.left); in toString()
81 return x > realRect.left && x < realRect.right in contains()
[all …]
/external/protobuf/java/core/src/main/java/com/google/protobuf/
DRopeByteString.java118 private final ByteString left; field in RopeByteString
132 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument
133 this.left = left; in RopeByteString()
135 leftLength = left.size(); in RopeByteString()
137 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
155 static ByteString concatenate(ByteString left, ByteString right) { in concatenate() argument
157 return left; in concatenate()
160 if (left.size() == 0) { in concatenate()
164 final int newLength = left.size() + right.size(); in concatenate()
168 return concatenateBytes(left, right); in concatenate()
[all …]

12345678910>>...127