- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 40 for enid (0.12 sec)
-
guava/src/com/google/common/collect/DiscreteDomain.java
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * link(), which is defined at the end of this file. */ private int getPredecessor(int entry) { return ((int) (link(entry) >>> 32)) - 1; } @Override int getSuccessor(int entry) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
private static String badPositionIndexes(int start, int end, int size) { if (start < 0 || start > size) { return badPositionIndex(start, size, "start index"); } if (end < 0 || end > size) { return badPositionIndex(end, size, "end index"); } // end < start return lenientFormat("end index (%s) must not be less than start index (%s)", end, start); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
private Comparators() {} /** * Returns a new comparator which sorts iterables by comparing corresponding elements pairwise * until a nonzero result is found; imposes "dictionary order." If the end of one iterable is * reached, but not the other, the shorter iterable is considered to be less than the longer one. * For example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
@ParametricNullness private final K key; @VisibleForTesting @Nullable ValueEntry<K, V>[] hashTable; private int size = 0; private int modCount = 0; // We use the set object itself as the end of the linked list, avoiding an unnecessary // entry object per key. private ValueSetLink<K, V> firstEntry; private ValueSetLink<K, V> lastEntry; ValueSet(@ParametricNullness K key, int expectedValues) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
// * Everything with (to <= index < from) should be removed. // * The element with (index == from) should be kept. // * Everything with (index > from) has not been checked yet. // Check from the end of the list backwards (minimize expected cost of // moving elements when remove() is called). Stop before 'from' because // we already know that should be kept. for (int n = list.size() - 1; n > from; n--) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
if (!executed) { runnables = new RunnableExecutorPair(runnable, executor, runnables); return; } } // Execute the runnable immediately. Because of scheduling this may end up getting called before // some of the previously added runnables, but we're OK with that. If we want to change the // contract to guarantee ordering among runnables we'd have to modify the logic here to allow // it.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
mmHeap.addAll(Lists.newArrayList(1, 2)); Iterator<Integer> it = mmHeap.iterator(); assertTrue("Iterator has reached end prematurely", it.hasNext()); it.next(); it.next(); try { it.next(); fail("No exception thrown when iterating past end of heap"); } catch (NoSuchElementException expected) { } } public void testIteratorConcurrentModification() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsTest.java
assertEquals("3", iterator.next()); assertEquals("4", iterator.next()); assertEquals(4, iterator.nextIndex()); try { iterator.next(); fail("did not detect end of list"); } catch (NoSuchElementException expected) { } assertEquals(3, iterator.previousIndex()); assertEquals("4", iterator.previous()); assertEquals("3", iterator.previous());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
android/guava/src/com/google/common/io/BaseEncoding.java
// multiple of 8. A multiple of 8 has 3 low zero bits, so we just need to figure out how many // extra zero bits we need to add to the end of bitsPerChar to get 3 in total. // The logic here would be wrong for bitsPerChar > 8, but since we require distinct ASCII // characters that can't happen.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Mar 15 16:33:32 GMT 2024 - 41.7K bytes - Viewed (0)