- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 180 for tree (0.78 sec)
-
android/guava/src/com/google/common/graph/Traverser.java
public static <N> Traverser<N> forTree(SuccessorsFunction<N> tree) { if (tree instanceof BaseGraph) { checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees."); } if (tree instanceof Network) { checkArgument(((Network<?, ?>) tree).isDirected(), "Undirected networks can never be trees."); } return new Traverser<N>(tree) { @Override Traversal<N> newTraversal() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Traverser.java
public static <N> Traverser<N> forTree(SuccessorsFunction<N> tree) { if (tree instanceof BaseGraph) { checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees."); } if (tree instanceof Network) { checkArgument(((Network<?, ?>) tree).isDirected(), "Undirected networks can never be trees."); } return new Traverser<N>(tree) { @Override Traversal<N> newTraversal() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultimapNaturalTest.java
*/ public void testCreateFromTreeMultimap() { Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR); tree.put(1.0, 2.0); tree.put(2.0, 3.0); tree.put(3.0, 4.0); tree.put(4.0, 5.0); TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree); assertEquals(tree, copyFromTree); assertSame(Ordering.natural(), copyFromTree.keyComparator());
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Mar 07 18:34:03 UTC 2024 - 22.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
/** * A tree-shaped graph that looks as follows (all edges are directed facing downwards): * * <pre>{@code * h * /|\ * / | \ * / | \ * d e g * /|\ | * / | \ | * a b c f * }</pre> */ private static final SuccessorsFunction<Character> TREE =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
/** * A tree-shaped graph that looks as follows (all edges are directed facing downwards): * * <pre>{@code * h * /|\ * / | \ * / | \ * d e g * /|\ | * / | \ | * a b c f * }</pre> */ private static final SuccessorsFunction<Character> TREE =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Files.java
/** * Returns a {@link Traverser} instance for the file and directory tree. The returned traverser * starts from a {@link File} and will return all files and directories it encounters. * * <p><b>Warning:</b> {@code File} provides no support for symbolic links, and as such there is no * way to ensure that a symbolic link to a directory is not followed when traversing the tree. In
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 33.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 34.2K bytes - Viewed (0) -
android/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("_");
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 17.4K bytes - Viewed (0) -
android/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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 24K bytes - Viewed (0) -
guava/src/com/google/common/io/Files.java
/** * Returns a {@link Traverser} instance for the file and directory tree. The returned traverser * starts from a {@link File} and will return all files and directories it encounters. * * <p><b>Warning:</b> {@code File} provides no support for symbolic links, and as such there is no * way to ensure that a symbolic link to a directory is not followed when traversing the tree. In
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 33.1K bytes - Viewed (0)