- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for fromModel (0.22 sec)
-
platforms/ide/tooling-api/src/crossVersionTest/groovy/org/gradle/integtests/tooling/r24/ModelTasksToolingApiCrossVersionTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Sep 26 14:49:20 UTC 2023 - 1.8K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/edges/ComplexDependentNodesSet.java
return dependencyPredecessors.getDependencyPredecessors(); } @Override public DependentNodesSet addDependencyPredecessors(Node fromNode) { dependencyPredecessors.addDependencyPredecessors(fromNode); return this; } @Override public SortedSet<Node> getFinalizers() { return finalizers; } @Override
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 12 20:17:10 UTC 2022 - 2.4K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/edges/DependentNodesSet.java
*/ public interface DependentNodesSet { DependentNodesSet EMPTY = new DependentNodesSet() { @Override public DependentNodesSet addDependencyPredecessors(Node fromNode) { return new DependencyPredecessorsOnlyNodeSet().addDependencyPredecessors(fromNode); } @Override public DependentNodesSet addFinalizer(Node finalizer) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 12 20:17:10 UTC 2022 - 2.4K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/edges/DependencyPredecessorsOnlyNodeSet.java
public DependentNodesSet addDependencyPredecessors(Node fromNode) { dependencyPredecessors.add(fromNode); return this; } @Override public DependentNodesSet addFinalizer(Node finalizer) { return new ComplexDependentNodesSet(this).addFinalizer(finalizer); } @Override public DependentNodesSet addMustPredecessor(Node fromNode) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 12 20:17:10 UTC 2022 - 1.8K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/DependencyGraphPathResolver.java
import java.util.List; import java.util.Map; import java.util.Set; public class DependencyGraphPathResolver { public static Collection<List<ComponentIdentifier>> calculatePaths(List<DependencyGraphNode> fromNodes, DependencyGraphNode toNode) { // Include the shortest path from each version that has a direct dependency on the broken dependency, back to the root
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 3.5K bytes - Viewed (0) -
platforms/ide/tooling-api/src/main/java/org/gradle/tooling/events/test/Destination.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 13:57:30 UTC 2024 - 1.3K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/Node.java
} void addDependencyPredecessor(Node fromNode) { dependentNodes = dependentNodes.addDependencyPredecessors(fromNode); mutationInfo.addConsumer(fromNode); } void addMustPredecessor(TaskNode fromNode) { dependentNodes = dependentNodes.addMustPredecessor(fromNode); } protected DependencyNodesSet getDependencyNodes() {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Aug 24 13:30:48 UTC 2023 - 22.7K bytes - Viewed (0) -
guava/src/com/google/thirdparty/publicsuffix/PublicSuffixType.java
return leafNodeCode; } char getInnerNodeCode() { return innerNodeCode; } /** Returns a PublicSuffixType of the right type according to the given code */ static PublicSuffixType fromCode(char code) { for (PublicSuffixType value : values()) { if (value.getInnerNodeCode() == code || value.getLeafNodeCode() == code) { return value; } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Dec 10 15:48:57 UTC 2020 - 2K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixType.java
return leafNodeCode; } char getInnerNodeCode() { return innerNodeCode; } /** Returns a PublicSuffixType of the right type according to the given code */ static PublicSuffixType fromCode(char code) { for (PublicSuffixType value : values()) { if (value.getInnerNodeCode() == code || value.getLeafNodeCode() == code) { return value; } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Dec 16 19:54:45 UTC 2020 - 2K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/FinalizerGroup.java
Set<Node> seen = new HashSet<>(1024); ArrayDeque<Node> queue = new ArrayDeque<>(1024); for (Node fromNode : blockedFinalizedMembers) { queue.add(fromNode); while (!queue.isEmpty()) { Node toNode = queue.removeFirst(); if (members.contains(toNode) && !blockedFinalizedMembers.contains(toNode)) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jul 01 16:25:48 UTC 2023 - 14.3K bytes - Viewed (0)