- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 388 for random (0.1 sec)
-
guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java
@BeforeExperiment void setUp() { Random random = new Random(randomSeed); xInts = new int[SAMPLE_SIZE]; yInts = new int[SAMPLE_SIZE]; xLongs = new long[SAMPLE_SIZE]; yLongs = new long[SAMPLE_SIZE]; constant = new int[SAMPLE_SIZE]; for (int i = 0; i < SAMPLE_SIZE; i++) { xInts[i] = random.nextInt(Integer.MAX_VALUE); yInts[i] = random.nextInt(Integer.MAX_VALUE);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/AsciiBenchmark.java
@Param({"20", "2000"}) int size; @Param({"2", "20"}) int nonAlphaRatio; // one non-alpha char per this many chars @Param boolean noWorkToDo; Random random; String testString; @BeforeExperiment void setUp() { random = new Random(0xdeadbeef); // fix the seed so results are comparable across runs int nonAlpha = size / nonAlphaRatio; int alpha = size - nonAlpha;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.8K bytes - Viewed (0) -
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++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Feb 26 19:18:53 UTC 2019 - 4.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
return new String(result); } private static String newTestString(Random random, BitSet bitSet, int percentMatching) { final String allMatchingChars = allMatchingChars(bitSet); final char[] result = new char[STRING_LENGTH]; // Fill with matching chars. for (int i = 0; i < result.length; i++) { result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length())); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed May 16 22:49:59 UTC 2018 - 3.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
return new String(result); } private static String newTestString(Random random, BitSet bitSet, int percentMatching) { final String allMatchingChars = allMatchingChars(bitSet); final char[] result = new char[STRING_LENGTH]; // Fill with matching chars. for (int i = 0; i < result.length; i++) { result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length())); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed May 16 22:49:59 UTC 2018 - 3.9K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/ws/WebSocketWriterTest.kt
private val serverWriter = WebSocketWriter( isClient = false, sink = data, random = random, perMessageDeflate = false, noContextTakeover = false, minimumDeflateSize = 0L, ) private val clientWriter = WebSocketWriter( isClient = true, sink = data, random = random, perMessageDeflate = false, noContextTakeover = false, minimumDeflateSize = 0L,
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 9.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/io/CharStreamsCopyBenchmark.java
public void setUp() { // precalculate some random strings of ascii characters. StringBuilder sb = new StringBuilder(); Random random = new Random(0xdeadbeef); // for unpredictable but reproducible behavior sb.ensureCapacity(size); for (int k = 0; k < size; k++) { // [9-127) includes all ascii non-control characters sb.append((char) (random.nextInt(127 - 9) + 9)); } data = sb.toString(); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Feb 23 18:59:54 UTC 2023 - 3.2K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/io/CharStreamsCopyBenchmark.java
public void setUp() { // precalculate some random strings of ascii characters. StringBuilder sb = new StringBuilder(); Random random = new Random(0xdeadbeef); // for unpredictable but reproducible behavior sb.ensureCapacity(size); for (int k = 0; k < size; k++) { // [9-127) includes all ascii non-control characters sb.append((char) (random.nextInt(127 - 9) + 9)); } data = sb.toString(); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Feb 23 18:59:54 UTC 2023 - 3.2K bytes - Viewed (0) -
cmd/erasure-common.go
}() } wg.Wait() return newDisks } func (er erasureObjects) getOnlineLocalDisks() (newDisks []StorageAPI) { disks := er.getOnlineDisks() // Based on the random shuffling return back randomized disks. r := rand.New(rand.NewSource(time.Now().UnixNano())) for _, i := range r.Perm(len(disks)) { if disks[i] != nil && disks[i].IsLocal() { newDisks = append(newDisks, disks[i]) } }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Aug 12 08:38:15 UTC 2024 - 2.3K bytes - Viewed (0) -
internal/crypto/key.go
// (crypto/rand) is used. func GenerateIV(random io.Reader) (iv [32]byte) { if random == nil { random = rand.Reader } if _, err := io.ReadFull(random, iv[:]); err != nil { logger.CriticalIf(context.Background(), errOutOfEntropy) } return iv } // SealedKey represents a sealed object key. It can be stored // at an untrusted location. type SealedKey struct { Key [64]byte // The encrypted and authenticated object-key.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Mar 19 20:28:10 UTC 2024 - 6.4K bytes - Viewed (0)