Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 128 for trees (0.03 sec)

  1. android/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];
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 26 19:18:53 UTC 2019
    - 4.9K bytes
    - Viewed (0)
  2. 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];
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 26 19:18:53 UTC 2019
    - 4.9K bytes
    - Viewed (0)
  3. api/maven-api-core/src/main/java/org/apache/maven/api/NodeVisitor.java

    import org.apache.maven.api.annotations.Consumer;
    import org.apache.maven.api.annotations.Experimental;
    import org.apache.maven.api.annotations.Nonnull;
    
    /**
     * Defines a hierarchical visitor for collecting dependency node trees.
     *
     * @since 4.0.0
     */
    @Experimental
    @Consumer
    public interface NodeVisitor {
        /**
         * Starts the visit to the specified dependency node.
         *
         * @param node the dependency node to visit
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Thu Mar 23 05:29:39 UTC 2023
    - 1.8K bytes
    - Viewed (0)
  4. android/guava/javadoc-link/checker-framework/package-list

    org.checkerframework.framework.util.typeinference.constraint
    org.checkerframework.framework.util.typeinference.solver
    org.checkerframework.javacutil
    org.checkerframework.javacutil.dist
    org.checkerframework.javacutil.trees
    org.eclipse.jdt.annotation
    org.eclipse.jgit.annotations
    org.jetbrains.annotations
    org.jmlspecs.annotation
    org.netbeans.api.annotations.common
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Dec 07 19:00:31 UTC 2017
    - 3.8K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/dependencies/sub-dependencies.md

    Just functions that look the same as the *path operation functions*.
    
    But still, it is very powerful, and allows you to declare arbitrarily deeply nested dependency "graphs" (trees).
    
    /// tip
    
    All this might not seem as useful with these simple examples.
    
    But you will see how useful it is in the chapters about **security**.
    
    And you will also see the amounts of code it will save you.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 5.5K bytes
    - Viewed (0)
  6. guava/javadoc-link/checker-framework/package-list

    org.checkerframework.framework.util.typeinference.constraint
    org.checkerframework.framework.util.typeinference.solver
    org.checkerframework.javacutil
    org.checkerframework.javacutil.dist
    org.checkerframework.javacutil.trees
    org.eclipse.jdt.annotation
    org.eclipse.jgit.annotations
    org.jetbrains.annotations
    org.jmlspecs.annotation
    org.netbeans.api.annotations.common
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Dec 07 19:00:31 UTC 2017
    - 3.8K bytes
    - Viewed (0)
  7. guava/src/com/google/common/collect/TreeTraverser.java

    import java.util.Queue;
    import java.util.function.Consumer;
    import javax.annotation.CheckForNull;
    
    /**
     * Views elements of a type {@code T} as nodes in a tree, and provides methods to traverse the trees
     * induced by this traverser.
     *
     * <p>For example, the tree
     *
     * <pre>{@code
     *        h
     *      / | \
     *     /  e  \
     *    d       g
     *   /|\      |
     *  / | \     f
     * a  b  c
     * }</pre>
     *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  8. docs/fr/docs/help-fastapi.md

    Vous pouvez :
    
    * <a href="https://github.com/tiangolo" class="external-link" target="_blank">Me suivre sur **GitHub**</a>.
        * Voir d'autres projets Open Source que j'ai créés et qui pourraient vous aider.
        * Suivez-moi pour voir quand je crée un nouveau projet Open Source.
    * <a href="https://twitter.com/tiangolo" class="external-link" target="_blank">Me suivre sur **Twitter**</a>.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Mon Jul 29 23:35:07 UTC 2024
    - 5.7K bytes
    - Viewed (0)
  9. 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();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  10. 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) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 3.6K bytes
    - Viewed (0)
Back to top