- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 153 for Slough (0.14 sec)
-
guava/src/com/google/common/collect/CompactLinkedHashSet.java
} /** * Creates a {@code CompactLinkedHashSet} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactLinkedHashSet} with enough capacity to hold {@code * expectedSize} elements without resizing
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* test. This must return an Iterator that returns the expected elements passed to the constructor * in the given order. Warning: it is not enough to simply pull multiple iterators from the same * source Iterable, unless that Iterator is unmodifiable. */ protected abstract I newTargetIterator(); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/FileBackedOutputStreamAndroidIncompatibleTest.java
import java.io.File; /** * Android-incompatible tests for {@link FileBackedOutputStream}. * * @author Chris Nokleberg */ @AndroidIncompatible // Finalization probably just doesn't happen fast enough? public class FileBackedOutputStreamAndroidIncompatibleTest extends IoTestCase { public void testFinalizeDeletesFile() throws Exception { byte[] data = newPreFilledByteArray(100);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 08 21:20:23 GMT 2023 - 1.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
} /** * Creates a {@code CompactLinkedHashMap} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactLinkedHashMap} with enough capacity to hold {@code * expectedSize} elements without resizing
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/collect/LinkedHashMultimap.java
LinkedHashMultimap<K, V> create() { return new LinkedHashMultimap<>(DEFAULT_KEY_CAPACITY, DEFAULT_VALUE_SET_CAPACITY); } /** * Constructs an empty {@code LinkedHashMultimap} with enough capacity to hold the specified * numbers of keys and values without rehashing. * * @param expectedKeys the expected number of distinct keys * @param expectedValuesPerKey the expected average number of values per key
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/LinkedListMultimap.java
LinkedListMultimap<K, V> create() { return new LinkedListMultimap<>(); } /** * Constructs an empty {@code LinkedListMultimap} with enough capacity to hold the specified * number of keys without rehashing. * * @param expectedKeys the expected number of distinct keys * @throws IllegalArgumentException if {@code expectedKeys} is negative */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/JdkBackedImmutableMap.java
/** * Creates an {@code ImmutableMap} backed by a JDK HashMap. Used when probable hash flooding is * detected. This implementation may replace the entries in entryArray with its own entry objects * (though they will have the same key/value contents), and will take ownership of entryArray. */ static <K, V> ImmutableMap<K, V> create( int n, @Nullable Entry<K, V>[] entryArray, boolean throwIfDuplicateKeys) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 4.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/FileBackedOutputStreamTest.java
ByteSource source = out.asByteSource(); int chunk1 = Math.min(dataSize, fileThreshold); int chunk2 = dataSize - chunk1; // Write just enough to not trip the threshold if (chunk1 > 0) { write(out, data, 0, chunk1, singleByte); assertTrue(ByteSource.wrap(data).slice(0, chunk1).contentEquals(source)); } File file = out.getFile();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 5.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/ByteSourceTester.java
* slice()} views in the same way. * * @author Colin Decker */ @AndroidIncompatible // TODO(b/230620681): Make this available (even though we won't run it). public class ByteSourceTester extends SourceSinkTester<ByteSource, byte[], ByteSourceFactory> { private static final ImmutableList<Method> testMethods = getTestMethods(ByteSourceTester.class);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* save that if that location is already full, we try the next index, and the next, until we * find an empty table position. Since the table has a power-of-two size, we use * & (table.length - 1) instead of % table.length, though. */ @CheckForNull private final transient Object hashTable; @VisibleForTesting final transient @Nullable Object[] alternatingKeysAndValues; private final transient int size; /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0)