- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 219 for Traverser (0.13 sec)
-
src/cmd/vendor/golang.org/x/tools/go/analysis/validate.go
// // Analyzer names need not be unique, though this may be confusing. func Validate(analyzers []*Analyzer) error { // Map each fact type to its sole generating analyzer. factTypes := make(map[reflect.Type]*Analyzer) // Traverse the Requires graph, depth first. const ( white = iota grey black finished ) color := make(map[*Analyzer]uint8) var visit func(a *Analyzer) error visit = func(a *Analyzer) error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 21:52:54 UTC 2023 - 3.1K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultClasspathTransformation.java
throw new MetadataGraphTransformationException(e); } } // =================================================================================================== /** * Helper class to traverse graph. Required to make the containing method thread-safe * and yet use class level data to lessen stack usage in recursion */ private class ClasspathGraphVisitor { MetadataGraph graph;
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 6.3K bytes - Viewed (0) -
src/io/fs/glob.go
// The only possible returned error is [path.ErrBadPattern], reporting that // the pattern is malformed. // // If fs implements [GlobFS], Glob calls fs.Glob. // Otherwise, Glob uses [ReadDir] to traverse the directory tree // and look for matches for the pattern. func Glob(fsys FS, pattern string) (matches []string, err error) { return globWithLimit(fsys, pattern, 0) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 11 20:25:50 UTC 2023 - 3.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tpu_host_computation_expansion.cc
OpBuilder* builder) { Region* cluster_region = &cluster.getBody(); llvm::SmallSetVector<Operation*, 4> head_outside_compiled_ops; // Traverse the graph in topological order to find all outside compiled ops // at head of TPU computation or unary ops that are only used by other outside // compiled ops. auto cluster_ops = cluster.GetBody().without_terminator();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 5.1K bytes - Viewed (0) -
tests/integration/ambient/waypoint_test.go
rules: - matches: - path: type: PathPrefix value: / filters: - type: ResponseHeaderModifier responseHeaderModifier: add: - name: traversed-waypoint value: {{.Service}}-gateway backendRefs: - name: {{.Service}} port: {{.Port}} ` t.ConfigKube(). New(). Eval( apps.Namespace.Name(),
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jun 06 22:12:34 UTC 2024 - 11.4K bytes - Viewed (0) -
platforms/core-runtime/client-services/src/main/java/org/gradle/internal/daemon/client/serialization/ClasspathInferer.java
} dest.addAll(classPath); } finally { lock.unlock(); } } /** * Locates the classpath required by the given target class. Traverses the dependency graph of classes used by the specified class and collects the result in the given collection. */ private void find(Class<?> target, Collection<Class<?>> visited, Collection<URI> dest) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 15 19:53:31 UTC 2024 - 5.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMapEntry.java
import com.google.common.annotations.GwtIncompatible; import javax.annotation.CheckForNull; /** * Implementation of {@code Entry} for {@link ImmutableMap} that adds extra methods to traverse hash * buckets for the key and the value. This allows reuse in {@link RegularImmutableMap} and {@link * RegularImmutableBiMap}, which don't have to recopy the entries created by their {@code Builder} * implementations. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 4.4K bytes - Viewed (0) -
src/go/types/return.go
return false } } return hasDefault } // TODO(gri) For nested breakable statements, the current implementation of hasBreak // will traverse the same subtree repeatedly, once for each label. Replace // with a single-pass label/break matching phase. // hasBreak reports if s is or contains a break statement // referring to the label-ed statement or implicit-ly the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 22 19:32:17 UTC 2024 - 4.2K bytes - Viewed (0) -
src/image/jpeg/scan.go
for j := 0; j < hi*vi; j++ { // The blocks are traversed one MCU at a time. For 4:2:0 chroma // subsampling, there are four Y 8x8 blocks in every 16x16 MCU. // // For a sequential 32x16 pixel image, the Y blocks visiting order is: // 0 1 4 5 // 2 3 6 7 // // For progressive images, the interleaved scans (those with nComp > 1) // are traversed as above, but non-interleaved scans are traversed left
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 15.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/return.go
return false } } return hasDefault } // TODO(gri) For nested breakable statements, the current implementation of hasBreak // will traverse the same subtree repeatedly, once for each label. Replace // with a single-pass label/break matching phase. // hasBreak reports if s is or contains a break statement // referring to the label-ed statement or implicit-ly the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 22 19:32:17 UTC 2024 - 4.4K bytes - Viewed (0)