| /dalvik/libcore/luni/src/test/java/junit/runner/ |
| D | Sorter.java | 14 public void swap(Vector values, int left, int right); in swap() argument
17 public static void sortStrings(Vector values , int left, int right, Swapper swapper) { in sortStrings() argument
18 int oleft= left; in sortStrings()
20 String mid= (String)values.elementAt((left + right) / 2); in sortStrings()
22 while (((String)(values.elementAt(left))).compareTo(mid) < 0) in sortStrings()
23 left++; in sortStrings()
26 if (left <= right) { in sortStrings()
27 swapper.swap(values, left, right); in sortStrings()
28 left++; in sortStrings()
31 } while (left <= right); in sortStrings()
[all …]
|
| /dalvik/dx/src/junit/runner/ |
| D | Sorter.java | 14 public void swap(Vector values, int left, int right); in swap() argument
17 public static void sortStrings(Vector values , int left, int right, Swapper swapper) { in sortStrings() argument
18 int oleft= left; in sortStrings()
20 String mid= (String)values.elementAt((left + right) / 2); in sortStrings()
22 while (((String)(values.elementAt(left))).compareTo(mid) < 0) in sortStrings()
23 left++; in sortStrings()
26 if (left <= right) { in sortStrings()
27 swapper.swap(values, left, right); in sortStrings()
28 left++; in sortStrings()
31 } while (left <= right); in sortStrings()
[all …]
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/engines/ |
| D | DESEngine.java | 407 int work, right, left; in desFunc() local
409 left = (in[inOff + 0] & 0xff) << 24; in desFunc()
410 left |= (in[inOff + 1] & 0xff) << 16; in desFunc()
411 left |= (in[inOff + 2] & 0xff) << 8; in desFunc()
412 left |= (in[inOff + 3] & 0xff); in desFunc()
419 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; in desFunc()
421 left ^= (work << 4); in desFunc()
422 work = ((left >>> 16) ^ right) & 0x0000ffff; in desFunc()
424 left ^= (work << 16); in desFunc()
425 work = ((right >>> 2) ^ left) & 0x33333333; in desFunc()
[all …]
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/util/encoders/ |
| D | HexTranslator.java | 59 byte left, right; in decode()
62 left = in[inOff + i * 2]; in decode()
65 if (left < (byte)'a') in decode()
67 out[outOff] = (byte)((left - '0') << 4); in decode()
71 out[outOff] = (byte)((left - 'a' + 10) << 4); in decode()
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/ |
| D | X509NameEntryConverter.java | 67 char left = str.charAt((index * 2) + off); in convertHexEncoded() local
70 if (left < 'a') in convertHexEncoded()
72 data[index] = (byte)((left - '0') << 4); in convertHexEncoded()
76 data[index] = (byte)((left - 'a' + 10) << 4); in convertHexEncoded()
|
| /dalvik/libcore/luni/src/main/java/java/util/ |
| D | Timer.java | 65 TimerNode parent, left, right; field in Timer.TimerImpl.TimerNode
79 if (left != null) { in deleteIfCancelled()
80 left.deleteIfCancelled(tasks); in deleteIfCancelled()
107 x = x.left; in insert()
116 y.left = z; in insert()
124 if (z.left == null || z.right == null) { in delete()
129 if (y.left != null) { in delete()
130 x = y.left; in delete()
139 } else if (y == y.parent.left) { in delete()
140 y.parent.left = x; in delete()
[all …]
|
| D | TreeMap.java | 52 Entry<K, V> parent, left, right; field in TreeMap.Entry
68 if (left != null) { in clone()
69 clone.left = left.clone(clone); in clone()
732 if (x.parent == x.parent.parent.left) { in balance()
749 y = x.parent.parent.left; in balance()
756 if (x == x.parent.left) { in balance()
851 if (node.left != null) { in containsValue()
852 if (containsValue(node.left, value)) { in containsValue()
922 x = result < 0 ? x.left : x.right; in find()
944 x = x.left;
[all …]
|
| D | TimSort.java | 251 int left = lo; in binarySort() local
253 if (DEBUG) assert left <= right; in binarySort() local
259 while (left < right) { in binarySort()
260 int mid = (left + right) >>> 1; in binarySort()
264 left = mid + 1; in binarySort()
266 if (DEBUG) assert left == right; in binarySort()
275 int n = start - left; // The number of elements to move in binarySort()
278 case 2: a[left + 2] = a[left + 1]; in binarySort()
279 case 1: a[left + 1] = a[left]; in binarySort()
281 default: System.arraycopy(a, left, a, left + 1, n); in binarySort()
[all …]
|
| D | ComparableTimSort.java | 218 int left = lo; in binarySort() local
220 if (DEBUG) assert left <= right; in binarySort() local
226 while (left < right) { in binarySort()
227 int mid = (left + right) >>> 1; in binarySort()
231 left = mid + 1; in binarySort()
233 if (DEBUG) assert left == right; in binarySort()
242 int n = start - left; // The number of elements to move in binarySort()
245 case 2: a[left + 2] = a[left + 1]; in binarySort()
246 case 1: a[left + 1] = a[left]; in binarySort()
248 default: System.arraycopy(a, left, a, left + 1, n); in binarySort()
[all …]
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ |
| D | DERInputStream.java | 76 int left = bytes.length; in readFully() local
78 if (left == 0) in readFully()
83 while (left > 0) in readFully()
85 int l = read(bytes, bytes.length - left, left); in readFully()
92 left -= l; in readFully()
|
| D | ASN1InputStream.java | 129 int left = bytes.length; in readFully() local
132 if (left == 0) in readFully()
137 while ((len = read(bytes, bytes.length - left, left)) > 0) in readFully()
139 if ((left -= len) == 0) in readFully()
145 if (left != 0) in readFully()
|
| /dalvik/docs/ |
| D | dalvik-constraints.css | 36 margin-left: 48px;
43 text-align: left;
54 padding-left: 4px;
|
| D | java-constraints.css | 36 margin-left: 48px;
43 text-align: left;
54 padding-left: 4px;
|
| D | dalvik-bytecode.css | 50 padding-left: 4px;
67 margin-left: 48px;
78 padding-left: 2px;
117 margin-left: 48px;
145 margin-left: 48px;
|
| D | dex-format.css | 58 margin-left: 40pt;
66 margin-left: 40pt;
83 padding-left: 3pt;
103 padding-left: 6pt;
109 padding-left: 6pt;
121 padding-left: 0pt;
129 padding-left: 15pt;
163 border-left: solid #aaaaff 1px;
168 border-left: none;
172 border-left: solid #000 2px;
|
| D | instruction-formats.css | 51 padding-left: 2px;
62 margin-left: 48px;
89 margin-left: 48px;
|
| D | java-bytecode.css | 42 padding-left: 10pt;
|
| /dalvik/docs/opcodes/ |
| D | opcode.css | 40 text-align: left;
51 padding-left: 4px;
68 margin-left: 48px;
79 padding-left: 2px;
118 margin-left: 48px;
146 margin-left: 48px;
|
| /dalvik/vm/mterp/armv5te/ |
| D | OP_CMPL_DOUBLE.S | 4 %verify "left arg NaN"
|
| D | OP_CMPL_FLOAT.S | 4 %verify "left arg NaN"
|
| D | OP_EXECUTE_INLINE.S | 46 ldr r3, [rFP, ip, lsr #10] @ r3<- vF (shift right 12, left 2)
|
| /dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/platform/ |
| D | OSMemory.java | 656 short left = (short) (value >> 16); in swap() local
659 int btmEnd = swap(left) & 0xFFFF; in swap()
664 int left = (int) (value >> 32); in swap() local
667 long btmEnd = swap(left) & 0xFFFFFFFFL; in swap()
|
| /dalvik/dx/src/com/android/dx/util/ |
| D | ByteArrayAnnotatedOutput.java | 484 Writer left = twoc.getLeft(); in writeAnnotationsTo() local
508 left.write(Hex.dump(data, start, end - start, start, hexCols, 6)); in writeAnnotationsTo()
516 left.write(Hex.dump(data, leftAt, cursor - leftAt, leftAt, in writeAnnotationsTo()
|
| /dalvik/libcore/nio/src/main/java/org/apache/harmony/nio/internal/ |
| D | SocketChannelImpl.java | 437 int left = readCount; in read() local
440 while (left > 0) { in read()
441 int putLength = Math.min(targets[index].remaining(), left); in read()
442 targets[index].put(readArray, readCount - left, putLength); in read()
444 left -= putLength; in read()
|
| D | DatagramChannelImpl.java | 516 int left = readCount; in read() local
520 while (left > 0) { in read()
521 int putLength = Math.min(targets[index].remaining(), left); in read()
522 targets[index].put(readArray, readCount - left, putLength); in read()
524 left -= putLength; in read()
|