Searched refs:first (Results 1 - 25 of 40) sorted by relevance

12

/libcore/luni/src/main/java/java/text/
H A DCharacterIterator.java56 public char first(); method in interface:CharacterIterator
61 * @return the index of the first character of the iteration.
H A DRuleBasedBreakIterator.java38 @Override public int first() { method in class:RuleBasedBreakIterator
39 return wrapped.first();
H A DBreakIterator.java58 * {@code first()}, {@code last()}, {@code next()}, and {@code previous()} that
73 * follow them. Thus, under normal circumstances, the position before the first
74 * character is 0, the position after the first character is 1, and the position
124 * int start = boundary.first();
148 * Print the first element:
153 * int start = boundary.first();
399 * Sets this iterator's current position to the first boundary and returns
402 * @return the position of the first boundary.
404 public abstract int first(); method in class:BreakIterator
407 * Sets the position of the first boundar
[all...]
H A DStringCharacterIterator.java74 * the index of the first character to iterate.
153 public char first() { method in class:StringCharacterIterator
164 * @return the index of the first character of the iteration.
/libcore/luni/src/main/java/java/util/
H A DSortedSet.java41 * Returns the first element in this {@code SortedSet}. The first element
44 * @return the first element.
48 public E first(); method in interface:SortedSet
H A DLinkedList.java523 * Returns the first element in this {@code LinkedList}.
525 * @return the first element.
534 Link<E> first = voidLink.next;
535 if (first != voidLink) {
536 return first.data;
669 * Removes the first object from this {@code LinkedList}.
680 Link<E> first = voidLink.next;
681 if (first != voidLink) {
682 Link<E> next = first.next;
687 return first
[all...]
H A DTreeMap.java388 Node<K, V> adjacent = (left.height > right.height) ? left.last() : right.first();
588 return immutableCopy(root == null ? null : root.first());
595 Node<K, V> result = root.first();
608 return root.first().getKey();
798 return right.first();
815 * the first node in the tree.
835 * Returns the first node in this subtree.
837 public Node<K, V> first() { method in class:TreeMap.Node
922 return new MapIterator<Entry<K, V>>(root == null ? null : root.first()) {
957 return new MapIterator<K>(root == null ? null : root.first()) {
992 public K first() { method in class:TreeMap.KeySet
1242 endpoint(boolean first) argument
1572 public K first() { method in class:TreeMap.BoundedMap.BoundedKeySet
[all...]
/libcore/luni/src/main/java/libcore/icu/
H A DICU.java69 int first = localeName.indexOf('_');
70 int second = localeName.indexOf('_', first + 1);
71 if (first == -1) {
76 return new Locale(localeName.substring(0, first), localeName.substring(first + 1));
79 return new Locale(localeName.substring(0, first), localeName.substring(first + 1, second), localeName.substring(second + 1));
H A DNativeBreakIterator.java79 public int first() { method in class:NativeBreakIterator
111 for (char c = newText.first(); c != CharacterIterator.DONE; c = newText.next()) {
/libcore/luni/src/main/java/java/util/concurrent/
H A DDelayQueue.java160 E first = q.peek();
161 if (first == null || first.getDelay(NANOSECONDS) > 0)
182 E first = q.peek();
183 if (first == null)
186 long delay = first.getDelay(NANOSECONDS);
226 E first = q.peek();
227 if (first == null) {
233 long delay = first.getDelay(NANOSECONDS);
291 * Return first elemen
[all...]
H A DScheduledThreadPoolExecutor.java30 * execution time are enabled in first-in-first-out (FIFO) order of
1017 * first element with last and sifts it down. Call only when
1035 RunnableScheduledFuture<?> first = queue[0];
1036 if (first == null || first.getDelay(NANOSECONDS) > 0)
1039 return finishPoll(first);
1050 RunnableScheduledFuture<?> first = queue[0];
1051 if (first == null)
1054 long delay = first
[all...]
H A DLinkedBlockingDeque.java64 * self-link implicitly means to jump to "first" (for next links)
106 * Pointer to first node.
107 * Invariant: (first == null && last == null) ||
108 * (first.prev == null && first.item != null)
110 transient Node<E> first; field in class:LinkedBlockingDeque
114 * Invariant: (first == null && last == null) ||
183 * Links node as first element, or returns false if full.
189 Node<E> f = first;
191 first
[all...]
H A DConcurrentLinkedQueue.java22 * This queue orders elements FIFO (first-in-first-out).
123 * to be two or more steps away from the first/last node.
194 * A node from which the first live (non-deleted) node (if any)
369 * Returns the first live (non-deleted) node on list, or null if none.
371 * first node, not element. We could make peek() a wrapper around
372 * first(), but that would cost an extra volatile read of item,
376 Node<E> first() { method in class:ConcurrentLinkedQueue
399 return first() == null;
420 for (Node<E> p = first();
[all...]
H A DLinkedBlockingQueue.java24 * This queue orders elements FIFO (first-in-first-out).
72 * this gives visibility to the first n items.
182 Node<E> first = h.next;
184 head = first;
185 E x = first.item;
186 first.item = null;
481 Node<E> first = head.next;
482 if (first == null)
485 return first
[all...]
H A DConcurrentLinkedDeque.java96 * At any time, there is precisely one "first" node with a null
100 * a live node. The "first" and "last" nodes may or may not be live.
101 * The "first" and "last" nodes are always mutually reachable.
104 * next reference in the first or last node to a fresh node
109 * first or last node. Active nodes cannot be unlinked.
123 * The head and tail are only approximations to the first and last
124 * nodes of the deque. The first node can always be found by
145 * links from the first node is equal to the elements found via
153 * structure "gc-robust", as first described in detail by Boehm
192 * goto the first nod
506 unlinkFirst(Node<E> first, Node<E> next) argument
720 Node<E> first() { method in class:ConcurrentLinkedDeque
[all...]
H A DConcurrentHashMap.java78 * when first needed (see ensureSegment). To maintain visibility
340 HashEntry<K,V> first = entryAt(tab, index);
341 for (HashEntry<K,V> e = first;;) {
357 node.setNext(first);
359 node = new HashEntry<K,V>(hash, key, value, first);
454 HashEntry<K,V> first = entryForHash(this, hash);
455 HashEntry<K,V> e = first;
459 HashEntry<K,V> f; // to recheck first below
476 (f = entryForHash(this, hash)) != first) {
477 e = first
[all...]
/libcore/luni/src/main/java/java/lang/
H A DClassLoader.java74 * creation of the system class loader until first use. We use a static
255 // TODO Define a default ProtectionDomain on first use
382 * implementation first tries to use the parent class loader to find the
402 * This implementation first uses this class loader's parent to find the
416 Enumeration first = parent.getResources(resName);
419 return new TwoEnumerationsInOne(first, second);
714 * first enumeration until it's empty, then from the second one.
718 private Enumeration<URL> first; field in class:TwoEnumerationsInOne
722 public TwoEnumerationsInOne(Enumeration<URL> first, Enumeration<URL> second) { argument
723 this.first
[all...]
/libcore/luni/src/main/java/java/io/
H A DPipedReader.java249 boolean first = true;
255 if (!first && lastWriter != null && !lastWriter.isAlive()) {
258 first = false;
268 /* Copy chars from out to end of buffer first */
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java62 * first in the queue. But being first does not guarantee success;
111 * is constructed and head and tail pointers are set upon first
151 * first indicate they need a signal,
951 * Implemented by first checking interrupt status, then invoking
973 * and failing if the given timeout elapses. Implemented by first
1018 * first invoking at least once {@link #tryAcquireShared},
1034 * by first checking interrupt status, then invoking at least once
1055 * failing if the given timeout elapses. Implemented by first
1125 * Returns the first (longes
1620 doSignal(Node first) argument
1633 doSignalAll(Node first) argument
[all...]
H A DAbstractQueuedSynchronizer.java19 * first-in-first-out (FIFO) wait queues. This class is designed to
119 * <em>unblock the first queued thread</em>;
291 * first in the queue. But being first does not guarantee success;
340 * is constructed and head and tail pointers are set upon first
380 * first indicate they need a signal,
1180 * Implemented by first checking interrupt status, then invoking
1202 * and failing if the given timeout elapses. Implemented by first
1247 * first invokin
1848 doSignal(Node first) argument
1861 doSignalAll(Node first) argument
[all...]
/libcore/luni/src/test/java/libcore/java/sql/
H A DOldResultSetTest.java193 assertFalse(emptyTarget.first());
194 assertTrue(target.first());
199 target.first();
243 target.first();
260 * Second block first assertion fails. Is Last should evaluate true if the
303 //before first - first
305 //first - second
325 target.first();
/libcore/luni/src/test/java/libcore/java/text/
H A DOldAttributedStringTest.java33 buf.append(it.first());
173 buf.append(it.first());
278 public char first() { method in class:OldAttributedStringTest.testAttributedCharacterIterator
403 assertEquals("Incorrect iteration on AttributedString", it.first(),
/libcore/luni/src/test/java/libcore/java/util/prefs/
H A DOldAbstractPreferencesTest.java654 AbstractPreferences first = (AbstractPreferences) pref.node("First node");
658 assertEquals(0, first.childrenNames().length);
673 first.childrenNames();
715 AbstractPreferences first = (AbstractPreferences) pref.node("First node");
719 first.node("blabla/");
726 first.node("///invalid");
737 first.node(new String(sb));
741 first.node(new String(sb));
757 first.node("");
833 AbstractPreferences first
[all...]
/libcore/luni/src/test/java/libcore/java/util/
H A DTreeSetTest.java117 assertEquals("b", deserialized.first());
H A DOldTreeSetTest.java121 // Test for method java.lang.Object java.util.TreeSet.first()
122 assertTrue("Returned incorrect first element",
123 ts.first() == objArray[0]);
127 ts.first();

Completed in 486 milliseconds

12