- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 55 for exact (0.17 sec)
-
guava-tests/benchmark/com/google/common/collect/MapBenchmark.java
} }; abstract Map<Element, Element> create(Collection<Element> contents); } @Param({"5", "50", "500", "5000", "50000"}) private int size; // TODO: look at exact (==) hits vs. equals() hits? @Param("0.9") private double hitRate; @Param("true") private boolean isUserTypeFast; // "" means no fixed seed @Param("") private SpecialRandom random;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 7.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
if (dividend >= 0) { return dividend / divisor; } /* * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is * guaranteed to be either exact or one less than the correct value. This follows from fact that * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite * trivial. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 17.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
* <li>If {@code x} is positive or negative zero, the result is negative infinity. * </ul> * * <p>The computed result is within 1 ulp of the exact result. * * <p>If the result of this method will be immediately rounded to an {@code int}, {@link * #log2(double, RoundingMode)} is faster. */ public static double log2(double x) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* multiset itself). * * <p>Despite the method name, this method attempts to avoid actually copying the data when it is * safe to do so. The exact circumstances under which a copy will or will not be performed are * undocumented and subject to change. * * <p>This method is not type-safe, as it may be called on elements that are not mutually * comparable.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 35.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableTable.java
* {@link Builder#putAll} * * <p>Despite the method name, this method attempts to avoid actually copying the data when it is * safe to do so. The exact circumstances under which a copy will or will not be performed are * undocumented and subject to change. */ public static <R, C, V> ImmutableTable<R, C, V> copyOf(
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 17.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/SetContainsBenchmark.java
// yet visit a variety of "values-relative-to-the-next-power-of-2" @Param({"5", "30", "180", "1100", "6900", "43000", "260000"}) // "1600000", "9800000" private int size; // TODO(kevinb): look at exact (==) hits vs. equals() hits? @Param({"0.2", "0.8"}) private double hitRate; @Param("true") private boolean isUserTypeFast; // "" means no fixed seed @Param("") private SpecialRandom random;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/SetContainsBenchmark.java
// yet visit a variety of "values-relative-to-the-next-power-of-2" @Param({"5", "30", "180", "1100", "6900", "43000", "260000"}) // "1600000", "9800000" private int size; // TODO(kevinb): look at exact (==) hits vs. equals() hits? @Param({"0.2", "0.8"}) private double hitRate; @Param("true") private boolean isUserTypeFast; // "" means no fixed seed @Param("") private SpecialRandom random;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp">32-bit murmur3 * algorithm, x86 variant</a> (little-endian variant), using the given seed value. * * <p>The exact C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A). * * <p>This method is called {@code murmur3_32_fixed} because it fixes a bug in the {@code * HashFunction} returned by the original {@code murmur3_32} method.
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
* containing one element (the given set itself). * * <p>Despite the method name, this method attempts to avoid actually copying the data when it is * safe to do so. The exact circumstances under which a copy will or will not be performed are * undocumented and subject to change. * * <p>This method is not type-safe, as it may be called on elements that are not mutually * comparable.
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/primitives/ImmutableIntArray.java
* * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number * of values that will be added, if that knowledge is readily available. It is better to guess a * value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableIntArray} that is built will very likely occupy more memory than strictly necessary;
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)