- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 69 for visited (0.27 sec)
-
android/guava/src/com/google/common/reflect/TypeVisitor.java
abstract class TypeVisitor { private final Set<Type> visited = Sets.newHashSet(); /** * Visits the given types. Null types are ignored. This allows subclasses to call {@code * visit(parameterizedType.getOwnerType())} safely without having to check nulls. */ public final void visit(@Nullable Type... types) { for (Type type : types) { if (type == null || !visited.add(type)) { // null owner type, or already visited;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Apr 16 21:10:04 GMT 2021 - 3.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* <li>While traversing, the traverser will use <i>O(n)</i> space (where <i>n</i> is the number * of nodes that have thus far been visited), plus <i>O(H)</i> space (where <i>H</i> is the * number of nodes that have been seen but not yet visited, that is, the "horizon"). * </ul> * * @param graph {@link SuccessorsFunction} representing a general graph that may have cycles. */
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) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
* * Visited Nodes = {} * EndpointPair [N1, N2] - return * EndpointPair [N1, N3] - return * Visited Nodes = {N1} * EndpointPair [N2, N1] - skip * EndpointPair [N2, N3] - return * Visited Nodes = {N1, N2} * EndpointPair [N3, N1] - skip * EndpointPair [N3, N2] - skip * Visited Nodes = {N1, N2, N3} * EndpointPair [N4, N4] - return * Visited Nodes = {N1, N2, N3, N4}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/reflect/TypeVisitorTest.java
visit(t.getActualTypeArguments()); } @Override void visitTypeVariable(TypeVariable<?> t) { visit(t.getBounds()); } }.visit(type); } private static void assertVisited(Type type) { TypeVisitor visitor = new BaseTypeVisitor(); try { visitor.visit(type); fail("Type not visited");
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/reflect/TypeVisitorTest.java
visit(t.getActualTypeArguments()); } @Override void visitTypeVariable(TypeVariable<?> t) { visit(t.getBounds()); } }.visit(type); } private static void assertVisited(Type type) { TypeVisitor visitor = new BaseTypeVisitor(); try { visitor.visit(type); fail("Type not visited");
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
return true; } return hasCycle(network.asGraph()); } /** * Performs a traversal of the nodes reachable from {@code node}. If we ever reach a node we've * already visited (following only outgoing edges and without reusing edges), we know there's a * cycle in the graph. */ private static <N> boolean subgraphHasCycle( Graph<N> graph,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractScheduledService.java
* class CrawlingService extends AbstractScheduledService { * private Set<Uri> visited; * private Queue<Uri> toCrawl; * protected void startUp() throws Exception { * toCrawl = readStartingUris(); * } * * protected void runOneIteration() throws Exception { * Uri uri = toCrawl.remove(); * Collection<Uri> newUris = crawl(uri); * visited.add(uri); * for (Uri newUri : newUris) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Dec 13 19:45:20 GMT 2023 - 25.8K bytes - Viewed (0) -
.github/ISSUE_TEMPLATE/feature_addition_request.yaml
[Guava's philosophy](https://github.com/google/guava/wiki/PhilosophyExplained), and I strongly believe that this proposal aligns with it. required: true - label: > I have visited the [idea graveyard](https://github.com/google/guava/wiki/IdeaGraveyard), and did not see anything similar to this idea.
Others - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Nov 17 18:47:47 GMT 2023 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
private int indexToRemove = ABSENT; private int expectedModCount = biMap.modCount; // Calls to setValue on inverse entries can move already-visited entries to the end. // Make sure we don't visit those. private int remaining = biMap.size; private void checkForComodification() { if (biMap.modCount != expectedModCount) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/ClassPath.java
* @param packagePrefix resource path prefix inside {@code classloader} for any files found * under {@code directory} * @param currentPath canonical files already visited in the current directory tree path, for * cycle elimination */ private void scanDirectory( File directory, String packagePrefix, Set<File> currentPath,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 05 17:43:40 GMT 2022 - 24.9K bytes - Viewed (1)