- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 143 for detected (0.2 sec)
-
android/guava/src/com/google/common/collect/HashBiMap.java
} else { checkArgument(keyEntry == ABSENT, "Key already present: %s", key); } // insertion point for new entry is after predecessor // note predecessor must still be a valid entry: either we deleted an entry that was *not* // predecessor, or we didn't delete anything ensureCapacity(size + 1); keys[size] = key; values[size] = value; insertIntoTableKToV(size, keyHash);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SequentialExecutor.java
} oldRunCount = workerRunCount; // If the worker is not yet running, the delegate Executor might reject our attempt to start // it. To preserve FIFO order and failure atomicity of rejected execution when the same // Runnable is executed more than once, allocate a wrapper that we know is safe to remove by // object identity.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
for (AvlNode<E> current = header.succ(); current != header; ) { AvlNode<E> next = current.succ(); current.elemCount = 0; // Also clear these fields so that one deleted Entry doesn't retain all elements. current.left = null; current.right = null; current.pred = null; current.succ = null; current = next; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
return key; } else if (oldEntryForKey != null && !force) { throw new IllegalArgumentException("key already present: " + key); } /* * The ordering here is important: if we deleted the key entry and then the value entry, * the key entry's prev or next pointer might point to the dead value entry, and when we * put the new entry in the key entry's position in iteration order, it might invalidate
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0) -
guava-testlib/test/com/google/common/testing/NullPointerTesterTest.java
(NullRejectingFromTo<?, ?>) getDefaultParameterValue(0); assertNotNull(defaultFunction); try { defaultFunction.apply(null); fail("Proxy Should have rejected null"); } catch (NullPointerException expected) { } } } public void testNullRejectingInterfaceDefaultValue() { new NullRejectingInterfaceDefaultValueChecker().check(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 16 15:12:31 GMT 2023 - 47.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* collections intelligently fall back to a binary search tree if hash table collisions are * detected. Rather than going to all the trouble of reimplementing this ourselves, we * simply switch over to use the JDK implementation wholesale if probable hash flooding is * detected, sacrificing the compactness guarantee in very rare cases in exchange for much * more reliable worst-case behavior.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
to be a letter, written by the prisoner to--to somebody.' `It must have been that,' said the King, `unless it was written to nobody, which isn't usual, you know.' `Who is it directed to?' said one of the jurymen. `It isn't directed at all,' said the White Rabbit; `in fact, there's nothing written on the OUTSIDE.' He unfolded the paper as he spoke, and added `It isn't a letter, after all: it's a set of verses.'
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
unlock(); postWriteCleanup(); } if (createNewEntry) { try { // Synchronizes on the entry to allow failing fast when a recursive load is // detected. This may be circumvented when an entry is copied, but will fail fast most // of the time. synchronized (e) { return loadSync(key, hash, loadingValueReference, loader); }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
// Node order tests @Test public void nodeOrder_none() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(unordered()).build(); assertThat(graph.nodeOrder()).isEqualTo(unordered()); } @Test public void nodeOrder_insertion() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
case DIRECTED: return GraphBuilder.directed().allowsSelfLoops(true).build(); default: throw new IllegalStateException("Unexpected edge type: " + edgeType); } } private static EdgeType oppositeType(EdgeType edgeType) { switch (edgeType) { case UNDIRECTED: return EdgeType.DIRECTED; case DIRECTED: return EdgeType.UNDIRECTED;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0)