- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 126 for trees (0.16 sec)
-
src/main/java/jcifs/smb1/smb1/SmbSession.java
this.localPort = localPort; this.auth = auth; trees = new Vector(); connectionState = 0; } synchronized SmbTree getSmbTree( String share, String service ) { SmbTree t; if( share == null ) { share = "IPC$"; } for( Enumeration e = trees.elements(); e.hasMoreElements(); ) { t = (SmbTree)e.nextElement();
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 18.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
Iterable<Character> result = Traverser.forGraph(TWO_TREES).depthFirstPreOrder('a'); assertEqualCharNodes(result, "ab"); } @Test public void forGraph_depthFirstPreOrderIterable_twoTrees() { assertEqualCharNodes(Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("a")), "ab"); assertEqualCharNodes( Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("ac")), "abcd"); }
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
} 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];
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) -
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) -
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
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Mar 23 05:29:39 GMT 2023 - 1.8K bytes - Viewed (0) -
src/test/java/jcifs/tests/FileOperationsTest.java
f.createNewFile(); boolean renamed = false; try { f.renameTo(tgt, true); Assert.assertFalse("Should not be able to rename between trees", true); } catch ( SmbUnsupportedOperationException e ) { try ( SmbTreeHandle th = defaultShareRoot.getTreeHandle() ) { Assume.assumeTrue("Not SMB2", th.isSMB2());
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Thu Jan 05 13:17:59 GMT 2023 - 16.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
Iterable<Character> result = Traverser.forGraph(TWO_TREES).depthFirstPreOrder('a'); assertEqualCharNodes(result, "ab"); } @Test public void forGraph_depthFirstPreOrderIterable_twoTrees() { assertEqualCharNodes(Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("a")), "ab"); assertEqualCharNodes( Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("ac")), "abcd"); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
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];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbSessionImpl.java
share = "IPC$"; } synchronized ( this.trees ) { for ( SmbTreeImpl t : this.trees ) { if ( t.matches(share, service) ) { return t.acquire(); } } SmbTreeImpl t = new SmbTreeImpl(this, share, service); t.acquire(); this.trees.add(t); return t; } }
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Nov 14 17:41:04 GMT 2021 - 49K bytes - Viewed (0) -
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)