- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for Hedger (0.14 sec)
-
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultModelNormalizer.java
import org.apache.maven.api.services.model.*; /** * Handles normalization of a model. * */ @Named @Singleton public class DefaultModelNormalizer implements ModelNormalizer { private DuplicateMerger merger = new DuplicateMerger(); @Override public Model mergeDuplicates(Model model, ModelBuilderRequest request, ModelProblemCollector problems) { Model.Builder builder = Model.newBuilder(model);
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 5.3K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolutionPolicyTest.java
MetadataGraphEdge res; res = policy.apply(e1, e2); assertEquals("1.1", res.getVersion(), "Wrong depth edge selected"); res = policy.apply(e1, e3); assertEquals("1.2", res.getVersion(), "Wrong version edge selected"); } // ------------------------------------------------------------------------------------------
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 2.2K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
List<String> cycle = visitCycle(graph, Collections.singleton(to), new HashMap<>(), new LinkedList<>()); if (cycle != null) { // remove edge which introduced cycle throw new CycleDetectedException( "Edge between '" + from + "' and '" + to + "' introduces to cycle in the graph", cycle); } } } private enum DfsState { VISITING,
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
from.children.add(to); to.parents.add(from); List<String> cycle = findCycle(to); if (cycle != null) { // remove edge which introduced cycle removeEdge(from, to); throw new CycleDetectedException( "Edge between '" + from.label + "' and '" + to.label + "' introduces to cycle in the graph", cycle); } } void removeEdge(Vertex from, Vertex to) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/GraphConflictResolver.java
* */ @Deprecated public interface GraphConflictResolver { String ROLE = GraphConflictResolver.class.getName(); /** * Cleanses the supplied graph by leaving only one directed versioned edge\ * between any two nodes, if multiple exists. Uses scope relationships, defined * in <code>ArtifactScopeEnum</code> * * @param graph the "dirty" graph to be simplified via conflict resolution
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.7K bytes - Viewed (0) -
maven-artifact/src/test/java/org/apache/maven/artifact/versioning/ComparableVersionTest.java
ComparableVersion version2 = new ComparableVersion("0.2"); assertEquals("0.2", version2.getCanonical()); } /** * Test <a href="https://issues.apache.org/jira/browse/MNG-5568">MNG-5568</a> edge case * which was showing transitive inconsistency: since A > B and B > C then we should have A > C * otherwise sorting a list of ComparableVersions() will in some cases throw runtime exception;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Tue Jan 09 06:39:47 GMT 2024 - 14K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java
throw new MetadataResolutionException("badly formed edge"); } } // ------------------------------------------------------------------------ public List<MetadataGraphEdge> getEdgesBetween(MetadataGraphVertex vFrom, MetadataGraphVertex vTo) { List<MetadataGraphEdge> edges = getIncidentEdges(vTo); if (edges == null || edges.isEmpty()) { return null; }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Oct 05 18:41:13 GMT 2023 - 13.1K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
"wrong # of v2 incident edges in the resulting graph after resolver"); assertEquals( "1.2", res.getIncidentEdges(v2).get(0).getVersion(), "wrong edge v1-v2 in the resulting graph after resolver"); assertEquals( 1, res.getIncidentEdges(v3).size(), "wrong # of edges v1-v3 in the resulting graph after resolver");
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 8.1K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultProfileInjector.java
Model.Builder builder = Model.newBuilder(model); merger.mergeModelBase(builder, model, profile); if (profile.getBuild() != null) { Build build = model.getBuild() != null ? model.getBuild() : Build.newInstance(); Build.Builder bbuilder = Build.newBuilder(build); merger.mergeBuildBase(bbuilder, build, profile.getBuild());
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 9.5K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/ProjectSorter.java
} Parent parent = project.getModel().getDelegate().getParent(); if (parent != null) { // Parent is added as an edge, but must not cause a cycle - so we remove any other edges it has // in conflict addEdge( projectMap, vertexMap, null,
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 10.3K bytes - Viewed (0)