- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for Clarke (0.25 sec)
-
android/guava/src/com/google/common/hash/Hashing.java
* for {@code minimumBits}, will return identically-behaving {@link HashFunction} instances. * * @param minimumBits a positive integer. This can be arbitrarily large. The returned {@link * HashFunction} instance may use memory proportional to this integer. * @return a hash function, described above, that produces hash codes of length {@code * minimumBits} or greater */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
} } Arrays.fill(contents, uniques, n, null); if (uniques < contents.length / 2) { // Deduplication eliminated many of the elements. We don't want to retain an arbitrarily // large array relative to the number of elements, so we cap the ratio. contents = Arrays.copyOf(contents, uniques); } return new RegularImmutableSortedSet<E>(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* if/throw idiom instead. * * <p>Depending on your message arguments, memory may be allocated for boxing and varargs array * creation. However, the methods of this class have a large number of overloads that prevent such * allocations in many common cases. * * <p>The message string is not formatted unless the exception will be thrown, so the cost of the * string formatting itself should not be a concern.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
*/ abstract SetBuilderImpl<E> copy(); /** * Call this before build(). Does a final check on the internal data structures, e.g. shrinking * unnecessarily large structures or detecting previously unnoticed hash flooding. */ SetBuilderImpl<E> review() { return this; } abstract ImmutableSet<E> build(); }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableRangeSet.java
* ranges {@code [3..3)} and {@code [4..4)}. * * <p><b>Warning:</b> Be extremely careful what you do with the {@code asSet} view of a large * range set (such as {@code ImmutableRangeSet.of(Range.greaterThan(0))}). Certain operations on * such a set can be performed efficiently, but others (such as {@link Set#hashCode} or {@link
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 26.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
* ranges {@code [3..3)} and {@code [4..4)}. * * <p><b>Warning:</b> Be extremely careful what you do with the {@code asSet} view of a large * range set (such as {@code ImmutableRangeSet.of(Range.greaterThan(0))}). Certain operations on * such a set can be performed efficiently, but others (such as {@link Set#hashCode} or {@link
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/StreamsTest.java
} public void testFindLast_refStream() { assertThat(findLast(Stream.of())).isEmpty(); assertThat(findLast(Stream.of("a", "b", "c", "d"))).hasValue("d"); // test with a large, not-subsized Spliterator List<Integer> list = IntStream.rangeClosed(0, 10000).boxed().collect(Collectors.toCollection(LinkedList::new)); assertThat(findLast(list.stream())).hasValue(10000);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
checkNotNull(iterator); checkNonnegative(k, "k"); if (k == 0 || !iterator.hasNext()) { return Collections.emptyList(); } else if (k >= Integer.MAX_VALUE / 2) { // k is really large; just do a straightforward sorted-copy-and-sublist ArrayList<E> list = Lists.newArrayList(iterator); Collections.sort(list, this); if (list.size() > k) { list.subList(k, list.size()).clear();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
tableSize <<= 1; } return tableSize; } // The table can't be completely full or we'll get infinite reprobes checkArgument(setSize < MAX_TABLE_SIZE, "collection too large"); return MAX_TABLE_SIZE; } /** * Returns an immutable set containing each of {@code elements}, minus duplicates, in the order * each appears first in the source collection. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
// path when the first operation on the new map is putAll(otherMap). There, prior to // https://github.com/openjdk/jdk/commit/3e393047e12147a81e2899784b943923fc34da8e, a bug // meant that sometimes a too-large threshold is calculated. However, this new threshold is // independent of the initial capacity, except that it won't be lower than the threshold
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0)