| /libcore/luni/src/main/java/java/util/ |
| DualPivotQuicksort.java | 97 * on {@code left} or {@code right}.
100 * @param left the index of the first element, inclusive, to be sorted
103 private static void doSort(int[] a, int left, int right) {
105 if (right - left + 1 < INSERTION_SORT_THRESHOLD) {
106 for (int i = left + 1; i <= right; i++) {
109 for (j = i - 1; j >= left && ai < a[j]; j--) {
115 dualPivotQuicksort(a, left, right);
124 * @param left the index of the first element, inclusive, to be sorted
127 private static void dualPivotQuicksort(int[] a, int left, int right) {
129 int sixth = (right - left + 1) / 6
[all...] |
| /external/chromium_org/chrome/browser/resources/downloads/ |
| downloads.css | 15 float: left;
25 float: left;
46 float: left;
80 left: -110px;
86 left: auto;
100 left: 9px;
107 left: auto;
121 background-position: left bottom;
131 left: 0;
138 left: auto
[all...] |
| /external/chromium_org/ui/keyboard/resources/webui/ |
| main.css | 34 margin-left: 3px;
42 left: 0;
44 padding-left: 10px;
76 left: 0;
84 /* Left and right-side special keys with a character letter next to them need
87 kb-shift-key.padded-left-special,
88 kb-key.padded-left-special {
94 margin-left: 5px;
129 .left-more {
149 .left-more
[all...] |
| /external/dropbear/libtomcrypt/src/misc/pkcs5/ |
| pkcs_5_2.c | 38 unsigned long stored, left, x, y; local
66 left = *outlen;
69 while (left != 0) {
104 for (y = 0; y < x && left != 0; ++y) {
106 --left;
|
| /external/guava/guava/src/com/google/common/collect/ |
| BstNode.java | 19 import static com.google.common.collect.BstSide.LEFT;
46 * The key on which this binary search tree is ordered. All descendants of the left subtree of
52 * The left child of this node. A null value indicates that this node has no left child.
55 private final N left; field in class:BstNode
63 BstNode(@Nullable K key, @Nullable N left, @Nullable N right) {
65 this.left = left;
83 case LEFT:
84 return left;
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
| SDL_BView.h | 65 bounds.top = bounds.left = 0;
89 dest.left = updateRect.left + xoff;
102 dest.left = updateRect.left + xoff;
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
| DESEngine.java | 408 int work, right, left; local
410 left = (in[inOff + 0] & 0xff) << 24;
411 left |= (in[inOff + 1] & 0xff) << 16;
412 left |= (in[inOff + 2] & 0xff) << 8;
413 left |= (in[inOff + 3] & 0xff);
420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f;
422 left ^= (work << 4);
423 work = ((left >>> 16) ^ right) & 0x0000ffff;
425 left ^= (work << 16);
426 work = ((right >>> 2) ^ left) & 0x33333333
[all...] |
| /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/ |
| DES.java | 285 int work, right, left; local
287 left = (in[inOff + 0] & 0xff) << 24;
288 left |= (in[inOff + 1] & 0xff) << 16;
289 left |= (in[inOff + 2] & 0xff) << 8;
290 left |= (in[inOff + 3] & 0xff);
297 work = ((left >>> 4) ^ right) & 0x0f0f0f0f;
299 left ^= (work << 4);
300 work = ((left >>> 16) ^ right) & 0x0000ffff;
302 left ^= (work << 16);
303 work = ((right >>> 2) ^ left) & 0x33333333
[all...] |
| /frameworks/base/libs/hwui/ |
| OpenGLRenderer.h | 171 * @param left The left coordinate of the dirty rectangle
179 virtual status_t prepareDirty(float left, float top, float right, float bottom, bool opaque);
225 ANDROID_API int saveLayer(float left, float top, float right, float bottom,
229 return saveLayer(left, top, right, bottom, paint ? paint->getAlpha() : 255, mode, flags);
231 ANDROID_API int saveLayerAlpha(float left, float top, float right, float bottom,
233 return saveLayer(left, top, right, bottom, alpha, SkXfermode::kSrcOver_Mode, flags);
235 virtual int saveLayer(float left, float top, float right, float bottom,
238 int saveLayerDeferred(float left, float top, float right, float bottom,
257 bool quickRejectPreStroke(float left, float top, float right, float bottom, SkPaint* paint)
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) {
14 if (left >= right || top >= bottom) {
20 this->set(left, top, right, bottom);
22 if (left < fLeft) fLeft = left;
133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right,
135 if (left < right && top < bottom && !this->isEmpty() && // check for empties
136 fLeft < right && left < fRight && fTop < bottom && top < fBottom)
138 if (fLeft < left) fLeft = left;
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| BstTesting.java | 18 import static com.google.common.collect.BstSide.LEFT;
39 SimpleNode(Character key, @Nullable SimpleNode left, @Nullable SimpleNode right) {
40 super(key, left, right);
53 && Objects.equal(childOrNull(LEFT), node.childOrNull(LEFT))
61 return Objects.hashCode(getKey(), childOrNull(LEFT), childOrNull(RIGHT));
68 SimpleNode source, @Nullable SimpleNode left, @Nullable SimpleNode right) {
69 return new SimpleNode(source.getKey(), left, right);
76 @Nullable SimpleNode left, @Nullable SimpleNode right) {
77 return checkNotNull(nodeFactory).createNode(source, left, right)
[all...] |
| BstNodeTest.java | 17 import static com.google.common.collect.BstSide.LEFT;
54 testLacksChild(leaf, LEFT);
61 testChildIs(node, LEFT, leaf);
68 testLacksChild(node, LEFT);
73 SimpleNode left = new SimpleNode('a', null, null); local
75 SimpleNode node = new SimpleNode('b', left, right);
76 testChildIs(node, LEFT, left);
95 for (SimpleNode left : GOOD_LEFTS) {
98 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()))
[all...] |
| /external/skia/src/core/ |
| SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) {
14 if (left >= right || top >= bottom) {
20 this->set(left, top, right, bottom);
22 if (left < fLeft) fLeft = left;
133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right,
135 if (left < right && top < bottom && !this->isEmpty() && // check for empties
136 fLeft < right && left < fRight && fTop < bottom && top < fBottom)
138 if (fLeft < left) fLeft = left;
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| Region.java | 71 nativeSetRect(mNativeRegion, r.left, r.top, r.right, r.bottom);
76 public Region(int left, int top, int right, int bottom) {
78 nativeSetRect(mNativeRegion, left, top, right, bottom);
97 return nativeSetRect(mNativeRegion, r.left, r.top, r.right, r.bottom);
102 public boolean set(int left, int top, int right, int bottom) {
103 return nativeSetRect(mNativeRegion, left, top, right, bottom);
182 return quickContains(r.left, r.top, r.right, r.bottom);
191 public native boolean quickContains(int left, int top, int right,
200 return quickReject(r.left, r.top, r.right, r.bottom);
208 public native boolean quickReject(int left, int top, int right, int bottom)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| losertree.h | 186 unsigned int left = init_winner (2 * root); local
189 || (!losers[left].sup
190 && !comp(losers[right].key, losers[left].key)))
192 // Left one is less or equal.
194 return left;
199 losers[root] = losers[left];
281 unsigned int left = init_winner (2 * root); local
284 (!losers[left].sup
285 && !comp(losers[right].key, losers[left].key)))
287 // Left one is less or equal
414 unsigned int left = init_winner (2 * root); local
494 unsigned int left = init_winner (2 * root); local
638 unsigned int left = init_winner (2 * root); local
721 unsigned int left = init_winner (2 * root); local
875 unsigned int left = init_winner (2 * root); local
958 unsigned int left = init_winner (2 * root); local
[all...] |
| /external/zlib/src/examples/ |
| gzappend.c | 122 /* rotate list[0..len-1] left by rot positions, in place */
137 /* do simple left shift by one */
163 *to = *from; /* shift left */
173 unsigned left; /* bytes available at next */ member in struct:__anon30852
186 in->left = (unsigned)len;
198 #define read1(in) (in->left == 0 ? readmore(in) : 0, \
199 in->left--, *(in->next)++)
206 if (n > in->left) {
207 n -= in->left;
215 if (n > in->left)
261 int ret, lastbit, left, full; local
391 unsigned left; local
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| RectFTest.java | 60 assertEquals(10.0f, mRectF.left);
66 assertEquals(5.0f, mRectF.left);
77 assertEquals(1.0f, mRectF.left);
89 assertEquals(1.0f, mRectF.left);
101 assertEquals(1.0f, mRectF.left);
112 assertEquals(0.0f, mRectF.left);
119 assertEquals(0.0f, mRectF.left);
145 assertEquals(5.0f, mRectF.left);
152 assertEquals(0.0f, mRectF.left);
166 assertEquals(5.0f, mRectF.left);
[all...] |
| /external/chromium_org/v8/benchmarks/spinning-balls/ |
| 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 child of the dummy nod
[all...] |
| /external/v8/benchmarks/spinning-balls/ |
| 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 child of the dummy nod
[all...] |
| /external/chromium_org/third_party/bintrees/bintrees/ |
| bintree.py | 18 __slots__ = ['key', 'value', 'left', 'right']
23 self.left = None
27 """ x.__getitem__(key) <==> x[key], where key is 0 (left) or 1 (right) """
28 return self.left if key == 0 else self.right
31 """ x.__setitem__(key, value) <==> x[key]=value, where key is 0 (left) or 1 (right) """
33 self.left = value
39 self.left = None
72 _clear(node.left)
125 if (node.left is not None) and (node.right is not None):
130 while replacement.left is not None
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| splitView.css | 33 left: 0;
55 left: 0;
67 left: 0;
71 left: 0;
96 border-left: 1px solid rgb(64%, 64%, 64%);
118 left: 0;
129 left: 0;
|
| tabbedPane.css | 59 float: left;
63 float: left;
89 left: 1px;
90 margin-left: 2px;
101 float: left;
105 padding-left: 3px;
133 left: 0;
|
| /external/elfutils/libebl/ |
| eblstrtab.c | 77 struct Ebl_Strent *left; member in struct:Ebl_Strent
96 size_t left; member in struct:Ebl_Strtab
148 st->left = len - offsetof (struct memoryblock, memory);
180 if (st->left < align + sizeof (struct Ebl_Strent) + len)
193 newstr->left = NULL;
200 st->left -= align + sizeof (struct Ebl_Strent) + len;
226 return searchstring (&(*sep)->left, newstr);
266 st->left += st->backp - (char *) newstr;
275 st->left += newstr->len;
287 newstr->left = (*sep)->left
[all...] |
| /hardware/ti/omap4xxx/camera/ |
| CameraHalUtilClasses.cpp | 123 size_t &left,
133 hRange = CameraArea::RIGHT - CameraArea::LEFT;
139 left = ( mLeft + hRange / 2 ) * hScale;
143 areaWidth -= left;
151 ssize_t left,
158 if ( ( 0 == top ) && ( 0 == left ) && ( 0 == bottom ) && ( 0 == right ) && ( 0 == weight ) ) {
177 if ( ( CameraArea::LEFT > left ) || ( CameraArea::RIGHT < left ) ) {
178 CAMHAL_LOGEB("Camera area left coordinate is invalid %d", left )
212 ssize_t top, left, bottom, right, weight; local
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/ |
| keyboard_overlay_data.js | 152 'format': 'left',
218 'format': 'left',
281 'format': 'left',
341 'format': 'left',
397 'label': 'left'
406 'format': 'left',
485 'format': 'left',
545 'format': 'left',
599 'format': 'left',
657 'format': 'left',
[all...] |
