- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 458 for Tandon (0.43 sec)
-
guava-tests/benchmark/com/google/common/collect/MultipleSetContainsBenchmark.java
@BeforeExperiment void setUp() { if (emptySetProportion + singletonSetProportion > 1.01) { throw new SkipThisScenarioException(); } Random rng = new Random(); for (int i = 0; i < 0x1000; i++) { double setSize = rng.nextDouble(); if (setSize < emptySetProportion) { sets[i] = ImmutableSet.of();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 2.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
private static final int NUM_PUTS = 100_000; private static final ThreadLocal<Random> random = new ThreadLocal<Random>() { @Override protected Random initialValue() { return new Random(); } }; private static final int GOLDEN_PRESENT_KEY = random.get().nextInt(); @AndroidIncompatible // OutOfMemoryError
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/MessageDigestAlgorithmBenchmark.java
} } // Use a constant seed for all of the benchmarks to ensure apples to apples comparisons. private static final int RANDOM_SEED = new Random().nextInt(); private byte[] testBytes; @BeforeExperiment void setUp() { testBytes = new byte[size]; new Random(RANDOM_SEED).nextBytes(testBytes); } @Benchmark byte hashing(int reps) { byte result = 0x01;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K 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) -
tensorflow/c/experimental/filesystem/plugins/posix/posix_filesystem.cc
TF_SetFilesystemVersionMetadata(ops); ops->scheme = strdup(uri); ops->random_access_file_ops = static_cast<TF_RandomAccessFileOps*>( plugin_memory_allocate(TF_RANDOM_ACCESS_FILE_OPS_SIZE)); ops->random_access_file_ops->cleanup = tf_random_access_file::Cleanup; ops->random_access_file_ops->read = tf_random_access_file::Read; ops->writable_file_ops = static_cast<TF_WritableFileOps*>(
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Sun Mar 24 20:08:23 GMT 2024 - 15.8K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/modular_filesystem_registration.cc
TF_RETURN_IF_ERROR( CheckABI(ops->filesystem_ops_abi, TF_FILESYSTEM_OPS_ABI, "filesystem")); if (ops->random_access_file_ops != nullptr) TF_RETURN_IF_ERROR(CheckABI(ops->random_access_file_ops_abi, TF_RANDOM_ACCESS_FILE_OPS_ABI, "random access file")); if (ops->writable_file_ops != nullptr) TF_RETURN_IF_ERROR(CheckABI(ops->writable_file_ops_abi,
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Mar 07 22:08:43 GMT 2023 - 12.8K bytes - Viewed (0) -
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) -
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/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/math/QuantilesAlgorithmTest.java
import java.util.Map; import java.util.Random; import java.util.Set; import junit.framework.TestCase; /** * Tests that the different algorithms benchmarked in {@link QuantilesBenchmark} are actually all * returning more-or-less the same answers. */ public class QuantilesAlgorithmTest extends TestCase { private static final Random RNG = new Random(82674067L); private static final int DATASET_SIZE = 1000;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0)