Package com.hp.hpl.jena.graph.compose

Examples of com.hp.hpl.jena.graph.compose.MultiUnion


    }
  }
 
  private void collectLeafGraphs(Graph graph, Set<Graph> prevLeaves) {
    if( graph instanceof MultiUnion ) {
      MultiUnion union = ((MultiUnion) graph);
      if( union.getBaseGraph() != null )
        collectLeafGraphs( union.getBaseGraph(), prevLeaves );

      for( Iterator<Graph> i = union.getSubGraphs().iterator(); i.hasNext(); )
        collectLeafGraphs( i.next(), prevLeaves );
    }
    else if( graph instanceof InfGraph ) {
      collectLeafGraphs( ((InfGraph) graph).getRawGraph(), prevLeaves );
    }
View Full Code Here


     * together with an additional set of data premises. The default
     * implementation loses ALL partial deductions so far. Some subclasses
     * may be able to a more efficient job.
     */
    public Graph cloneWithPremises(Graph premises) {
        MultiUnion union = new MultiUnion();
        union.addGraph( this );
        union.setBaseGraph( this );
        union.addGraph( premises );
        return union;
    }
View Full Code Here

     * together with an additional set of data premises. The default
     * implementation loses ALL partial deductions so far. Some subclasses
     * may be able to a more efficient job.
     */
    public Graph cloneWithPremises(Graph premises) {
        MultiUnion union = new MultiUnion();
        union.addGraph( this );
        union.setBaseGraph( this );
        union.addGraph( premises );
        return union;
    }
View Full Code Here

TOP

Related Classes of com.hp.hpl.jena.graph.compose.MultiUnion

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.