- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 20 for SIZED (0.02 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/collect/Streams.java
// TODO(lowasser): consider an implementation that can support SUBSIZED boolean isParallel = false; int characteristics = Spliterator.ORDERED | Spliterator.SIZED | Spliterator.NONNULL; long estimatedSize = 0L; ImmutableList.Builder<Spliterator<? extends T>> splitrsBuilder = new ImmutableList.Builder<>(streams.length); for (Stream<? extends T> stream : streams) {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 21 15:40:45 GMT 2025 - 36.8K bytes - Click Count (0) -
internal/bpool/bpool.go
type BytePoolCap struct { c chan []byte w int wcap int } // NewBytePoolCap creates a new BytePool bounded to the given maxSize, with new // byte arrays sized based on width. func NewBytePoolCap(maxSize uint64, width int, capwidth int) (bp *BytePoolCap) { if capwidth <= 0 { panic("total buffer capacity must be provided") } if capwidth < 64 {Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 3K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
long[] array = stream.toArray(); return (array.length == 0) ? EMPTY : new ImmutableLongArray(array); } /** * Returns a new, empty builder for {@link ImmutableLongArray} instances, sized to hold up to * {@code initialCapacity} values without resizing. The returned builder is not thread-safe. * * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Dec 12 14:49:24 GMT 2025 - 22K bytes - Click Count (0) -
guava/src/com/google/common/primitives/ImmutableIntArray.java
int[] array = stream.toArray(); return (array.length == 0) ? EMPTY : new ImmutableIntArray(array); } /** * Returns a new, empty builder for {@link ImmutableIntArray} instances, sized to hold up to * {@code initialCapacity} values without resizing. The returned builder is not thread-safe. * * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Dec 12 14:49:24 GMT 2025 - 21.5K bytes - Click Count (0) -
guava-testlib/src/com/google/common/collect/testing/SpliteratorTester.java
comparator = naturalOrder; } assertTrue(Ordering.from(comparator).isOrdered(resultsForStrategy)); } if ((characteristics & Spliterator.SIZED) != 0) { assertEquals(Ints.checkedCast(estimatedSize), resultsForStrategy.size()); } assertEqualIgnoringOrder(elements, resultsForStrategy);Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 15:50:50 GMT 2025 - 12.1K bytes - Click Count (0) -
android/guava-testlib/src/com/google/common/collect/testing/SpliteratorTester.java
comparator = naturalOrder; } assertTrue(Ordering.from(comparator).isOrdered(resultsForStrategy)); } if ((characteristics & Spliterator.SIZED) != 0) { assertEquals(Ints.checkedCast(estimatedSize), resultsForStrategy.size()); } assertEqualIgnoringOrder(elements, resultsForStrategy);Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 15:50:50 GMT 2025 - 12.5K bytes - Click Count (0) -
guava/src/com/google/common/collect/AbstractMapBasedMultimap.java
} }; } @Override Spliterator<V> valueSpliterator() { return CollectSpliterators.flatMap( map.values().spliterator(), Collection::spliterator, Spliterator.SIZED, size()); } /* * TODO(kevinb): should we copy this javadoc to each concrete class, so that * classes like LinkedHashMultimap that need to say something different areCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Nov 17 22:50:48 GMT 2025 - 48.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
* f(x)^c with greater than expected probability. The test for funneling is merely a test for * 1-bit characteristics. * * <p>There is more general code provided by Bob Jenkins to test arbitrarily sized characteristics * using the magic of gaussian elimination: http://burtleburtle.net/bob/crypto/findingc.html. */ static void checkNo2BitCharacteristics(HashFunction function) { Random rand = new Random(0);
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 25.6K bytes - Click Count (0) -
src/bytes/buffer.go
// Simple byte buffer for marshaling data. import ( "errors" "io" "unicode/utf8" ) // smallBufferSize is an initial allocation minimal capacity. const smallBufferSize = 64 // A Buffer is a variable-sized buffer of bytes with [Buffer.Read] and [Buffer.Write] methods. // The zero value for Buffer is an empty buffer ready to use. type Buffer struct { buf []byte // contents are the bytes buf[off : len(buf)]
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Nov 14 19:01:17 GMT 2025 - 16.5K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/rank/fusion/RankFusionProcessor.java
* Adds the searcher to the searchers list and initializes the executor service * if it hasn't been created yet. The executor service is created with a thread pool * sized based on configuration or system capabilities. * * @param searcher the RankFusionSearcher to register */ public void register(final RankFusionSearcher searcher) { if (logger.isDebugEnabled()) {Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Fri Nov 28 16:29:12 GMT 2025 - 27.5K bytes - Click Count (0)