Examples of DependencyGraph

com.espertech.esper.util.DependencyGraph
Model of dependency of lookup, in which one stream supplies values for lookup in another stream.
com.google.gxp.compiler.depend.DependencyGraph
A graph of DependencyNode instances.
com.opengamma.engine.depgraph.DependencyGraph
Represents a directed, acyclic, graph of nodes describing how to execute a view to produce the required terminal outputs.
Code using a graph instance may assume that it is well formed - that is, the nodes are linked to each other in a consistent fashion and no cycles are present. It is the responsibility of code that creates (or modifies) graphs to ensure that invalid graphs are not produced as the presence of such a graph would break other components.
edu.brown.designer.DependencyGraph
@author Andy Pavlo
hudson.model.DependencyGraph
Maintains the build dependencies between {@link AbstractProject}s for efficient dependency computation.
The "master" data of dependencies are owned/persisted/maintained by individual {@link AbstractProject}s, but because of that, it's relatively slow to compute backward edges.
This class builds the complete bi-directional dependency graph by collecting information from all {@link AbstractProject}s.
Once built, {@link DependencyGraph} is immutable, and every timethere's a change (which is relatively rare), a new instance will be created. This eliminates the need of synchronization. @see Jenkins#getDependencyGraph() @author Kohsuke Kawaguchi
org.apache.flex.compiler.internal.projects.DependencyGraph
Class to track dependencies in a {@link CompilerProject}.
There are four types of dependency that may exist from one {@link ICompilationUnit} to another {@link ICompilationUnit}.
Inheritance Dependency

If {@link ICompilationUnit} A contains a definition that extends a classor implements an interface defined in {@link ICompilationUnit} B, then thereis an inheritance dependency from A to B.

Signature Dependency
If any of:
- class member variable ( or constant ) type annotation expression
- class method return type annotation expression
- class method parameter type annotation expression
- script variable ( or constant ) type annotation expression
- script function return type annotation expression
- script function parameter type annotation expression
in {@link ICompilationUnit} A refers to a definition from{@link ICompilationUnit} B, then there is a signature dependency from A to B.
Namespace Dependency

If {@link ICompilationUnit} A depends on a namespace definition from{@link ICompilationUnit} B, then there is a namespace dependency from A to B.
Expression Dependency

If {@link ICompilationUnit} A contains any reference to{@link ICompilationUnit} B that does not result in any other type ofdependency, then there exists an expression dependency from A to B.

The code in this class intends to make adding or updating a dependency edge very fast and thread safe.
org.apache.maven.archiva.dependency.graph.DependencyGraph
DependencyGraph @author Joakim Erdfelt @version $Id: DependencyGraph.java 547277 2007-06-14 15:25:42Z joakime $
org.emftrace.ui.dependencygraph.DependencyGraph
An extension of the Zest graph to display dependency graphs @author Steffen Lehnert @version 1.0
org.evolizer.daforjava.graph.data.DependencyGraph
Dependency graph containing the nodes and edges as well as maps to the corresponding FAMIX entities and associations. The class provides the basic methods to add/remove entities and associations to the graph, as well as, managing the map between higher and lower-level edges. @author Martin Pinzger
org.jitterbit.integration.client.ui.entity.dependencies.graph.DependencyGraph
@author Torgil Zethson @since 2.0.0
org.maltparserx.core.syntaxgraph.DependencyGraph
@author Johan Hall
org.objectweb.perseus.dependency.api.DependencyGraph

Examples of org.apache.maven.archiva.dependency.graph.DependencyGraph

     *                           ----&gt; [jaxen] &lt;--+
     * </pre>
     */
    public void testModerateWalk()
    {
        DependencyGraph graph = new DependencyGraph( "org.foo", "foo-util", "1.0" );
        String rootKey = DependencyGraphKeys.toKey( graph.getRootNode().getArtifact() );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-common:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-xml:1.0::jar" ) );


        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "xerces:xercesImpl:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );

View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.DependencyGraph

     *       ---------&gt; [foo-xml] ---&gt; [xercesImpl] ---&gt; [xmlParserAPIs]
     * </pre>
     */
    public void testSimpleWalk()
    {
        DependencyGraph graph = new DependencyGraph( "org.foo", "foo-util", "1.0" );
        String rootKey = DependencyGraphKeys.toKey( graph.getRootNode().getArtifact() );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-common:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-xml:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "xerces:xercesImpl:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );

View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.DependencyGraph

     *                           ----&gt; [jaxen] &lt;--+
     * </pre>
     */
    public void testDeepNodeWalk()
    {
        DependencyGraph graph = new DependencyGraph( "org.foo", "foo-util", "1.0" );
        String rootKey = DependencyGraphKeys.toKey( graph.getRootNode().getArtifact() );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-common:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-xml:1.0::jar" ) );


        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "xerces:xercesImpl:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );

View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.DependencyGraph

     *                           ----&gt; [jaxen] &lt;--+
     * </pre>
     */
    public void testModerateWalk()
    {
        DependencyGraph graph = new DependencyGraph( "org.foo", "foo-util", "1.0" );
        String rootKey = DependencyGraphKeys.toKey( graph.getRootNode().getArtifact() );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-common:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-xml:1.0::jar" ) );


        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "xerces:xercesImpl:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );

View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.DependencyGraph

     *       ---------&gt; [foo-xml] ---&gt; [xercesImpl] ---&gt; [xmlParserAPIs]
     * </pre>
     */
    public void testSimpleWalk()
    {
        DependencyGraph graph = new DependencyGraph( "org.foo", "foo-util", "1.0" );
        String rootKey = DependencyGraphKeys.toKey( graph.getRootNode().getArtifact() );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-common:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-xml:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "xerces:xercesImpl:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );

View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.DependencyGraph

     *                           ----&gt; [jaxen] &lt;--+
     * </pre>
     */
    public void testDeepNodeWalk()
    {
        DependencyGraph graph = new DependencyGraph( "org.foo", "foo-util", "1.0" );
        String rootKey = DependencyGraphKeys.toKey( graph.getRootNode().getArtifact() );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-common:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-xml:1.0::jar" ) );


        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "xerces:xercesImpl:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );

View Full Code Here

Examples of org.emftrace.ui.dependencygraph.DependencyGraph

   */
  protected void doBuild() 
  {
    super.doBuild();
    bodyComposite.setLayout(new GridLayout(1, true));
    graph = new DependencyGraph(bodyComposite, SWT.NONE, accessLayer);
    
    if( model instanceof Trace) graph.buildFromTrace((Trace)model);
    else                        graph.buildForModel(model, project, true, true);
  }

View Full Code Here

Examples of org.emftrace.ui.dependencygraph.DependencyGraph

   */
  protected void doBuild() 
  {
    super.doBuild();
    bodyComposite.setLayout(new GridLayout(1, true));
    graph = new DependencyGraph(bodyComposite, SWT.NONE, accessLayer);
    
    if( model instanceof Trace) graph.buildFromTrace((Trace)model);
    else                        graph.buildForModel(model, project, true, true);
  }

View Full Code Here

Examples of org.evolizer.daforjava.graph.data.DependencyGraph

    public void openCloseClassPlanetNode() {
        
    }
    
    private void checkClassPlanet() {
        DependencyGraph graph = fGraphPanel.getGraph();
        org.evolizer.famix.model.entities.FamixPackage thebigvoidPackage = new org.evolizer.famix.model.entities.FamixPackage("thebigvoid", null);
        Assert.assertTrue("Graph must contain FAMIX entity " + thebigvoidPackage.getUniqueName(), graph.contains(thebigvoidPackage));
        org.evolizer.famix.model.entities.FamixClass planetClass = new org.evolizer.famix.model.entities.FamixClass("thebigvoid.Planet", null);
        Assert.assertTrue("Graph must contain FAMIX entity " + planetClass.getUniqueName(), graph.contains(planetClass));
        org.evolizer.famix.model.entities.FamixMethod planetContstructor = new org.evolizer.famix.model.entities.FamixMethod("thebigvoid.Planet.<init>(java.lang.String,java.awt.Color)", null);
        Assert.assertTrue("Graph must contain FAMIX entity " + planetContstructor.getUniqueName(), graph.contains(planetContstructor));
        org.evolizer.famix.model.entities.FamixMethod getColor = new org.evolizer.famix.model.entities.FamixMethod("thebigvoid.Planet.getColor()", null);
        Assert.assertTrue("Graph must contain FAMIX entity " + getColor.getUniqueName(), graph.contains(getColor));
        org.evolizer.famix.model.entities.FamixAttribute color = new org.evolizer.famix.model.entities.FamixAttribute("thebigvoid.Planet.color", null);
        Assert.assertTrue("Graph must contain FAMIX entity " + color.getUniqueName(), graph.contains(color));


        Node thebigvoidPackageNode = graph.getNode(thebigvoidPackage);
        Node planetClassNode = graph.getNode(planetClass);
        Node planetConstructorNode = graph.getNode(planetContstructor);
        Node getColorNode = graph.getNode(getColor);
        Node colorNode = graph.getNode(color);
        Assert.assertNull("Parent node of " + thebigvoidPackageNode + " has to be null", graph.getHierarchyManager().getParentNode(thebigvoidPackageNode));
        Assert.assertEquals("Parent node of " + planetClassNode + " has to be " + thebigvoidPackageNode, thebigvoidPackageNode, graph.getHierarchyManager().getParentNode(planetClassNode));
        Assert.assertEquals("Parent node of " + planetConstructorNode + " has to be " + planetClassNode, planetClassNode, graph.getHierarchyManager().getParentNode(planetConstructorNode));
        Assert.assertEquals("Parent node of " + getColorNode + " has to be " + planetClassNode, planetClassNode, graph.getHierarchyManager().getParentNode(getColorNode));
        Assert.assertEquals("Parent node of " + colorNode + " has to be " + planetClassNode, planetClassNode, graph.getHierarchyManager().getParentNode(colorNode));


        Assert.assertEquals(thebigvoidPackageNode + " does have 0 edges", 0, thebigvoidPackageNode.edges().size());
        Assert.assertEquals(planetClassNode + " does have 0 edges", 0, planetClassNode.edges().size());
        Assert.assertNotNull("There should be an edge between " + getColorNode + " and " + colorNode, getColorNode.getEdge(colorNode));
        Assert.assertNotNull("There should be an edge between " + planetConstructorNode + " and " + colorNode, planetConstructorNode.getEdge(colorNode));

View Full Code Here

Examples of org.evolizer.daforjava.graph.data.DependencyGraph

     */
    public void execute() {
        setEditResult(new EditResult());


        if (!fEntities.isEmpty()) {
            DependencyGraph graph = getGraphLoader().getGraph();
            fireGraphPreEvent();


            for (NodeCursor nc = graph.nodes(); nc.ok(); nc.next()) {
                getEdgeGrouper().reinsertLowLevelEdges(nc.node());
            }


            getEditResult().addAll(getGraphLoader().addEntitiesAndAssociations(fEntities));
            getEdgeGrouper().groupAll();

View Full Code Here

0 1 2 3 4 5

TOP

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.