- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 374 for insert (0.19 sec)
-
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) -
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) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
if (high < low) { break; // Pointers crossed. Partitioning complete. } swap(array, low, high); // End of innermost loop. } array[from + 1] = array[high]; // Insert partitioning element. array[high] = partition; // Continue the partition that contains the kth element. if (high >= k) { to = high - 1; } if (high <= k) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
if (high < low) { break; // Pointers crossed. Partitioning complete. } swap(array, low, high); // End of innermost loop. } array[from + 1] = array[high]; // Insert partitioning element. array[high] = partition; // Continue the partition that contains the kth element. if (high >= k) { to = high - 1; } if (high <= k) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/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 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.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) -
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/src/com/google/common/base/Strings.java
* @param minLength the minimum length the resulting string must have. Can be zero or negative, in * which case the input string is always returned. * @param padChar the character to insert at the beginning of the result until the minimum length * is reached * @return the padded string */ public static String padStart(String string, int minLength, char padChar) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Sep 17 20:47:03 GMT 2021 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeMap.java
* for {@code asMapOfRanges().iterator().remove()}. * * <p>The returned range map will throw an {@link IllegalArgumentException} on an attempt to * insert a range not {@linkplain Range#encloses(Range) enclosed} by {@code range}. */ // TODO(cpovirk): Consider documenting that IAE on the various methods that can throw it. RangeMap<K, V> subRangeMap(Range<K> range);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 6.5K bytes - Viewed (0) -
android/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 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0)