- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 60 for halt (0.13 sec)
-
android/guava-tests/test/com/google/common/collect/ImmutableMapTest.java
Builder<Integer, String> builder = ImmutableMap.builder(); Map<Integer, String> expected = new LinkedHashMap<>(); for (int i = 0; i < 1000; i++) { // Truncate to even key, so we have put(0, "0") then put(0, "1"). Half the entries are // duplicates. Integer key = i & ~1; String value = String.valueOf(i); builder.put(key, value); expected.put(key, value); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 14:39:16 GMT 2024 - 37.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableIntArrayTest.java
} /* * Whenever an implementation uses `instanceof` on a parameter instance, the test has to know that * (so much for "black box") and try instances that both do and don't pass the check. The "don't" * half of that is more awkward to arrange... */ private static <T> Iterable<T> iterable(final Collection<T> collection) { // return collection::iterator; return new Iterable<T>() { @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
* most key spaces are ANYTHING BUT uniformly distributed. A bit(i) in the input is said to * 'affect' a bit(j) in the output if two inputs, identical but for bit(i), will differ at output * bit(j) about half the time * * <p>Funneling is pretty simple to detect. The key idea is to find example keys which * unequivocally demonstrate that funneling cannot be occurring. This is done bit-by-bit. For each
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
*/ double fractionOfBitsSet = (double) bitCount / bitSize; return DoubleMath.roundToLong( -Math.log1p(-fractionOfBitsSet) * bitSize / numHashFunctions, RoundingMode.HALF_UP); } /** Returns the number of bits in the underlying bit array. */ @VisibleForTesting long bitSize() { return bits.bitSize(); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/ToDoubleRounder.java
checkNotNull(mode, "mode"); double roundArbitrarily = roundToDoubleArbitrarily(x); if (Double.isInfinite(roundArbitrarily)) { switch (mode) { case DOWN: case HALF_EVEN: case HALF_DOWN: case HALF_UP: return Double.MAX_VALUE * sign(x); case FLOOR: return (roundArbitrarily == Double.POSITIVE_INFINITY) ? Double.MAX_VALUE
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 5.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/MoreExecutorsTest.java
for (Thread hook : hooks) { hook.start(); } for (Thread hook : hooks) { hook.join(); } } } /* Half of a 1-second timeout in nanoseconds */ private static final long HALF_SECOND_NANOS = NANOSECONDS.convert(1L, SECONDS) / 2; public void testShutdownAndAwaitTermination_immediateShutdown() throws Exception {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 28.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
/** * Benchmarks for the rounding methods of {@code LongMath}. * * @author Louis Wasserman */ public class LongMathRoundingBenchmark { @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"}) RoundingMode mode; private static final long[] positive = new long[ARRAY_SIZE]; private static final long[] nonzero = new long[ARRAY_SIZE]; private static final long[] longs = new long[ARRAY_SIZE];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
private static final BigInteger[] nonzero2 = new BigInteger[ARRAY_SIZE]; private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE]; @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"}) RoundingMode mode; @BeforeExperiment void setUp() { for (int i = 0; i < ARRAY_SIZE; i++) { positive[i] = randomPositiveBigInteger(1024);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 30 13:06:20 GMT 2020 - 2.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
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) -
guava-tests/benchmark/com/google/common/math/DoubleMathRoundingBenchmark.java
private static final double[] doubleInLongRange = new double[ARRAY_SIZE]; private static final double[] positiveDoubles = new double[ARRAY_SIZE]; @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"}) RoundingMode mode; @BeforeExperiment void setUp() { for (int i = 0; i < ARRAY_SIZE; i++) { doubleInIntRange[i] = randomDouble(Integer.SIZE - 2);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0)