private static GNode previous(GNode gnode) { // reverse Node n = getNodeReverse(gnode, CDR) ; if ( n == null ) return null ; return new GNode(gnode, n) ; }
static Resource storeResource(Resource dsAssem) { return GraphUtils.getResourceValue(dsAssem, AssemblerVocab.pStore) ; } }
public static void allTriples(GNode gnode, Collection<Triple> acc) { if ( ! isListNode(gnode) ) return ; while( ! listEnd(gnode) ) { triples(gnode, acc) ; gnode = next(gnode) ; } }
public static int length(GNode gnode) { if ( ! isListNode(gnode) ) return -1 ; int len = 0 ; while ( ! listEnd(gnode) ) { len++ ; gnode = next(gnode) ; } return len ; }
/** * Convert an iterator of triples into quads for the default graph. This is * {@link Quad#defaultGraphIRI}, not {@link Quad#defaultGraphNodeGenerated}, which is * for quads outside a dataset, usually the output of parsers. */ public static Iterator<Quad> triples2quadsDftGraph(Iterator<Triple> iter) { return triples2quads(Quad.defaultGraphIRI, iter) ; }
@Override protected void finishRead() { finishMonitor() ; printAtEnd() ; }
public GraphLoadMonitor(int addNotePoint, boolean displayMemory) { super(addNotePoint) ; this.displayMemory = displayMemory ; resetTimer() ; }
@Override public void notifyDeleteArray(Graph g, Triple[] triples) { for ( Triple triple : triples ) { deleteEvent( triple ); } // for ( Triple t : triples ) // deleteEvent(t) ; }
public static boolean isContainerMember(Graph graph, Node container, Node containerType, Node member) { return countContainerMember(graph, container, containerType, member, true) != 0 ; }
@Override protected void deleteEvent(Triple t) { deleteCount++ ; if ( deleteNotePoint > 0 && (deleteCount%deleteNotePoint) == 0 ) { deleteTicks++ ; deleteTick() ; } }
@Override public void notifyEvent(Graph source, Object value) { super.notifyEvent(source, value) ; }
@Override public void notifyAddArray(Graph g, Triple[] triples) { for ( Triple triple : triples ) { addEvent( triple ); } // for ( Triple t : triples ) // addEvent(t) ; }
@Override protected void addEvent(Triple t) { addCount++ ; if ( addNotePoint > 0 && (addCount%addNotePoint) == 0 ) { addTicks++ ; addTick() ; } }
@Override public boolean contains(Node s, Node p, Node o) { if ( s == Node.ANY ) s = null ; if ( p == Node.ANY ) p = null ; if ( o == Node.ANY ) o = null ; for ( Triple t : triples ) { if ( matches(t, s, p, o) ) return true; } return false ; } }
@Override protected void startRead() { startMonitor() ; }
public static Collection<Node> containerMembers(Graph graph, Node container) { return containerMembers(graph, container, null) ; }
public void startMonitor() { resetTimer() ; }
@Override public void notifyDeleteTriple(Graph g, Triple t) { deleteEvent(t) ; }
public static int countContainerMember(Graph graph, Node container, Node containerType, Node member) { return countContainerMember(graph, container, containerType, member, false) ; }