- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 30 for rmtree (0.25 sec)
-
guava-tests/benchmark/com/google/common/collect/MapBenchmark.java
} }, SyncHM { @Override Map<Element, Element> create(Collection<Element> keys) { return Collections.synchronizedMap(Hash.create(keys)); } }, Tree { @Override Map<Element, Element> create(Collection<Element> keys) { Map<Element, Element> map = Maps.newTreeMap(); for (Element element : keys) { map.put(element, element); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 7.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/AbstractPackageSanityTests.java
* {@link #ignoreClasses} to exclude generated classes, such as the {@code AutoValue_Foo} classes * generated by <a href="https://github.com/google/auto/tree/master/value">AutoValue</a>. * * @since 19.0 */ public static final Predicate<Class<?>> UNDERSCORE_IN_NAME = (Class<?> c) -> c.getSimpleName().contains("_");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri May 12 19:22:18 GMT 2023 - 17.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* </ul> * <li>another java.util.Set delegate implementation. In most modern JDKs, normal java.util hash * collections intelligently fall back to a binary search tree if hash table collisions are * detected. Rather than going to all the trouble of reimplementing this ourselves, we * simply switch over to use the JDK implementation wholesale if probable hash flooding is
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* </ul> * <li>another java.util.Map delegate implementation. In most modern JDKs, normal java.util hash * collections intelligently fall back to a binary search tree if hash table collisions are * detected. Rather than going to all the trouble of reimplementing this ourselves, we * simply switch over to use the JDK implementation wholesale if probable hash flooding is
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeTraverserTest.java
static final Tree c = new Tree('c'); static final Tree d = new Tree('d', a, b, c); static final Tree e = new Tree('e'); static final Tree f = new Tree('f'); static final Tree g = new Tree('g', f); static final Tree h = new Tree('h', d, e, g); static String iterationOrder(Iterable<? extends Node> iterable) { StringBuilder builder = new StringBuilder(); for (Node t : iterable) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 3.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultimapExplicitTest.java
tree.put("tree", 3); assertThat(tree.keySet()).containsExactly("tree", "google").inOrder(); assertThat(tree.get("google")).containsExactly(6, 2).inOrder(); TreeMultimap<String, Integer> copy = TreeMultimap.create(tree); assertEquals(tree, copy); assertThat(copy.keySet()).containsExactly("google", "tree").inOrder(); assertThat(copy.get("google")).containsExactly(2, 6).inOrder();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 8.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
@Test public void forGraph_breadthFirst_tree() throws Exception { Traverser<Character> traverser = Traverser.forGraph(TREE); assertEqualCharNodes(traverser.breadthFirst('h'), "hdegabcf"); assertEqualCharNodes(traverser.breadthFirst('d'), "dabc"); assertEqualCharNodes(traverser.breadthFirst('a'), "a"); } @Test public void forGraph_breadthFirstIterable_tree() throws Exception {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
root = Optional.of(new BinaryNode(rng.nextInt(), Optional.<BinaryNode>absent(), root)); } 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) {
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/io/testdata/alice_in_wonderland.txt
day! Why, I haven't had a wink of sleep these three weeks!' `I'm very sorry you've been annoyed,' said Alice, who was beginning to see its meaning. `And just as I'd taken the highest tree in the wood,' continued the Pigeon, raising its voice to a shriek, `and just as I was thinking I should be free of them at last, they must needs come wriggling down from the sky! Ugh, Serpent!'
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) -
android/guava/src/com/google/common/collect/TreeMultiset.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0)