- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 219 for Traverser (0.14 sec)
-
platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/DependencyGraphBuilderTest.groovy
def evictedB = revision('b', '2.1') def c = revision('c') def d = revision('d') traverses root, evictedA traverses evictedA, evictedB traverses root, c doesNotResolve c, evictedB traverses root, d traverses d, selectedA traverses selectedA, selectedB when: def result = resolve() result.rethrowFailure()
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 22 19:04:04 UTC 2024 - 45.1K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
// If this configuration's version is in conflict, do not traverse. // If none of the incoming edges are transitive, remove previous state and do not traverse. // If not traversed before, simply add all selected outgoing edges (either hard or pending edges) // If traversed before: // If net exclusions for this node have not changed, ignore
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
platforms/core-configuration/file-collections/src/main/java/org/gradle/api/internal/file/collections/DirectoryFileTree.java
import java.io.File; import java.util.Set; import java.util.concurrent.atomic.AtomicBoolean; /** * Directory walker supporting {@link Spec}s for includes and excludes. * The file system is traversed in depth-first prefix order - all files in a directory will be * visited before any child directory is visited. * * A file or directory will only be visited if it matches all includes and no * excludes. */
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Feb 15 21:33:45 UTC 2024 - 6.6K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/result/DefaultResolvedComponentResult.java
} /** * A recursive function that traverses the dependency graph of a given module and acts on each node and edge encountered. * * @param start A ResolvedComponentResult node, which represents the entry point into the sub-section of the dependency * graph to be traversed * @param moduleAction an action to be performed on each node (module) in the graph
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 6.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/ast/astutil/rewrite.go
type ApplyFunc func(*Cursor) bool // Apply traverses a syntax tree recursively, starting with root, // and calling pre and post for each node as described below. // Apply returns the syntax tree, possibly modified. // // If pre is not nil, it is called for each node before the node's // children are traversed (pre-order). If pre returns false, no // children are traversed, and post is not called for that node. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 12.2K bytes - Viewed (0) -
src/cmd/vendor/github.com/ianlancetaylor/demangle/ast.go
if wantParens { ps.endScope(')') } } else { parenthesize(ps, t.Third) } } func (t *Trinary) Traverse(fn func(AST) bool) { if fn(t) { t.Op.Traverse(fn) t.First.Traverse(fn) t.Second.Traverse(fn) t.Third.Traverse(fn) } } func (t *Trinary) Copy(fn func(AST) AST, skip func(AST) bool) AST { if skip(t) { return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 105.8K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ConfigurationResolver.java
import java.util.List; public interface ConfigurationResolver { /** * Traverses enough of the graph to calculate the build dependencies of the given resolve context. All failures are packaged in the result. */ ResolverResults resolveBuildDependencies(ResolveContext configuration); /** * Traverses the full dependency graph of the given resolve context. All failures are packaged in the result. */
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jan 11 16:25:01 UTC 2024 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/FluentIterable.java
return checkNotNull(iterable); } /** * Returns a fluent iterable that combines two iterables. The returned iterable has an iterator * that traverses the elements in {@code a}, followed by the elements in {@code b}. The source * iterators are not polled until necessary. * * <p>The returned iterable's iterator supports {@code remove()} when the corresponding input
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 30 00:14:39 UTC 2024 - 35.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/FluentIterable.java
return checkNotNull(iterable); } /** * Returns a fluent iterable that combines two iterables. The returned iterable has an iterator * that traverses the elements in {@code a}, followed by the elements in {@code b}. The source * iterators are not polled until necessary. * * <p>The returned iterable's iterator supports {@code remove()} when the corresponding input
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 30 00:14:39 UTC 2024 - 35.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/tpu_cluster_util.cc
const CallGraph call_graph(module); // symbol_table caches callees in the CallGraph. SymbolTableCollection symbol_table; // List pending nodes to traverse with their root TPU cluster. llvm::SmallVector<std::pair<CallGraphNode*, tf_device::ClusterOp>> pending_call_nodes; // Cache the host device for each TPU cluster.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 06 04:50:13 UTC 2023 - 4.7K bytes - Viewed (0)