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.maltparserx.core.syntaxgraph.DependencyGraph

    super();
    firstStack = new Stack<DependencyNode>();
    secondStack = new Stack<DependencyNode>();
    activeStack = FIRST_STACK;
    input = new Stack<DependencyNode>();
    dependencyGraph = new DependencyGraph(symbolTableHandler);
    setRootHandling(rootHandling);
    setNoCoveredRoots(Boolean.valueOf(noCoveredRoots));
    setAcyclicity(Boolean.valueOf(acyclicity));
    setReduceAfterSwitch(Boolean.valueOf(reduceAfterSwitch));
  }

View Full Code Here

Examples of org.maltparserx.core.syntaxgraph.DependencyGraph

    }
    if (tokens == null || tokens.length == 0) {
      throw new MaltChainedException("Nothing to parse. ");
    }


    DependencyStructure outputGraph = new DependencyGraph(singleMalt.getSymbolTables());
    
    for (int i = 0; i < tokens.length; i++) {
      Iterator<ColumnDescription> columns = dataFormatInstance.iterator();
      DependencyNode node = outputGraph.addDependencyNode(i+1);
      String[] items = tokens[i].split("\t");
      for (int j = 0; j < items.length; j++) {
        if (columns.hasNext()) {
          ColumnDescription column = columns.next();
          if (column.getCategory() == ColumnDescription.INPUT && node != null) {
            outputGraph.addLabel(node, column.getName(), items[j]);
          }
        }
      }
    }
    outputGraph.setDefaultRootEdgeLabel(outputGraph.getSymbolTables().getSymbolTable("DEPREL"), "ROOT");
    // Invoke parse with the output graph
    singleMalt.parse(outputGraph);
    return outputGraph;
  }

View Full Code Here

Examples of org.maltparserx.core.syntaxgraph.DependencyGraph

      throw new MaltChainedException("No parser model has been initialized. Please use the method initializeParserModel() before invoking this method.");
    }
    if (tokens == null || tokens.length == 0) {
      throw new MaltChainedException("Nothing to convert. ");
    }
    DependencyStructure outputGraph = new DependencyGraph(singleMalt.getSymbolTables());
    
    for (int i = 0; i < tokens.length; i++) {
      Iterator<ColumnDescription> columns = dataFormatInstance.iterator();
      DependencyNode node = outputGraph.addDependencyNode(i+1);
      String[] items = tokens[i].split("\t");
      Edge edge = null;
      for (int j = 0; j < items.length; j++) {
        if (columns.hasNext()) {
          ColumnDescription column = columns.next();
          if (column.getCategory() == ColumnDescription.INPUT && node != null) {
            outputGraph.addLabel(node, column.getName(), items[j]);
          } else if (column.getCategory() == ColumnDescription.HEAD) {
            if (column.getCategory() != ColumnDescription.IGNORE && !items[j].equals("_")) {
              edge = ((DependencyStructure)outputGraph).addDependencyEdge(Integer.parseInt(items[j]), i+1);
            }
          } else if (column.getCategory() == ColumnDescription.DEPENDENCY_EDGE_LABEL && edge != null) {
            outputGraph.addLabel(edge, column.getName(), items[j]);
          }
        }
      }
    }
    outputGraph.setDefaultRootEdgeLabel(outputGraph.getSymbolTables().getSymbolTable("DEPREL"), "ROOT");
    return outputGraph;
  }

View Full Code Here

Examples of org.maltparserx.core.syntaxgraph.DependencyGraph


    // Creates a dependency graph
    if (tokens == null || tokens.length == 0) {
      throw new MaltChainedException("Nothing to convert. ");
    }
    DependencyStructure outputGraph = new DependencyGraph(symbolTables);
    
    for (int i = 0; i < tokens.length; i++) {
      Iterator<ColumnDescription> columns = dataFormatInstance.iterator();
      DependencyNode node = outputGraph.addDependencyNode(i+1);
      String[] items = tokens[i].split("\t");
      Edge edge = null;
      for (int j = 0; j < items.length; j++) {
        if (columns.hasNext()) {
          ColumnDescription column = columns.next();
          if (column.getCategory() == ColumnDescription.INPUT && node != null) {
            outputGraph.addLabel(node, column.getName(), items[j]);
          } else if (column.getCategory() == ColumnDescription.HEAD) {
            if (column.getCategory() != ColumnDescription.IGNORE && !items[j].equals("_")) {
              edge = ((DependencyStructure)outputGraph).addDependencyEdge(Integer.parseInt(items[j]), i+1);
            }
          } else if (column.getCategory() == ColumnDescription.DEPENDENCY_EDGE_LABEL && edge != null) {
            outputGraph.addLabel(edge, column.getName(), items[j]);
          }
        }
      }
    }
    outputGraph.setDefaultRootEdgeLabel(outputGraph.getSymbolTables().getSymbolTable("DEPREL"), "ROOT");
    return outputGraph;
  }

View Full Code Here

Examples of org.objectweb.perseus.dependency.api.DependencyGraph

        Cache c = new Cache(ca, um, cm, getPMF(), getJormFactory()); 
        server.registerMBean(c, new ObjectName("speedo:name=cache"));
    }
    
    public void addTxMBeans() throws Exception {
        DependencyGraph dg = (DependencyGraph) FractalHelper.getSubComponent(
                speedo, AbstractSpeedo.DEPENDENCY_GRAPH_PATH, logger)
                  .getFcInterface("dependency-graph");
        Tx p = new Tx(getPMF(), dg);
        server.registerMBean(p, new ObjectName("speedo:name=tx"));
    }

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.