- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 64 for sesd (0.13 sec)
-
android/guava/src/com/google/common/hash/Hashing.java
hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128; int seed = GOOD_FAST_HASH_SEED; for (int i = 1; i < hashFunctionsNeeded; i++) { seed += 1500450271; // a prime; shouldn't matter hashFunctions[i] = murmur3_128(seed); } return new ConcatenatedHashFunction(hashFunctions); } /**
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) -
guava-tests/benchmark/com/google/common/hash/MessageDigestAlgorithmBenchmark.java
return hashFn; } } // 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) {
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) -
guava-tests/test/com/google/common/io/SourceSinkTester.java
+ "aliquet pulvinar. Nam lorem nunc, ultrices at auctor non, scelerisque eget turpis. " + "Nullam eget varius erat. Sed a lorem id arcu dictum euismod. Fusce lectus odio, " + "elementum ullamcorper mattis viverra, dictum sit amet lacus.\n" + "\n" + "Nunc quis lacus est. Sed aliquam pretium cursus. Sed eu libero eros. In hac habitasse "
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Apr 27 18:57:08 GMT 2022 - 4.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
public void undirectedGraph() { testGraphMutation(GraphBuilder.undirected()); } private static void testGraphMutation(GraphBuilder<? super Integer> graphBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedIntsTest.java
assertThat(b).isEqualTo(0); } } } } @GwtIncompatible // Too slow in GWT (~3min fully optimized) public void testDivideRemainderEuclideanProperty() { // Use a seed so that the test is deterministic: Random r = new Random(0L); for (int i = 0; i < 1000000; i++) { int dividend = r.nextInt(); int divisor = r.nextInt();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 12.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* * <pre>{@code * final RateLimiter rateLimiter = RateLimiter.create(5000.0); // rate = 5000 permits per second * void submitPacket(byte[] packet) { * rateLimiter.acquire(packet.length); * networkService.send(packet); * } * }</pre> * * <p>It is important to note that the number of permits requested <i>never</i> affects the * throttling of the request itself (an invocation to {@code acquire(1)} and an invocation to {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
private final String toString; protected Stimulus(String toString) { this.toString = toString; } /** * Send this stimulus to both iterators and return normally only if both produce the same * response. */ abstract void executeAndCompare(ListIterator<E> reference, T target); @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* randomly ordered data (the probability decreases faster than exponentially in N), but if you are * passing in unsanitized user data then a malicious user could force it. A light shuffle of the * data using an unpredictable seed should normally be enough to thwart this attack. * * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
it was very provoking to find that the hedgehog had unrolled itself, and was in the act of crawling away: besides all this, there was generally a ridge or furrow in the way wherever she wanted to send the hedgehog to, and, as the doubled-up soldiers were always getting up and walking off to other parts of the ground, Alice soon came to the conclusion that it was a very difficult game indeed.
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
long seed = insertRandomly(elements, q); while (!q.isEmpty()) { elements.add(0, q.pollLast()); } assertEqualsUsingSeed(seed, expected, elements); } } public void testCorrectOrdering_randomAccess() { long seed = new Random().nextLong(); Random random = new Random(seed); PriorityQueue<Integer> control = new PriorityQueue<>();
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)