Searched defs:first (Results 1 - 25 of 26) 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 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();
402 * Sets this iterator's current position to the first boundary and returns
405 * @return the position of the first boundary.
407 public abstract int first(); method in class:BreakIterator
410 * Sets the position of the first boundar
[all...]
H A DRuleBasedBreakIterator.java38 @Override public int first() { method in class:RuleBasedBreakIterator
39 return wrapped.first();
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.
H A DAttributedString.java119 public char first() { method in class:AttributedString.AttributedIterator
130 * @return the index of the first character to iterate.
476 * if {@code start} is less than first index of
503 * if {@code start} is less than first index of
/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 DTreeSet.java260 * Returns the first element in this set.
263 public E first() { method in class:TreeSet
H A DHashMap.java67 * constructor). It is never written to, and replaced on first put. Its size
68 * is set to half the minimum, so that the first resize will create a
127 threshold = -1; // Forces first put invocation to replace EMPTY_TABLE
147 threshold = -1; // Forces first put() to replace EMPTY_TABLE
470 HashMapEntry<K, V> first = tab[index];
471 for (HashMapEntry<K, V> e = first; e != null; e = e.next) {
479 tab[index] = constructorNewEntry(key, value, hash, first);
508 K key, V value, int hash, HashMapEntry<K, V> first) {
509 return new HashMapEntry<K, V>(key, value, hash, first);
712 * The collection is created when this method is called for the first tim
507 constructorNewEntry( K key, V value, int hash, HashMapEntry<K, V> first) argument
[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...]
H A DCollections.java880 @Override public E first() { method in class:Collections.SynchronizedSortedSet
882 return ss.first();
1372 @Override public E first() { method in class:Collections.UnmodifiableSortedSet
1373 return ss.first();
1899 * position of the first element to swap with the element in
2012 * index of the first occurrence.
2020 * @return the beginning index of the first occurrence of {@code sublist} in
2035 // find the first element of sublist in the list to get a head start
2592 * the first collection.
2648 * Returns a last-in, first
3349 @Override public E first() { method in class:Collections.CheckedSortedSet
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/luni/tests/java/util/
H A DScannerParseLargeFileBenchmarkTest.java47 static boolean first = true; field in class:ScannerParseLargeFileBenchmarkTest.MyReader
62 if (first == true) {
64 first = false;
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedQueue.java22 * This queue orders elements FIFO (first-in-first-out).
122 * to be two or more steps away from the first/last node.
193 * A node from which the first live (non-deleted) node (if any)
367 * Returns the first live (non-deleted) node on list, or null if none.
369 * first node, not element. We could make peek() a wrapper around
370 * first(), but that would cost an extra volatile read of item,
374 Node<E> first() { method in class:ConcurrentLinkedQueue
397 return first() == null;
418 for (Node<E> p = first();
[all...]
H A DConcurrentSkipListSet.java356 public E first() { method in class:ConcurrentSkipListSet
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 DConcurrentLinkedDeque.java95 * At any time, there is precisely one "first" node with a null
99 * a live node. The "first" and "last" nodes may or may not be live.
100 * The "first" and "last" nodes are always mutually reachable.
103 * next reference in the first or last node to a fresh node
108 * first or last node. Active nodes cannot be unlinked.
122 * The head and tail are only approximations to the first and last
123 * nodes of the deque. The first node can always be found by
144 * links from the first node is equal to the elements found via
152 * structure "gc-robust", as first described in detail by Boehm
191 * goto the first nod
505 unlinkFirst(Node<E> first, Node<E> next) argument
719 Node<E> first() { method in class:ConcurrentLinkedDeque
[all...]
H A DConcurrentSkipListMap.java1069 * unless current thread stalls immediately before first CAS, in
1094 /* ---------------- Finding and removing first element -------------- */
1097 * Specialized variant of findNode to get first valid node.
1098 * @return first node or null if empty
1113 * Removes first entry; returns its snapshot.
1114 * @return null if empty, else snapshot of first entry
1140 * Clears out index nodes associated with deleted first entry.
2290 public E first() { return m.firstKey(); } method in class:ConcurrentSkipListMap.KeySet
/libcore/luni/src/main/java/libcore/icu/
H A DNativeBreakIterator.java84 public int first() { method in class:NativeBreakIterator
116 for (char c = newText.first(); c != CharacterIterator.DONE; c = newText.next()) {
/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/libart/src/main/java/java/lang/
H A DClassLoader.java74 * creation of the system class loader until first use. We use a static
390 * implementation first tries to use the parent class loader to find the
410 * This implementation first uses this class loader's parent to find the
424 Enumeration<URL> first = parent.getResources(resName);
427 return new TwoEnumerationsInOne(first, second);
728 * first enumeration until it's empty, then from the second one.
732 private final Enumeration<URL> first; field in class:TwoEnumerationsInOne
736 public TwoEnumerationsInOne(Enumeration<URL> first, Enumeration<URL> second) { argument
737 this.first = first;
[all...]
/libcore/libdvm/src/main/java/java/lang/
H A DClassLoader.java74 * creation of the system class loader until first use. We use a static
378 * implementation first tries to use the parent class loader to find the
398 * This implementation first uses this class loader's parent to find the
412 Enumeration first = parent.getResources(resName);
415 return new TwoEnumerationsInOne(first, second);
710 * first enumeration until it's empty, then from the second one.
714 private Enumeration<URL> first; field in class:TwoEnumerationsInOne
718 public TwoEnumerationsInOne(Enumeration<URL> first, Enumeration<URL> second) { argument
719 this.first = first;
[all...]
/libcore/luni/src/main/java/java/net/
H A DURI.java102 * characters must first be <i>encoded</i> before they can be embedded in a URI.
338 * Breaks uri into its component parts. This first splits URI into scheme,
535 // '[' and ']' can only be the first char and last char
769 * Returns true if {@code first} and {@code second} are equal after
772 private boolean escapedEquals(String first, String second) { argument
773 if (first.indexOf('%') != second.indexOf('%')) {
774 return first.equals(second);
778 while ((index = first.indexOf('%', prevIndex)) != -1
780 boolean match = first.substring(prevIndex, index).equals(
786 match = first
[all...]
/libcore/luni/src/test/java/tests/api/java/util/
H A DCollectionsTest.java331 fail("Expected NullPointerException for null list first parameter");
611 Object first = i.next();
612 assertTrue("Returned list consists of copies not refs", first == o);
663 assertTrue("Did not reverse correctly--first element is: "
1029 // test replace for the first element in the list
1206 fail("Expected NullPointerException for null list first parameter");
1290 boolean first) {
1302 if (first)
1324 fail("Expected NullPointerException for null list first parameter");
1289 testwithCharList(int count, String string1, String string2, boolean first) argument
/libcore/luni/src/main/java/java/sql/
H A DResultSet.java33 * ahead of the first row. To move the cursor to the first and consecutive rows,
58 * have the same name, then the getter methods use the first matching column.
76 * method. For insertion of new rows, the cursor is first moved to a special row
112 * in the forward direction, first to last.
118 * in the reverse direction, last to first.
168 * Moves the cursor to the start of the {@code ResultSet}, before the first
228 * Shifts the cursor position to the first row in the {@code ResultSet}.
235 public boolean first() throws SQLException; method in interface:ResultSet
845 * start at 1 for the first ro
[all...]
/libcore/luni/src/main/java/java/util/concurrent/locks/
H A DAbstractQueuedLongSynchronizer.java64 * first in the queue. But being first does not guarantee success;
113 * is constructed and head and tail pointers are set upon first
153 * first indicate they need a signal,
952 * Implemented by first checking interrupt status, then invoking
974 * and failing if the given timeout elapses. Implemented by first
1019 * first invoking at least once {@link #tryAcquireShared},
1035 * by first checking interrupt status, then invoking at least once
1056 * failing if the given timeout elapses. Implemented by first
1126 * Returns the first (longes
1620 doSignal(Node first) argument
1633 doSignalAll(Node first) argument
[all...]
H A DAbstractQueuedSynchronizer.java21 * first-in-first-out (FIFO) wait queues. This class is designed to
121 * <em>unblock the first queued thread</em>;
294 * first in the queue. But being first does not guarantee success;
343 * is constructed and head and tail pointers are set upon first
383 * first indicate they need a signal,
1182 * Implemented by first checking interrupt status, then invoking
1204 * and failing if the given timeout elapses. Implemented by first
1249 * first invokin
1848 doSignal(Node first) argument
1861 doSignalAll(Node first) argument
[all...]

Completed in 286 milliseconds

12