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

com.hp.hpl.jena.graph.compose.Polyadic

A base class for composition graphs that are composed from zero or more sub-graphs (thus providing a basis for polyadic composition operators). A distinguished graph is the designated graph for additions to the union. By default, this is the first sub-graph of the composition, however any of the graphs in the composition can be nominated to be the distinguished graph.

    }
  }
  
  private void collectLeafGraphs(Graph graph, Set<Graph> prevLeaves) {
    if( graph instanceof Polyadic ) {
      Polyadic union = ((Polyadic) 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 Dyadic ) {
      Dyadic dyadic = ((Dyadic) graph);
      if( dyadic.getL() instanceof Graph )

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.

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

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