- Sort Score
- Result 10 results
- Languages All
Results 11 - 18 of 18 for Shuffle (0.15 sec)
-
android/guava-tests/test/com/google/common/hash/HashingTest.java
for (int i = 0; i < 10; i++) { hashCodes.add(HashCode.fromLong(random.nextLong())); } HashCode hashCode1 = Hashing.combineOrdered(hashCodes); Collections.shuffle(hashCodes, random); HashCode hashCode2 = Hashing.combineOrdered(hashCodes); assertFalse(hashCode1.equals(hashCode2)); } public void testCombineUnordered_empty() { assertThrows(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
for (int attempts = 0; attempts < reduceIterationsIfGwt(1000); attempts++) { ArrayList<Integer> elements = createOrderedList(10); Collections.shuffle(elements, random); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(elements); Collections.shuffle(elements, random); for (Integer element : elements) { assertThat(queue.remove(element)).isTrue(); assertIntact(queue);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/EnumsBenchmark.java
misses.add("INVALID"); } List<String> sampleDataList = new ArrayList<>(); sampleDataList.addAll(hits); sampleDataList.addAll(misses); Collections.shuffle(sampleDataList); sampleData = sampleDataList.toArray(new String[sampleDataList.size()]); } // Since we can't pass a concrete SomeEnum.class directly, we need to use a raw type. @SuppressWarnings("unchecked")
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 29.4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/EnumsBenchmark.java
misses.add("INVALID"); } List<String> sampleDataList = new ArrayList<>(); sampleDataList.addAll(hits); sampleDataList.addAll(misses); Collections.shuffle(sampleDataList); sampleData = sampleDataList.toArray(new String[sampleDataList.size()]); } // Since we can't pass a concrete SomeEnum.class directly, we need to use a raw type. @SuppressWarnings("unchecked")
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 29.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
.inOrder(); } /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(1, 2); // Duplicate
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
EndpointPair.ordered(1, 2)) .inOrder(); } /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateStarShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(5, 1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
EndpointPair.ordered(1, 2)) .inOrder(); } /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateStarShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(5, 1);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
.inOrder(); } /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(1, 2); // Duplicate
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0)