- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 458 for Tandon (0.21 sec)
-
guava-tests/benchmark/com/google/common/hash/HashFunctionBenchmark.java
// Use a statically configured random instance for all of the benchmarks private static final Random random = new Random(42); @Param({"10", "1000", "100000", "1000000"}) private int size; @Param HashFunctionEnum hashFunctionEnum; private byte[] testBytes; @BeforeExperiment void setUp() { testBytes = new byte[size]; random.nextBytes(testBytes); } @Benchmark
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.3K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/http2/HuffmanTest.kt
val s = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" for (i in s.indices) { assertRoundTrip(s.substring(0, i).encodeUtf8()) } val random = Random(123456789L) val buf = ByteArray(4096) random.nextBytes(buf) assertRoundTrip(buf.toByteString()) } private fun assertRoundTrip(data: ByteString) { val encodeBuffer = Buffer() encode(data, encodeBuffer)
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Thu Jan 04 05:32:07 GMT 2024 - 1.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
} return root; } }, RANDOM { /** * Generates a tree with topology selected uniformly at random from the topologies of binary * trees of the specified size. */ @Override Optional<BinaryNode> createTree(int size, Random rng) { int[] keys = new int[size]; for (int i = 0; i < size; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
long seed = new Random().nextLong(); Random random = new Random(seed); insertRandomly(elements, q, random); return seed; } private static void insertRandomly( ArrayList<Integer> elements, MinMaxPriorityQueue<Integer> q, Random random) { while (!elements.isEmpty()) { int selectedIndex = random.nextInt(elements.size());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/InternersBenchmark.java
for (int i = 0; i < reps; i++) { String unused = interner.intern(Double.toHexString(Math.random())); } return reps; } @Benchmark int strongInterner(int reps) { Interner<String> interner = Interners.newStrongInterner(); for (int i = 0; i < reps; i++) { String unused = interner.intern(Double.toHexString(Math.random())); } return reps; } @Benchmark int stringIntern(int reps) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Mar 04 04:06:35 GMT 2022 - 1.4K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/plugins/gcs/gcs_filesystem_test.cc
if (TF_GetCode(status) != TF_OK) { TF_DeleteStatus(status); return ""; } TF_DeleteStatus(status); // We add a random value into `test_dir` to ensures that two consecutive // runs are unlikely to clash. std::random_device rd; std::mt19937 gen(rd()); std::uniform_int_distribution<> distribution; std::string rng_val = std::to_string(distribution(gen));
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Mon Aug 31 12:04:23 GMT 2020 - 24.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java
nonnegative[i] = randomNonNegativeBigInteger(Long.SIZE - 1).longValue(); longs[i] = RANDOM_SOURCE.nextLong(); factorialArguments[i] = RANDOM_SOURCE.nextInt(30); binomialArguments[i][1] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials.length); int k = binomialArguments[i][1]; binomialArguments[i][0] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials[k] - k) + k; } } @Benchmark
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java
} } private static class MutateTask implements Callable<int[]> { private final ConcurrentHashMultiset<String> multiset; private final ImmutableList<String> keys; private final Random random = new Random(); private MutateTask(ConcurrentHashMultiset<String> multiset, ImmutableList<String> keys) { this.multiset = multiset; this.keys = keys; } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/HashMultisetAddPresentBenchmark.java
int[] queries = new int[ARRAY_SIZE]; @BeforeExperiment void setUp() { Random random = new Random(); multisets.clear(); for (int i = 0; i < ARRAY_SIZE; i++) { HashMultiset<Integer> multiset = HashMultiset.<Integer>create(); multisets.add(multiset); queries[i] = random.nextInt(); multiset.add(queries[i]); } } @Benchmark int add(int reps) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 1.6K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
// tweak this to control hit rate @Param("2.5") double concentration; Random random = new Random(); LoadingCache<Integer, Integer> cache; int max; static AtomicLong requests = new AtomicLong(0); static AtomicLong misses = new AtomicLong(0); @BeforeExperiment void setUp() { // random integers will be generated in this range, then raised to the
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0)