Examples of DependencyNodeFilter

com.opengamma.engine.depgraph.DependencyNodeFilter
Strategy for filtering a dependency graph to produce a sub-graph.
This interface is used to decide whether a specific node should be included in the sub-graph.
org.apache.maven.shared.dependency.graph.filter.DependencyNodeFilter
Defines a filter for dependency nodes. @author Mark Hobson @version $Id: DependencyNodeFilter.java 1351166 2012-06-17 21:15:54Z hboutemy $ @since 1.1
org.apache.maven.shared.dependency.tree.filter.DependencyNodeFilter
Defines a filter for dependency nodes. @author Mark Hobson @version $Id: DependencyNodeFilter.java 661727 2008-05-30 14:21:49Z bentmann $ @since 1.1

Examples of com.opengamma.engine.depgraph.DependencyNodeFilter

   * @param calcConfName calculation configuration name
   * @return a dependency graph with any nodes which have already been satisfied filtered out, not null See {@link #computeDelta} and how it calls {@link #markExecuted}.
   */
  protected DependencyGraph createExecutableDependencyGraph(final String calcConfName) {
    final FunctionBlacklistQuery blacklist = getViewProcessContext().getFunctionCompilationService().getFunctionCompilationContext().getGraphExecutionBlacklist();
    return getDependencyGraph(calcConfName).subGraph(new DependencyNodeFilter() {
      @Override
      public boolean accept(final DependencyNode node) {
        // Market data functions must not be executed
        if (node.isMarketDataSourcingFunction()) {
          markExecuted(node);

View Full Code Here

Examples of com.opengamma.engine.depgraph.DependencyNodeFilter

    n8.addInputNode(n7);
    return graph(n1, n2, n3, n4, n5, n6, n7, n8);
  }


  public void testReturnSameGraph() {
    final SubGraphingFilter filter = new SubGraphingFilter(new DependencyNodeFilter() {
      @Override
      public boolean accept(final DependencyNode node) {
        return true;
      }
    });

View Full Code Here

Examples of com.opengamma.engine.depgraph.DependencyNodeFilter

    graph = smallGraph();
    assertSame(filter.subGraph(graph, null), graph);
  }


  public void testReturnEmptyGraph() {
    final SubGraphingFilter filter = new SubGraphingFilter(new DependencyNodeFilter() {
      @Override
      public boolean accept(final DependencyNode node) {
        return false;
      }
    });

View Full Code Here

Examples of org.apache.maven.shared.dependency.graph.filter.DependencyNodeFilter

        DependencyNodeVisitor visitor = getSerializingDependencyNodeVisitor( writer );


        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );

View Full Code Here

Examples of org.apache.maven.shared.dependency.graph.filter.DependencyNodeFilter

        DependencyNodeVisitor visitor = getSerializingDependencyNodeVisitor( writer );


        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );

View Full Code Here

Examples of org.apache.maven.shared.dependency.graph.filter.DependencyNodeFilter

        DependencyNodeVisitor visitor = getSerializingDependencyNodeVisitor( writer );


        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );

View Full Code Here

Examples of org.apache.maven.shared.dependency.graph.filter.DependencyNodeFilter

        DependencyNodeVisitor visitor = getSerializingDependencyNodeVisitor( writer );


        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.filter.DependencyNodeFilter

            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor =
                new FilteringDependencyNodeVisitor( collectingVisitor, StateDependencyNodeFilter.INCLUDED );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );


            rootNode.accept( visitor );
        }

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.filter.DependencyNodeFilter

        DependencyNodeVisitor visitor = getSerializingDependencyNodeVisitor( writer );


        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter = new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.filter.DependencyNodeFilter

        CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
        DependencyNodeVisitor firstPassVisitor =
            new FilteringDependencyNodeVisitor( collectingVisitor, StateDependencyNodeFilter.INCLUDED );
        rootNode.accept( firstPassVisitor );


        DependencyNodeFilter secondPassFilter = new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
        visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );


        rootNode.accept( visitor );


        FileWriter writer = null;

View Full Code Here

0 1

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.