- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 34 for Retrieve (0.15 sec)
-
guava/src/com/google/common/collect/AbstractIndexedListIterator.java
* That is, the first call to {@link #nextIndex()} will return {@code position}, and the first * call to {@link #next()} will return the element at that index, if available. Calls to {@link * #previous()} can retrieve the preceding {@code position} elements. * * @throws IndexOutOfBoundsException if {@code position} is negative or is greater than {@code * size} * @throws IllegalArgumentException if {@code size} is negative
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 3.2K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
* * <ul> * <li>{@code getStackTrace} takes {@code stackSize} time to return but then negligible time to * retrieve each element of the returned list. * <li>{@code lazyStackTrace} takes negligible time to return but then {@code 1/stackSize} time * to retrieve each element of the returned list (probably slightly more than {@code * 1/stackSize}). * </ul> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
* * <ul> * <li>{@code getStackTrace} takes {@code stackSize} time to return but then negligible time to * retrieve each element of the returned list. * <li>{@code lazyStackTrace} takes negligible time to return but then {@code 1/stackSize} time * to retrieve each element of the returned list (probably slightly more than {@code * 1/stackSize}). * </ul> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractIndexedListIterator.java
* That is, the first call to {@link #nextIndex()} will return {@code position}, and the first * call to {@link #next()} will return the element at that index, if available. Calls to {@link * #previous()} can retrieve the preceding {@code position} elements. * * @throws IndexOutOfBoundsException if {@code position} is negative or is greater than {@code * size} * @throws IllegalArgumentException if {@code size} is negative
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Uninterruptibles.java
} } } /** * Invokes {@code future.}{@link Future#get() get()} uninterruptibly. * * <p>Similar methods: * * <ul> * <li>To retrieve a result from a {@code Future} that is already done, use {@link * Futures#getDone Futures.getDone}. * <li>To treat {@link InterruptedException} uniformly with other exceptions, use {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 14.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/AbstractSequentialIteratorTest.java
} } public void testBroken() { Iterator<Object> broken = new BrokenAbstractSequentialIterator(); assertTrue(broken.hasNext()); // We can't retrieve even the known first element: try { broken.next(); fail(); } catch (MyException expected) { } try { broken.next(); fail(); } catch (MyException expected) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 17:19:08 GMT 2024 - 4.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/AbstractSequentialIteratorTest.java
} } public void testBroken() { Iterator<Object> broken = new BrokenAbstractSequentialIterator(); assertTrue(broken.hasNext()); // We can't retrieve even the known first element: try { broken.next(); fail(); } catch (MyException expected) { } try { broken.next(); fail(); } catch (MyException expected) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 26 17:19:08 GMT 2024 - 4.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractMapBasedMultiset.java
} @Override public Iterator<E> iterator() { return new MapBasedMultisetIterator(); } /* * Not subclassing AbstractMultiset$MultisetIterator because next() needs to * retrieve the Map.Entry<E, Count> entry, which can then be used for * a more efficient remove() call. */ private class MapBasedMultisetIterator implements Iterator<E> { final Iterator<Map.Entry<E, Count>> entryIterator;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 10.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractIterator.java
* such as {@link java.io.Reader#read()}, do not expose this information; the only way to discover * whether there is any data left is by trying to retrieve it. These types of data sources are * ordinarily difficult to write iterators for. But using this class, one must implement only the * {@link #computeNext} method, and invoke the {@link #endOfData} method when appropriate. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Mar 18 02:04:10 GMT 2022 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
* Ordering#natural()} is returned. * * @deprecated Store the {@link Comparator} alongside the {@link Table}. Or, if you know that the * {@link Table} contains at least one value, you can retrieve the {@link Comparator} with: * {@code ((SortedMap<C, V>) table.rowMap().values().iterator().next()).comparator();}. */ @Deprecated public Comparator<? super C> columnComparator() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 11.4K bytes - Viewed (0)