- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 175 for prie (0.12 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */
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) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashSet}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */ @GwtIncompatible // not worth using in GWT for now
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/src/com/google/common/collect/DiscreteDomain.java
* #minValue} and {@link #maxValue} should also be overridden for bounded types. * * <p>A discrete domain always represents the <i>entire</i> set of values of its type; it cannot * represent partial domains such as "prime integers" or "strings of length 5." * * <p>See the Guava User Guide section on <a href= * "https://github.com/google/guava/wiki/RangesExplained#discrete-domains">{@code * DiscreteDomain}</a>. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
*/ public List<Integer> asList() { /* * Typically we cache this kind of thing, but much repeated use of this view is a performance * anti-pattern anyway. If we cache, then everyone pays a price in memory footprint even if * they never use this method. */ return new AsList(this); } static class AsList extends AbstractList<Integer> implements RandomAccess, Serializable {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
*/ public List<Double> asList() { /* * Typically we cache this kind of thing, but much repeated use of this view is a performance * anti-pattern anyway. If we cache, then everyone pays a price in memory footprint even if * they never use this method. */ return new AsList(this); } static class AsList extends AbstractList<Double> implements RandomAccess, Serializable {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* m}, which might be negative. * * <p>For example: * * <pre>{@code * mod(7, 4) == 3 * mod(-7, 4) == 1 * mod(-1, 4) == 3 * mod(-8, 4) == 0 * mod(8, 4) == 0 * }</pre> * * @throws ArithmeticException if {@code m <= 0} * @see <a href="http://docs.oracle.com/javase/specs/jls/se7/html/jls-15.html#jls-15.17.3">
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128; int seed = GOOD_FAST_HASH_SEED; for (int i = 1; i < hashFunctionsNeeded; i++) { seed += 1500450271; // a prime; shouldn't matter hashFunctions[i] = murmur3_128(seed); } return new ConcatenatedHashFunction(hashFunctions); } /**
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-tests/test/com/google/common/math/MathTesting.java
// Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31). intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE); // Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); } // Now add values near 2^N for lots of values of N. for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/ByteStreamsTest.java
InputStream in = new ByteArrayInputStream(PRE_FILLED_100); byte[] b = ByteStreams.toByteArray(in, 100); assertThat(b).isEqualTo(PRE_FILLED_100); } public void testToByteArray_withSize_givenSmallerSize() throws IOException { InputStream in = new ByteArrayInputStream(PRE_FILLED_100); byte[] b = ByteStreams.toByteArray(in, 80); assertThat(b).isEqualTo(PRE_FILLED_100); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.9K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/TrieParser.java
return builder.buildOrThrow(); } /** * Parses a trie node and returns the number of characters consumed. * * @param stack The prefixes that precede the characters represented by this node. Each entry of * the stack is in reverse order. * @param encoded The serialized trie. * @param start An index in the encoded serialized trie to begin reading characters from.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Oct 13 19:20:43 GMT 2022 - 4K bytes - Viewed (0)