Home
last modified time | relevance | path

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

12345678910>>...112

/external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/test/js/
Deffect.js3 var left = getComputedStyle(target).left;
4 return Number(left.substring(0, left.length - 2));
69 {left: '0px', offset: 0}, property
70 {left: '10px'}, property
71 {left: '20px'}, property
72 {left: '30px', offset: 0.6}, property
73 {left: '40px'}, property
74 {left: '50px'} property
79 assert.equal(normalizedKeyframes[0].left, '0px');
81 assert.equal(normalizedKeyframes[1].left, '10px');
[all …]
/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
27 dst[r * stride] = AVG2(left[r], left[r + 1]); in d207_predictor()
28 dst[(bs - 1) * stride] = left[bs - 1]; in d207_predictor()
33 dst[r * stride] = AVG3(left[r], left[r + 1], left[r + 2]); in d207_predictor()
34 dst[(bs - 2) * stride] = AVG3(left[bs - 2], left[bs - 1], left[bs - 1]); in d207_predictor()
35 dst[(bs - 1) * stride] = left[bs - 1]; in d207_predictor()
40 dst[(bs - 1) * stride + c] = left[bs - 1]; in d207_predictor()
48 const uint8_t *above, const uint8_t *left) { in d207e_predictor() argument
54 dst[c] = c & 1 ? AVG3(left[(c >> 1) + r], left[(c >> 1) + r + 1], in d207e_predictor()
55 left[(c >> 1) + r + 2]) in d207e_predictor()
[all …]
Dvpx_dsp_rtcd_defs.pl57 …d207_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
60 …207e_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
63 …_d45_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
66 …d45e_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
69 …_d63_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
72 …d63e_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
75 …d63f_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
78 …px_h_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
81 …x_he_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
84 …d117_predictor_4x4/, "uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left";
[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/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/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/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/v8/src/compiler/
Dmachine-operator-reducer.cc140 if (m.right().Is(0)) return Replace(m.left().node()); // x ^ 0 => x in Reduce()
142 return ReplaceInt32(m.left().Value() ^ m.right().Value()); in Reduce()
145 if (m.left().IsWord32Xor() && m.right().Is(-1)) { in Reduce()
146 Int32BinopMatcher mleft(m.left().node()); in Reduce()
148 return Replace(mleft.left().node()); in Reduce()
157 if (m.right().Is(0)) return Replace(m.left().node()); // x >>> 0 => x in Reduce()
159 return ReplaceInt32(m.left().Value() >> m.right().Value()); in Reduce()
167 if (m.right().Is(0)) return Replace(m.left().node()); // x ror 0 => x in Reduce()
170 base::bits::RotateRight32(m.left().Value(), m.right().Value())); in Reduce()
177 return ReplaceBool(m.left().Value() == m.right().Value()); in Reduce()
[all …]
/external/skia/src/core/
DSkTSort.h121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { in SkTInsertionSort() argument
122 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
125 while (left < hole && lessThan(insert, *(hole - 1))) { in SkTInsertionSort()
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
139 T* newPivot = left; in SkTQSort_Partition()
140 while (left < right) { in SkTQSort_Partition()
141 if (lessThan(*left, pivotValue)) { in SkTQSort_Partition()
142 SkTSwap(*left, *newPivot); in SkTQSort_Partition()
145 left += 1; in SkTQSort_Partition()
163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { in SkTIntroSort() argument
[all …]
/external/avahi/avahi-core/
Dprioq.c69 n = n->left; in get_node_at_xy()
97 if (a->parent->left == b) in exchange_nodes()
98 a->parent->left = a; in exchange_nodes()
104 if (b->left == a) { in exchange_nodes()
105 if ((b->left = a->left)) in exchange_nodes()
106 b->left->parent = b; in exchange_nodes()
107 a->left = b; in exchange_nodes()
120 l = a->left; in exchange_nodes()
121 if ((a->left = b->left)) in exchange_nodes()
122 a->left->parent = a; in exchange_nodes()
[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/pdfium/core/src/fxcrt/
Dfx_basic_coords.cpp13 if (left > right) { in Normalize()
14 int temp = left; in Normalize()
15 left = right; in Normalize()
28 left = left > src_n.left ? left : src_n.left; in Intersect()
32 if (left > right || top > bottom) { in Intersect()
33 left = top = right = bottom = 0; in Intersect()
40 left = left < other.left ? left : other.left; in Union()
69 left = (FX_FLOAT)(rect.left); in CFX_FloatRect()
76 if (left > right) { in Normalize()
77 temp = left; in Normalize()
[all …]
/external/pdfium/fpdfsdk/src/pdfwindow/
DPWL_Utils.cpp75 rcRet.left = PWL_MIN(rect1.left, rect2.left); in MaxRect()
86 return CPDF_Rect(rect.left + x, rect.bottom + y, rect.right + x, in OffsetRect()
92 return rcChild.left >= rcParent.left && rcChild.bottom >= rcParent.bottom && in ContainsRect()
98 FX_FLOAT left = rect1.left > rect2.left ? rect1.left : rect2.left; in IntersectRect() local
103 return left < right && bottom < top; in IntersectRect()
139 const FX_FLOAT fWidth = crBBox.right - crBBox.left; in GetAP_Check()
161 pts[i][j].x = pts[i][j].x * fWidth + crBBox.left; in GetAP_Check()
190 FX_FLOAT fWidth = crBBox.right - crBBox.left; in GetAP_Circle()
193 CPDF_Point pt1(crBBox.left, crBBox.bottom + fHeight / 2); in GetAP_Circle()
194 CPDF_Point pt2(crBBox.left + fWidth / 2, crBBox.top); in GetAP_Circle()
[all …]
/external/curl/lib/
Dversion.c68 size_t left = sizeof(version); in curl_version() local
72 left -= len; in curl_version()
75 if(left > 1) { in curl_version()
76 len = Curl_ssl_version(ptr + 1, left - 1); in curl_version()
80 left -= ++len; in curl_version()
86 len = snprintf(ptr, left, " zlib/%s", zlibVersion()); in curl_version()
87 left -= len; in curl_version()
92 len = snprintf(ptr, left, " c-ares/%s", ares_version(NULL)); in curl_version()
93 left -= len; in curl_version()
98 len = snprintf(ptr, left, " libidn/%s", stringprep_check_version(NULL)); in curl_version()
[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/pdfium/core/include/fxcrt/
Dfx_coordinates.h194 void Set(baseType left, baseType top, baseType width, baseType height) { in Set() argument
195 FXT_RECT::left = left, FXT_RECT::top = top, FXT_RECT::width = width, in Set()
198 void Set(baseType left, baseType top, const FXT_SIZE& size) { in Set() argument
199 FXT_RECT::left = left, FXT_RECT::top = top, FXT_RECT::Size(size); in Set()
213 FXT_RECT::left = FXT_RECT::top = FXT_RECT::width = FXT_RECT::height = 0; in Reset()
216 left += p.x, top += p.y;
220 left -= p.x, top -= p.y;
223 baseType right() const { return left + width; } in right()
227 left += width; in Normalize()
236 left += dx; in Offset()
[all …]
/external/e2fsprogs/e2fsck/
Ddict.c51 #define left dict_left macro
69 #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()
116 lower = upper->left; in rotate_right()
117 upper->left = lowright = lower->right; in rotate_right()
125 assert (upper == upparent->left); in rotate_right()
126 upparent->left = lower; in rotate_right()
[all …]
/external/zlib/src/examples/
Denough.c203 local big_t count(int syms, int len, int left) in count() argument
213 if (syms == left) in count()
217 assert(syms > left && left > 0 && len < max); in count()
220 index = INDEX(syms, left, len); in count()
227 least = (left << 1) - syms; in count()
234 most = (((code_t)left << (max - len)) - syms) / in count()
240 got = count(syms - use, len + 1, (left - use) << 1); in count()
258 local int beenhere(int syms, int len, int left, int mem, int rem) in beenhere() argument
267 index = INDEX(syms, left, len); in beenhere()
322 local void examine(int syms, int len, int left, int mem, int rem) in examine() argument
[all …]
Dgzjoin.c81 unsigned left; /* bytes remaining at next */ member
113 in->left = 0; in bopen()
127 if (in->left != 0) in bload()
131 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left); in bload()
134 in->left += (unsigned)len; in bload()
135 } while (len != 0 && in->left < CHUNK); in bload()
140 #define bget(in) (in->left ? 0 : bload(in), \
141 in->left ? (in->left--, *(in->next)++) : \
164 if (skip <= in->left) { in bskip()
165 in->left -= skip; in bskip()
[all …]
/external/zlib/src/contrib/blast/
Dblast.c42 unsigned left; /* available input at in */ member
75 if (s->left == 0) { in bits()
76 s->left = s->infun(s->inhow, &(s->in)); in bits()
77 if (s->left == 0) longjmp(s->env, 1); /* out of input */ in bits()
80 s->left--; in bits()
133 int left; /* bits left in next or left to process */ in decode() local
137 left = s->bitcnt; in decode()
142 while (left--) { in decode()
157 left = (MAXBITS+1) - len; in decode()
158 if (left == 0) break; in decode()
[all …]
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/resources/
Dreport.css21 margin-left:8px;
25 padding-left:18px;
27 background-position:left center;
32 padding-left:18px;
34 background-position:left center;
39 padding-left:18px;
41 background-position:left center;
46 padding-left:18px;
48 background-position:left center;
53 padding-left:18px;
[all …]
/external/protobuf/java/src/main/java/com/google/protobuf/
DRopeByteString.java115 private final ByteString left; field in RopeByteString
129 private RopeByteString(ByteString left, ByteString right) { in RopeByteString() argument
130 this.left = left; in RopeByteString()
132 leftLength = left.size(); in RopeByteString()
134 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
151 static ByteString concatenate(ByteString left, ByteString right) { in concatenate() argument
154 (left instanceof RopeByteString) ? (RopeByteString) left : null; in concatenate()
156 result = left; in concatenate()
157 } else if (left.size() == 0) { in concatenate()
160 int newLength = left.size() + right.size(); in concatenate()
[all …]

12345678910>>...112