- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 371 for Insert (0.24 sec)
-
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* of this queue less the current {@code size} of this queue. * * <p>Note that you cannot always tell if an attempt to insert an element will succeed by * inspecting {@code remainingCapacity} because it may be the case that another thread is about to * insert or remove an element. */ @CanIgnoreReturnValue @Override public int remainingCapacity() { final Monitor monitor = this.monitor;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
numInsertions, 0.03, BloomFilterStrategies.MURMUR128_MITZ_32); // Insert "numInsertions" even numbers into the BF. for (int i = 0; i < numInsertions * 2; i += 2) { bf.put(Integer.toString(i)); } assertApproximateElementCountGuess(bf, numInsertions); // Assert that the BF "might" have all of the even numbers. for (int i = 0; i < numInsertions * 2; i += 2) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* of this queue less the current {@code size} of this queue. * * <p>Note that you cannot always tell if an attempt to insert an element will succeed by * inspecting {@code remainingCapacity} because it may be the case that another thread is about to * insert or remove an element. */ @CanIgnoreReturnValue @Override public int remainingCapacity() { final Monitor monitor = this.monitor;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeMap.java
throw new IllegalArgumentException( "Cannot insert range " + range + " into an empty subRangeMap"); } @Override public void putCoalescing(Range<Comparable<?>> range, Object value) { checkNotNull(range); throw new IllegalArgumentException( "Cannot insert range " + range + " into an empty subRangeMap"); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 21.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/UninterruptiblesTest.java
private static final class TimedTakeQueue { final BlockingQueue<String> queue; final Completion completed; /** * Creates a {@link EnableReads} which insert an element for a {@code take} to receive in {@code * countdownInMillis}. */ static TimedTakeQueue createWithDelay(long countdownInMillis) { return new TimedTakeQueue(countdownInMillis); }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Feb 09 22:57:07 GMT 2022 - 31.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
if (oldEntryForKey != null) { delete(oldEntryForKey); insert(newEntry, oldEntryForKey); oldEntryForKey.prevInKeyInsertionOrder = null; oldEntryForKey.nextInKeyInsertionOrder = null; return oldEntryForKey.value; } else { insert(newEntry, null); rehashIfNecessary(); return null; } } @CanIgnoreReturnValue
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/src/com/google/common/collect/CompactLinkedHashMap.java
} @Override void accessEntry(int index) { if (accessOrder) { // delete from previous position... setSucceeds(getPredecessor(index), getSuccessor(index)); // ...and insert at the end. setSucceeds(lastEntry, index); setSucceeds(index, ENDPOINT); incrementModCount(); } } @Override void moveLastEntry(int dstIndex, int mask) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* use a secondary key to break ties in primary priority values. For example, here is a class that * applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a * {@code new FIFOEntry(anEntry)} instead of a plain entry object. * * <pre> * class FIFOEntry<E extends Comparable<? super E>> * implements Comparable<FIFOEntry<E>> {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/UninterruptiblesTest.java
private static final class TimedTakeQueue { final BlockingQueue<String> queue; final Completion completed; /** * Creates a {@link EnableReads} which insert an element for a {@code take} to receive in {@code * countdownInMillis}. */ static TimedTakeQueue createWithDelay(long countdownInMillis) { return new TimedTakeQueue(countdownInMillis); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 09 22:57:07 GMT 2022 - 30.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
numInsertions, 0.03, BloomFilterStrategies.MURMUR128_MITZ_32); // Insert "numInsertions" even numbers into the BF. for (int i = 0; i < numInsertions * 2; i += 2) { bf.put(Integer.toString(i)); } assertApproximateElementCountGuess(bf, numInsertions); // Assert that the BF "might" have all of the even numbers. for (int i = 0; i < numInsertions * 2; i += 2) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0)