Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for MetadataGraphEdge (0.06 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraphEdge.java

    import org.apache.maven.artifact.ArtifactScopeEnum;
    
    /**
     * metadata graph edge - combination of version, scope and depth define
     * an edge in the graph
     *
     *
     */
    @Deprecated
    public class MetadataGraphEdge {
        String version;
        ArtifactScopeEnum scope;
        int depth = -1;
        int pomOrder = -1;
        boolean resolved = true;
        String artifactUri;
    
        /**
         * capturing where this link came from
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Jan 10 08:42:00 GMT 2025
    - 4.8K bytes
    - Click Count (0)
  2. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java

                List<MetadataGraphEdge> ins = getIncidentEdges(v);
                if (ins != null) {
                    for (MetadataGraphEdge e : ins) {
                        sb.append("       from :  ").append(e.toString()).append('\n');
                    }
                } else {
                    sb.append("      no entries\n");
                }
    
                List<MetadataGraphEdge> outs = getExcidentEdges(v);
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 13K bytes
    - Click Count (0)
  3. compat/maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultClasspathTransformationTestType.java

            // v1-->v2
            graph.addEdge(v1, v2, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
            graph.addEdge(v1, v2, new MetadataGraphEdge("1.2", true, null, null, 2, 2));
    
            // v1-->v3
            graph.addEdge(v1, v3, new MetadataGraphEdge("1.1", true, null, null, 2, 1));
            graph.addEdge(v1, v3, new MetadataGraphEdge("1.2", true, null, null, 4, 2));
    
            // v3-->v4
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 4.7K bytes
    - Click Count (0)
  4. compat/maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolutionPolicyTest.java

        GraphConflictResolutionPolicy policy;
        MetadataGraphEdge e1;
        MetadataGraphEdge e2;
        MetadataGraphEdge e3;
    
        // ------------------------------------------------------------------------------------------
        @BeforeEach
        void setUp() throws Exception {
            policy = new DefaultGraphConflictResolutionPolicy();
            e1 = new MetadataGraphEdge("1.1", true, null, null, 2, 1);
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 2.2K bytes
    - Click Count (0)
  5. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/GraphConflictResolutionPolicy.java

     *
     *
     */
    @Deprecated
    public interface GraphConflictResolutionPolicy {
        String ROLE = GraphConflictResolutionPolicy.class.getName();
    
        MetadataGraphEdge apply(MetadataGraphEdge e1, MetadataGraphEdge e2);
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 1.1K bytes
    - Click Count (0)
  6. compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultClasspathTransformation.java

                    return;
                }
    
                cpc.add(md);
    
                List<MetadataGraphEdge> exits = graph.getExcidentEdges(node);
    
                if (exits != null && !exits.isEmpty()) {
                    MetadataGraphEdge[] sortedExits = exits.toArray(new MetadataGraphEdge[0]);
                    Arrays.sort(sortedExits, (e1, e2) -> {
                        if (e1.getDepth() == e2.getDepth()) {
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 5.1K bytes
    - Click Count (0)
Back to Top