Searched refs:index (Results 126 - 150 of 257) sorted by relevance

1234567891011

/dalvik/libcore/xml/src/main/java/org/kxml2/kdom/
H A DNode.java45 given index. */
47 public void addChild(int index, int type, Object child) { argument
66 children.insertElementAt(child, index);
67 types.insert(index, (char) type);
92 /** Returns the child object at the given index. For child
96 public Object getChild(int index) { argument
97 return children.elementAt(index);
106 /** returns the element at the given index. If the node at the
107 given index is a text node, null is returned */
109 public Element getElement(int index) { argument
174 getText(int index) argument
181 getType(int index) argument
[all...]
/dalvik/libcore/luni/src/main/java/java/util/
H A DHashtable.java558 int index = (hash & 0x7FFFFFFF) % elementData.length;
559 Entry<K, V> entry = elementData[index];
571 int index = (hash & 0x7FFFFFFF) % elementData.length;
572 Entry<K, V> entry = elementData[index];
703 int index = (hash & 0x7FFFFFFF) % elementData.length;
704 Entry<K, V> entry = elementData[index];
712 index = (hash & 0x7FFFFFFF) % elementData.length;
714 if (index < firstSlot) {
715 firstSlot = index;
717 if (index > lastSlo
[all...]
H A DHashMap.java212 int index = (hash & 0x7FFFFFFF) % associatedMap.elementData.length;
213 entry = associatedMap.findNonNullKeyEntry(key, index, hash);
376 int index = (hash & 0x7FFFFFFF) % elementData.length;
377 m = findNonNullKeyEntry(key, index, hash);
446 int index = (hash & 0x7FFFFFFF) % elementData.length;
447 m = findNonNullKeyEntry(key, index, hash);
455 final Entry<K,V> findNonNullKeyEntry(Object key, int index, int keyHash) { argument
456 Entry<K,V> m = elementData[index];
579 int index = (hash & 0x7FFFFFFF) % elementData.length;
580 entry = findNonNullKeyEntry(key, index, has
596 createEntry(K key, int index, V value) argument
603 createHashedEntry(K key, int index, int hash) argument
[all...]
H A DArrayList.java111 * the index at which to insert the object.
131 int index = location + firstIndex;
132 System.arraycopy(array, index, array, index + 1, size
178 * the index at which to insert.
201 int index = location + firstIndex;
202 System.arraycopy(array, index, array, index - newFirst,
210 int index = location + firstIndex;
211 System.arraycopy(array, index, arra
[all...]
H A DLinkedHashMap.java181 int index = (lastEntry.key == null)? 0 : (lastEntry.key.hashCode() & 0x7FFFFFFF) % associatedMap.elementData.length;
182 LinkedHashMapEntry<KT, VT> m = (LinkedHashMapEntry<KT, VT>) associatedMap.elementData[index];
184 associatedMap.elementData[index] = lastEntry.next;
286 int index = (hash & 0x7FFFFFFF) % elementData.length;
287 m = (LinkedHashMapEntry<K, V>)findNonNullKeyEntry(key, index, hash);
313 * @param key @param index @return Entry
316 Entry<K, V> createEntry(K key, int index, V value) { argument
318 m.next = elementData[index];
319 elementData[index] = m;
324 Entry<K,V> createHashedEntry(K key, int index, in argument
[all...]
H A DWeakHashMap.java468 int index = (key.hashCode() & 0x7FFFFFFF) % elementData.length;
469 Entry<K, V> entry = elementData[index];
491 int index = (key.hashCode() & 0x7FFFFFFF) % elementData.length;
492 Entry<K, V> entry = elementData[index];
571 int index = (toRemove.hash & 0x7FFFFFFF) % elementData.length;
572 entry = elementData[index];
579 elementData[index] = entry.next;
605 int index = 0;
608 index = (key.hashCode() & 0x7FFFFFFF) % elementData.length;
609 entry = elementData[index];
[all...]
/dalvik/libcore/nio/src/main/java/java/nio/
H A DCharSequenceAdapter.java66 public char get(int index) { argument
67 if (index < 0 || index >= limit) {
70 return sequence.charAt(index);
115 public CharBuffer put(int index, char c) { argument
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/
H A DTwoKeyHashMap.java137 int index = arrSize;
138 if (arr[index] == null) {
139 arr[index] = createEntry(0, null, null, value, null);
144 V oldValue = arr[index].value;
145 arr[index].value = value;
151 int index = (hash & 0x7fffffff) % arrSize;
152 Entry<E, K, V> e = arr[index];
163 arr[index] = createEntry(hash, key1, key2, value, arr[index]);
464 int index
[all...]
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
H A DCyclicBarrier.java76 * {@link #await} returns the arrival index of that thread at the barrier.
148 int index = --count;
159 if (index == 0) { // tripped
190 return index;
287 * @return the arrival index of the current thread, where index
351 * @return the arrival index of the current thread, where index
/dalvik/libcore/luni-kernel/src/main/native/
H A Djava_lang_ProcessManager.c312 jsize index; local
313 for (index = 0; index < length; index++) {
315 env, javaArray, index);
318 array[index] = entry;
331 jsize index; local
332 for (index = 0; index < length; index
[all...]
H A Djava_lang_System.c61 static jstring java_getEnvByIndex(JNIEnv* env, jclass clazz, jint index) argument
65 char* entry = environ[index];
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/
H A DV2Form.java54 int index = 0;
58 index++;
62 for (int i = index; i != seq.size(); i++)
H A DX509NameElementList.java124 int index = (sz - 4) * 2;
125 rest[index] = key;
126 rest[index + 1] = value;
155 * @param n index
175 * @param n index
195 * @param n index
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/internal/reflect/
H A DProxyMethod.java52 int index = 0;
53 result[index++] = Error.class;
54 result[index++] = RuntimeException.class;
57 result[index++] = ex;
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/engines/
H A DAESEngine.java424 int index = off;
426 C0 = (bytes[index++] & 0xff);
427 C0 |= (bytes[index++] & 0xff) << 8;
428 C0 |= (bytes[index++] & 0xff) << 16;
429 C0 |= bytes[index++] << 24;
431 C1 = (bytes[index++] & 0xff);
432 C1 |= (bytes[index++] & 0xff) << 8;
433 C1 |= (bytes[index++] & 0xff) << 16;
434 C1 |= bytes[index++] << 24;
436 C2 = (bytes[index
[all...]
/dalvik/libcore/luni/src/main/native/
H A DcommonDblParce.c160 IDATA index = 1; local
172 * back out of it if there is no more room, i.e. index >
175 memcpy (fNoOverflow, f, sizeof (U_64) * index);
177 simpleAppendDecimalDigitHighPrecision (f, index, *s - '0');
180 f[index++] = overflow;
186 if (index >= MAX_ACCURACY_WIDTH)
188 index--;
189 memcpy (f, fNoOverflow, sizeof (U_64) * index);
199 index = -1;
201 while (index >
[all...]
H A Dorg_apache_harmony_luni_util_fltparse.c133 IDATA index = 1; local
145 * back out of it if there is no more room, i.e. index >
148 memcpy (fNoOverflow, f, sizeof (U_64) * index);
150 simpleAppendDecimalDigitHighPrecision (f, index, *s - '0');
154 f[index++] = overflow;
160 if (index >= MAX_ACCURACY_WIDTH)
162 index--;
163 memcpy (f, fNoOverflow, sizeof (U_64) * index);
173 index = -1;
175 while (index >
[all...]
/dalvik/libcore/luni/src/main/java/java/lang/
H A DString.java565 * the inclusive index into {@code codePoints} to begin
634 * @param index
635 * the zero-based index in this string.
636 * @return the character at the index.
638 * if {@code index < 0} or {@code index >= length()}.
641 public char charAt(int index) { argument
642 if (0 <= index && index < count) {
643 return value[offset + index];
919 getBytes(int start, int end, byte[] data, int index) argument
988 getChars(int start, int end, char[] buffer, int index) argument
1004 _getChars(int start, int end, char[] buffer, int index) argument
2107 codePointAt(int index) argument
2128 codePointBefore(int index) argument
2192 offsetByCodePoints(int index, int codePointOffset) argument
[all...]
/dalvik/libcore/text/src/main/java/java/text/
H A DFormat.java129 int index;
134 if (!quote && (index = fromChars.indexOf(next)) != -1) {
135 output.append(toChars.charAt(index));
234 * Parses the specified string starting at the index specified by
235 * {@code position}. If the string is successfully parsed then the index of
236 * the {@code ParsePosition} is updated to the index following the parsed
237 * text. On error, the index is unchanged and the error index of
238 * {@code ParsePosition} is set to the index where the error occurred.
243 * input/output parameter, specifies the start index i
[all...]
/dalvik/libcore/icu/src/main/native/
H A DResourceInterface.cpp94 static void addObject(JNIEnv *env, jobjectArray result, const char *keyStr, jobject elem, int index) { argument
100 env->SetObjectArrayElement(result, index, element);
1291 int index = 0; local
1294 addObject(env, result, "timezones", NULL, index++);
1296 if(firstDayOfWeek != NULL && index < counter) {
1297 addObject(env, result, "First_Day", firstDayOfWeek, index++);
1299 if(minimalDaysInFirstWeek != NULL && index < counter) {
1300 addObject(env, result, "Minimal_Days", minimalDaysInFirstWeek, index++);
1302 if(amPmMarkers != NULL && index < counter) {
1303 addObject(env, result, "ampm", amPmMarkers, index
[all...]
/dalvik/libcore/luni/src/main/java/java/io/
H A DRandomAccessFile.java841 * the index of the first byte in {@code buffer} to write.
954 for (int index = 0; index < str.length(); index++) {
955 bytes[index] = (byte) (str.charAt(index) & 0xFF);
994 for (int index = 0; index < str.length(); index++) {
995 int newIndex = index
[all...]
/dalvik/libcore/security/src/main/java/org/bouncycastle/openssl/
H A DPEMWriter.java83 int index = 0;
85 while (index != buf.length)
87 if ((i + index) >= bytes.length)
91 buf[index] = (char)bytes[i + index];
92 index++;
94 this.write(buf, 0, index);
/dalvik/vm/alloc/
H A DHeapBitmap.h26 * <index> is the index of .bits that contains the bit representing
188 const size_t index = HB_OFFSET_TO_INDEX(offset); local
189 return index < hb->bitsLen / sizeof(*hb->bits);
204 const size_t index = HB_OFFSET_TO_INDEX(offset); local
210 assert(index < hb->bitsLen / sizeof(*hb->bits));
218 unsigned long int *p = hb->bits + index;
223 hb->bits[index] |= mask;
226 hb->bits[index] &= ~mask;
H A DHeapBitmap.c190 size_t index; local
224 index = HB_OFFSET_TO_INDEX(hb_->max - hb_->base); \
261 index = HB_OFFSET_TO_INDEX(offset);
265 for (i = 0; i <= index; i++) {
271 /* The next index to look at.
273 index++;
277 index = 0;
287 i = index;
288 index = HB_OFFSET_TO_INDEX(longHb->max - longHb->base);
290 for (/* i = i */; i <= index;
[all...]
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/
H A DOrderedTable.java102 int index = (sz - 4) * 2;
103 int index1 = index + 1;
110 rest[index] = key;
150 * @param n index
170 * @param n index

Completed in 496 milliseconds

1234567891011