Package org.codehaus.plexus.util.dag

Examples of org.codehaus.plexus.util.dag.Vertex

247
248
249
250
251
252
253
254
255
256
257
        Set projectsToMake = new HashSet( Arrays.asList( selectedProjects ) );
        for ( int i = 0; i < selectedProjects.length; i++ )
        {
            MavenProject project = selectedProjects[i];
            String id = ArtifactUtils.versionlessKey( project.getGroupId(), project.getArtifactId() );
            Vertex v = dag.getVertex( id );
            if ( make )
            {
                gatherDescendents ( v, projectMap, projectsToMake, new HashSet() );
            }
            if ( makeDependents )
View Full Code Here
321
322
323
324
325
326
327
328
329
        if ( visited.contains( v ) ) return;
        visited.add( v );
        out.add( projectMap.get( v.getLabel() ) );
        for ( Iterator i = v.getChildren().iterator(); i.hasNext(); )
        {
            Vertex child = (Vertex) i.next();
            gatherDescendents( child, projectMap, out, visited );
        }
    }
View Full Code Here
333
334
335
336
337
338
339
340
341
        if ( visited.contains( v ) ) return;
        visited.add( v );
        out.add( projectMap.get( v.getLabel() ) );
        for ( Iterator i = v.getParents().iterator(); i.hasNext(); )
        {
            Vertex parent = (Vertex) i.next();
            gatherAncestors( parent, projectMap, out, visited );
        }
    }
View Full Code Here
176
177
178
179
180
181
182
183
184
185
186
        if ( vertices != null )
        {
            if ( isSpecificVersion( version ) )
            {
                Vertex vertex = vertices.get( version );
                if ( vertex != null )
                {
                    addEdge( projectVertex, vertex, project, projectMap, force, safe );
                }
            }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
    {
        visited.add(v);
        out.add(ps.getProjectMap().get(v.getLabel()));
        List parents = v.getParents();
        for (Object parent1 : parents) {
            Vertex parent = (Vertex) parent1;
            if (visited.contains(parent)) continue;
            gatherProjects(parent, ps, visited, out);
        }
        return out;
    }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
            for (String artifact : artifacts) {
                String project = artifact;
                if (project.indexOf(':') == -1) {
                    project = defaultGroup + ":" + project;
                }
                Vertex projectVertex = dag.getVertex(project);
                if (projectVertex == null) throw new MissingProjectException(project);
                gatherProjects(projectVertex, ps, visited, out);
            }
           
            // sort them again
View Full Code Here
221
222
223
224
225
226
227
228
229
230
231
    {
        visited.add( v );
        out.add( ps.getProjectMap().get( v.getLabel() ) );
        List children = v.getChildren();
        for (Object aChildren : children) {
            Vertex child = (Vertex) aChildren;
            if (visited.contains(child))
                continue;
            gatherProjects(child, ps, visited, out);
        }
        return out;
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
        Set projectsToMake = new HashSet( Arrays.asList( selectedProjects ) );
        for ( int i = 0; i < selectedProjects.length; i++ )
        {
            MavenProject project = selectedProjects[i];
            String id = ArtifactUtils.versionlessKey( project.getGroupId(), project.getArtifactId() );
            Vertex v = dag.getVertex( id );
            if ( make )
            {
                gatherDescendents ( v, projectMap, projectsToMake, new HashSet() );
            }
            if ( makeDependents )
View Full Code Here
327
328
329
330
331
332
333
334
335
        if ( visited.contains( v ) ) return;
        visited.add( v );
        out.add( projectMap.get( v.getLabel() ) );
        for ( Iterator i = v.getChildren().iterator(); i.hasNext(); )
        {
            Vertex child = (Vertex) i.next();
            gatherDescendents( child, projectMap, out, visited );
        }
    }
View Full Code Here
339
340
341
342
343
344
345
346
347
        if ( visited.contains( v ) ) return;
        visited.add( v );
        out.add( projectMap.get( v.getLabel() ) );
        for ( Iterator i = v.getParents().iterator(); i.hasNext(); )
        {
            Vertex parent = (Vertex) i.next();
            gatherAncestors( parent, projectMap, out, visited );
        }
    }
View Full Code Here
TOP

Related Classes of org.codehaus.plexus.util.dag.Vertex

  • org.apache.maven.plugin.reactor.MakeDependentsMojo
  • org.apache.maven.plugin.reactor.MakeMojo
  • org.apache.maven.project.ProjectSorter
  • java.util.ArrayList
  • java.util.List
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.