Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 4,583 for tree (0.14 sec)

  1. android/guava/src/com/google/common/collect/TreeTraverser.java

    import java.util.Deque;
    import java.util.Iterator;
    import java.util.Queue;
    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>
     *
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 8.2K bytes
    - Viewed (0)
  2. maven-core/src/test/resources/apiv4-repo/org/hamcrest/hamcrest-core/1.3/hamcrest-core-1.3-javadoc.jar

    Overview Package Class Use Tree Deprecated Index Help PREV NEXT FRAMES NO FRAMES All Classes Uses of Class org.hamcrest.core.Every No usage of org.hamcrest.core.Every Overview Package Class Use Tree Deprecated Index Help PREV NEXT FRAMES NO FRAMES All Classes org/hamcrest/core/class-use/Is.html Overview Package Class Use Tree Deprecated Index Help PREV NEXT FRAMES NO FRAMES All Classes Uses of Class org.hamcrest.core.Is No usage of org.hamcrest.core.Is Overview Package Class Use Tree Deprecated Index Help...
    Archive
    - Registered: Sun Apr 14 03:35:08 GMT 2024
    - Last Modified: Sun Oct 02 08:41:25 GMT 2022
    - 236.8K bytes
    - Viewed (0)
  3. 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() {
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Tue May 30 20:12:45 GMT 2023
    - 19.8K bytes
    - Viewed (0)
  4. common/scripts/report_build_info.sh

      if [[ -z "${IGNORE_DIRTY_TREE}" ]] && [[ -n "$(git status --porcelain 2>/dev/null)" ]]; then
        BUILD_GIT_REVISION=${BUILD_GIT_REVISION}"-dirty"
      fi
    else
      BUILD_GIT_REVISION=unknown
    fi
    
    # Check for local changes
    tree_status="Clean"
    if [[ -z "${IGNORE_DIRTY_TREE}" ]] && ! git diff-index --quiet HEAD --; then
      tree_status="Modified"
    fi
    
    GIT_DESCRIBE_TAG=$(git describe --tags --always)
    Shell Script
    - Registered: Wed May 08 22:53:08 GMT 2024
    - Last Modified: Tue May 23 17:08:31 GMT 2023
    - 1.9K bytes
    - Viewed (0)
  5. maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java

        /**
         * construct graph from a "dirty" tree
         */
        public MetadataGraph(MetadataTreeNode tree) throws MetadataResolutionException {
            this(tree, false, false);
        }
        // ------------------------------------------------------------------------
        /**
         * construct graph from a "dirty" tree
         *
         * @param tree "dirty" tree root
    Java
    - Registered: Sun May 05 03:35:11 GMT 2024
    - Last Modified: Thu Oct 05 18:41:13 GMT 2023
    - 13.1K bytes
    - Viewed (0)
  6. 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)
  7. src/main/java/jcifs/smb1/smb1/SmbFile.java

            if( isOpen() ) {
                return;
            }
            fid = open0( flags, access, attrs, options );
            opened = true;
            tree_num = tree.tree_num;
        }
        boolean isOpen() {
            boolean ans = opened && isConnected() && tree_num == tree.tree_num;
            return ans;
        }
        void close( int f, long lastWriteTime ) throws SmbException {
    
            if( log.level >= 3 )
    Java
    - Registered: Sun May 05 00:10:10 GMT 2024
    - Last Modified: Mon Mar 13 12:00:57 GMT 2023
    - 107.9K bytes
    - Viewed (2)
  8. src/test/java/jcifs/tests/OplockTests.java

                            if ( resp2 != null && !trans.isDisconnected() ) {
                                tree.send(new SmbComClose(sess.getConfig(), resp2.getFid(), 0L));
                            }
                        }
                    }
                    finally {
                        if ( resp != null && !trans.isDisconnected() ) {
                            tree.send(new SmbComClose(sess.getConfig(), resp.getFid(), 0L));
                        }
    Java
    - Registered: Sun May 05 00:10:10 GMT 2024
    - Last Modified: Thu Jan 05 13:09:03 GMT 2023
    - 6.1K bytes
    - Viewed (0)
  9. 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());
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Thu Mar 07 18:34:03 GMT 2024
    - 22.6K bytes
    - Viewed (0)
  10. architecture/build-state-model.md

      
      session["build session"]
      process --> session
      
      build_tree["build tree"]
      session --> build_tree
      
      build1["root build"]
      build_tree --> build1
      
      project1["root project"]
      build1 --> project1
      
      project2["project"]
      build1 --> project2
      
      build2["included build"]
      build_tree --> build2
      
      project3["root project"]
      build2 --> project3
      
    Plain Text
    - Registered: Wed May 08 11:36:15 GMT 2024
    - Last Modified: Sun May 05 22:45:11 GMT 2024
    - 3.4K bytes
    - Viewed (0)
Back to top