Home
last modified time | relevance | path

Searched refs:first (Results 1 – 25 of 44) sorted by relevance

12

/libcore/luni/src/main/java/java/util/concurrent/
DDelayQueue.java160 E first = q.peek(); in poll() local
161 if (first == null || first.getDelay(NANOSECONDS) > 0) in poll()
182 E first = q.peek(); in take() local
183 if (first == null) in take()
186 long delay = first.getDelay(NANOSECONDS); in take()
226 E first = q.peek(); in poll() local
227 if (first == null) { in poll()
233 long delay = first.getDelay(NANOSECONDS); in poll()
296 E first = q.peek(); in peekExpired() local
297 return (first == null || first.getDelay(NANOSECONDS) > 0) ? in peekExpired()
[all …]
DScheduledThreadPoolExecutor.java1035 RunnableScheduledFuture<?> first = queue[0]; in poll() local
1036 if (first == null || first.getDelay(NANOSECONDS) > 0) in poll()
1039 return finishPoll(first); in poll()
1050 RunnableScheduledFuture<?> first = queue[0]; in take() local
1051 if (first == null) in take()
1054 long delay = first.getDelay(NANOSECONDS); in take()
1056 return finishPoll(first); in take()
1085 RunnableScheduledFuture<?> first = queue[0]; in poll() local
1086 if (first == null) { in poll()
1092 long delay = first.getDelay(NANOSECONDS); in poll()
[all …]
DLinkedBlockingDeque.java110 transient Node<E> first; field in LinkedBlockingDeque
189 Node<E> f = first; in linkFirst()
191 first = node; in linkFirst()
211 if (first == null) in linkLast()
212 first = node; in linkLast()
225 Node<E> f = first; in unlinkFirst()
232 first = n; in unlinkFirst()
256 first = null; in unlinkLast()
538 return (first == null) ? null : first.item; in peekFirst()
559 for (Node<E> p = first; p != null; p = p.next) { in removeFirstOccurrence()
[all …]
DConcurrentLinkedQueue.java376 Node<E> first() { in first() method in ConcurrentLinkedQueue
399 return first() == null; in isEmpty()
420 for (Node<E> p = first(); p != null; p = succ(p)) in size()
438 for (Node<E> p = first(); p != null; p = succ(p)) { in contains()
460 for (Node<E> p = first(); p != null; p = succ(p)) { in remove()
554 for (Node<E> p = first(); p != null; p = succ(p)) { in toArray()
602 for (p = first(); p != null && k < a.length; p = succ(p)) { in toArray()
615 for (Node<E> q = first(); q != null; q = succ(q)) { in toArray()
673 p = first(); in advance()
733 for (Node<E> p = first(); p != null; p = succ(p)) { in writeObject()
DConcurrentLinkedDeque.java506 private void unlinkFirst(Node<E> first, Node<E> next) { in unlinkFirst() argument
512 if (o != null && p.prev != p && first.casNext(next, p)) { in unlinkFirst()
514 if (first.prev == null && in unlinkFirst()
516 p.prev == first) { in unlinkFirst()
701 return (p == q) ? first() : q; in succ()
720 Node<E> first() { in first() method in ConcurrentLinkedDeque
797 for (Node<E> p = first(); p != null; p = succ(p)) { in toArrayList()
908 for (Node<E> p = first(); p != null; p = succ(p)) { in peekFirst()
940 for (Node<E> p = first(); p != null; p = succ(p)) { in pollFirst()
1018 for (Node<E> p = first(); p != null; p = succ(p)) { in removeFirstOccurrence()
[all …]
DLinkedBlockingQueue.java182 Node<E> first = h.next; in dequeue() local
184 head = first; in dequeue()
185 E x = first.item; in dequeue()
186 first.item = null; in dequeue()
481 Node<E> first = head.next; in peek() local
482 if (first == null) in peek()
485 return first.item; in peek()
DConcurrentHashMap.java340 HashEntry<K,V> first = entryAt(tab, index); in put() local
341 for (HashEntry<K,V> e = first;;) { in put()
357 node.setNext(first); in put()
359 node = new HashEntry<K,V>(hash, key, value, first); in put()
454 HashEntry<K,V> first = entryForHash(this, hash); in scanAndLockForPut() local
455 HashEntry<K,V> e = first; in scanAndLockForPut()
476 (f = entryForHash(this, hash)) != first) { in scanAndLockForPut()
477 e = first = f; // re-traverse if entry changed in scanAndLockForPut()
493 HashEntry<K,V> first = entryForHash(this, hash); in scanAndLock() local
494 HashEntry<K,V> e = first; in scanAndLock()
[all …]
/libcore/luni/src/main/java/libcore/icu/
DICU.java69 int first = localeName.indexOf('_'); in localeFromString() local
70 int second = localeName.indexOf('_', first + 1); in localeFromString()
71 if (first == -1) { in localeFromString()
76 return new Locale(localeName.substring(0, first), localeName.substring(first + 1)); in localeFromString()
79 …return new Locale(localeName.substring(0, first), localeName.substring(first + 1, second), localeN… in localeFromString()
DNativeBreakIterator.java84 public int first() { in first() method in NativeBreakIterator
116 for (char c = newText.first(); c != CharacterIterator.DONE; c = newText.next()) { in setText()
/libcore/luni/src/main/java/java/lang/
DClassLoader.java416 Enumeration first = parent.getResources(resName); in getResources() local
419 return new TwoEnumerationsInOne(first, second); in getResources()
718 private Enumeration<URL> first; field in TwoEnumerationsInOne
722 public TwoEnumerationsInOne(Enumeration<URL> first, Enumeration<URL> second) { in TwoEnumerationsInOne() argument
723 this.first = first; in TwoEnumerationsInOne()
728 return first.hasMoreElements() || second.hasMoreElements(); in hasMoreElements()
732 if (first.hasMoreElements()) { in nextElement()
733 return first.nextElement(); in nextElement()
/libcore/luni/src/main/java/java/util/concurrent/locks/
DAbstractQueuedSynchronizer.java1848 private void doSignal(Node first) { in doSignal() argument
1850 if ( (firstWaiter = first.nextWaiter) == null) in doSignal()
1852 first.nextWaiter = null; in doSignal()
1853 } while (!transferForSignal(first) && in doSignal()
1854 (first = firstWaiter) != null); in doSignal()
1861 private void doSignalAll(Node first) { in doSignalAll() argument
1864 Node next = first.nextWaiter; in doSignalAll()
1865 first.nextWaiter = null; in doSignalAll()
1866 transferForSignal(first); in doSignalAll()
1867 first = next; in doSignalAll()
[all …]
DAbstractQueuedLongSynchronizer.java1620 private void doSignal(Node first) { in doSignal() argument
1622 if ( (firstWaiter = first.nextWaiter) == null) in doSignal()
1624 first.nextWaiter = null; in doSignal()
1625 } while (!transferForSignal(first) && in doSignal()
1626 (first = firstWaiter) != null); in doSignal()
1633 private void doSignalAll(Node first) { in doSignalAll() argument
1636 Node next = first.nextWaiter; in doSignalAll()
1637 first.nextWaiter = null; in doSignalAll()
1638 transferForSignal(first); in doSignalAll()
1639 first = next; in doSignalAll()
[all …]
/libcore/luni/src/main/java/java/text/
DCharacterIterator.java56 public char first(); in first() method
DRuleBasedBreakIterator.java38 @Override public int first() { in first() method in RuleBasedBreakIterator
39 return wrapped.first(); in first()
DBreakIterator.java407 public abstract int first(); in first() method in BreakIterator
/libcore/luni/src/main/java/java/util/
DSortedSet.java48 public E first(); in first() method
DLinkedList.java534 Link<E> first = voidLink.next; in getFirstImpl() local
535 if (first != voidLink) { in getFirstImpl()
536 return first.data; in getFirstImpl()
680 Link<E> first = voidLink.next; in removeFirstImpl() local
681 if (first != voidLink) { in removeFirstImpl()
682 Link<E> next = first.next; in removeFirstImpl()
687 return first.data; in removeFirstImpl()
907 Link<E> first = voidLink.next; in peekFirstImpl() local
908 return first == voidLink ? null : first.data; in peekFirstImpl()
DHashtable.java367 HashtableEntry<K, V> first = tab[index]; in put() local
368 for (HashtableEntry<K, V> e = first; e != null; e = e.next) { in put()
382 first = tab[index]; in put()
384 tab[index] = new HashtableEntry<K, V>(key, value, hash, first); in put()
403 HashtableEntry<K, V> first = tab[index]; in constructorPut() local
404 for (HashtableEntry<K, V> e = first; e != null; e = e.next) { in constructorPut()
412 tab[index] = new HashtableEntry<K, V>(key, value, hash, first); in constructorPut()
/libcore/luni/src/main/java/java/io/
DPipedReader.java250 boolean first = true; in read()
256 if (!first && lastWriter != null && !lastWriter.isAlive()) { in read()
259 first = false; in read()
/libcore/luni/src/test/java/libcore/java/sql/
DOldResultSetTest.java193 assertFalse(emptyTarget.first()); in testtestFirst()
194 assertTrue(target.first()); in testtestFirst()
199 target.first(); in testtestFirst()
243 target.first(); in testtestIsFirst()
325 target.first(); in testPrevious()
/libcore/luni/src/test/java/libcore/java/util/prefs/
DOldAbstractPreferencesTest.java654 AbstractPreferences first = (AbstractPreferences) pref.node("First node"); in testChildrenNames() local
658 assertEquals(0, first.childrenNames().length); in testChildrenNames()
673 first.childrenNames(); in testChildrenNames()
715 AbstractPreferences first = (AbstractPreferences) pref.node("First node"); in testNode() local
719 first.node("blabla/"); in testNode()
726 first.node("///invalid"); in testNode()
737 first.node(new String(sb)); in testNode()
741 first.node(new String(sb)); in testNode()
757 first.node(""); in testNode()
833 AbstractPreferences first = (AbstractPreferences) pref.node("First node"); in testName() local
[all …]
/libcore/json/src/main/java/org/json/
DJSONTokener.java354 int first = nextCleanInternal(); in readObject() local
355 if (first == '}') { in readObject()
357 } else if (first != -1) { in readObject()
/libcore/luni/src/test/java/libcore/java/text/
DOldAttributedStringTest.java33 buf.append(it.first()); in assertEqualString()
173 buf.append(it.first()); in test_ConstructorLjava_lang_StringLjava_util_Map()
278 public char first() { in first() method in OldAttributedStringTest.testAttributedCharacterIterator
403 assertEquals("Incorrect iteration on AttributedString", it.first(), in test_getIterator()
DBreakIteratorTest.java89 int pos = it.first(); in assertExpectedWordBoundaries()
188 … for (int index = it.first(); index != BreakIterator.DONE; index = it.next()) { in testConcurrentBreakIteratorAccess()
/libcore/luni/src/test/java/libcore/java/util/
DOldTreeSetTest.java123 ts.first() == objArray[0]); in test_first()
127 ts.first(); in test_first()

12