- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for Traverser (0.29 sec)
-
platforms/core-configuration/declarative-dsl-provider/src/main/kotlin/org/gradle/internal/declarativedsl/common/DependencyCollectorFunctionExtractorAndRuntimeResolver.kt
* See the License for the specific language governing permissions and * limitations under the License. */ package org.gradle.internal.declarativedsl.common import com.google.common.graph.Traverser import org.gradle.api.artifacts.ProjectDependency import org.gradle.api.artifacts.dsl.Dependencies import org.gradle.api.artifacts.dsl.DependencyCollector import org.gradle.declarative.dsl.schema.DataConstructor
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu May 30 12:25:07 UTC 2024 - 8.4K bytes - Viewed (0) -
src/go/ast/walk.go
for _, node := range list { Walk(v, node) } } // TODO(gri): Investigate if providing a closure to Walk leads to // simpler use (and may help eliminate Inspect in turn). // Walk traverses an AST in depth-first order: It starts by calling // v.Visit(node); node must not be nil. If the visitor w returned by // v.Visit(node) is not nil, Walk is invoked recursively with visitor
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 16:34:10 UTC 2024 - 6.4K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/api/tasks/TaskSelectionIntegrationTest.groovy
import org.gradle.integtests.fixtures.ToBeFixedForIsolatedProjects class TaskSelectionIntegrationTest extends AbstractIntegrationSpec { @ToBeFixedForIsolatedProjects(because = "subprojects") def "given an unqualified name traverse project tree from current project and select all tasks with matching name"() { createDirs("a", "b", "a/a", "b/b") settingsFile << "include 'a', 'b', 'a:a', 'b:b'" buildFile << """
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon May 20 11:16:24 UTC 2024 - 3.7K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Node.java
/** * The repository where this artifact has been downloaded from. */ @Nonnull Optional<RemoteRepository> getRepository(); /** * Traverses this node and potentially its children using the specified visitor. * * @param visitor the visitor to call back, must not be {@code null}
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Tue Jun 11 07:23:04 UTC 2024 - 3.2K 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) -
cni/pkg/repair/netns.go
// * use crictl to inspect the pod; this returns the bind-mounted network namespace file. // * /var/lib/cni/results shows the outputs of CNI plugins; this containers the bind-mounted network namespace file. // // Instead, we traverse the procfs. Comments on this method are inline. func getPodNetNs(pod *corev1.Pod) (string, error) { parsedPodAddr := net.ParseIP(pod.Status.PodIP) if parsedPodAddr == nil {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri May 31 04:07:10 UTC 2024 - 4.3K bytes - Viewed (0) -
src/internal/trace/mud.go
break } else if oldSorted[i].x < edges[j].x { newSorted[o] = oldSorted[i] i++ } else { newSorted[o] = edges[j] j++ } } d.sorted = newSorted } // Traverse edges in order computing a cumulative sum. csum, rate, prevX := 0.0, 0.0, 0.0 for _, e := range d.sorted { newCsum := csum + (e.x-prevX)*rate if newCsum >= y { // y was exceeded between the previous edge
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.7K bytes - Viewed (0) -
src/go/ast/commentmap.go
// don't collect comments switch n.(type) { case nil, *CommentGroup, *Comment: return false } list = append(list, n) return true }) // Note: The current implementation assumes that Inspect traverses the // AST in depth-first and thus _source_ order. If AST traversal // does not follow source order, the sorting call below will be // required. // slices.Sort(list, func(a, b Node) int {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 8.9K bytes - Viewed (0)