Examples of com.hp.hpl.jena.mem.TrackingTripleIterator

com.hp.hpl.jena.mem.TrackingTripleIterator
A WrappedIterator which remembers the last object next'ed in a protected instance variable, so that subclasses have access to it during .remove.

   */
  @Override
  protected ExtendedIterator graphBaseFind(TripleMatch m) {
    if (graph == null)
      createGraph();
    return new TrackingTripleIterator(filterTriples(convertNodes(graph
        .iterator()), m));
  }

View Full Code Here

     * Answer an iterator which wraps <code>i</code> to ensure that if a .remove()
     * is executed on it, the graph <code>g</code> will be notified.
    */
    public static ExtendedIterator<Triple> notifyingRemove( final Graph g, Iterator<Triple> i )
        {
        return new TrackingTripleIterator( i )
            {            
            protected final GraphEventManager gem = g.getEventManager();
            @Override
            public void remove()
                {

View Full Code Here

    }
  }


  @Override
  protected ExtendedIterator graphBaseFind(TripleMatch m) {
    return new TrackingTripleIterator(convert(filter(m)));
  }

View Full Code Here


    public void failingTestDoubleRemoveAll() {
        final Graph g = getGraph();
        if (g.getCapabilities().iteratorRemoveAllowed() ) {
            graphAdd(g,"c S d; e:ff GGG hhhh; _i J 27; Ell Em 'en'"  );
            Iterator<Triple> it = new TrackingTripleIterator(g.find(Triple.ANY)){
                @Override
                public void remove() {
                    super.remove(); // removes current
                    g.delete(current); // no-op.
                }
            };
            while (it.hasNext()) {
                it.next();
                it.remove();
            }
            assertTrue( g.isEmpty() );
        }
    }

View Full Code Here

        }
    }


    @Override
    protected ExtendedIterator graphBaseFind(TripleMatch m) {
        return new TrackingTripleIterator(convert(filter(m)));
    }

View Full Code Here

     * Answer an iterator which wraps <code>i</code> to ensure that if a .remove()
     * is executed on it, the graph <code>g</code> will be notified.
    */
    public static ExtendedIterator<Triple> notifyingRemove( final Graph g, Iterator<Triple> i )
        {
        return new TrackingTripleIterator( i )
            {            
            protected final GraphEventManager gem = g.getEventManager();
            @Override
            public void remove()
                {

View Full Code Here


    public void failingTestDoubleRemoveAll() {
        final Graph g = getGraph();
        if (g.getCapabilities().iteratorRemoveAllowed() ) {
            graphAdd(g,"c S d; e:ff GGG hhhh; _i J 27; Ell Em 'en'"  );
            Iterator<Triple> it = new TrackingTripleIterator(g.find(Triple.ANY)){
                @Override
                public void remove() {
                    super.remove(); // removes current
                    g.delete(current); // no-op.
                }
            };
            while (it.hasNext()) {
                it.next();
                it.remove();
            }
            assertTrue( g.isEmpty() );
        }
    }

View Full Code Here

     * Answer an iterator which wraps <code>i</code> to ensure that if a .remove()
     * is executed on it, the graph <code>g</code> will be notified.
    */
    public static ExtendedIterator<Triple> notifyingRemove( final Graph g, Iterator<Triple> i )
        {
        return new TrackingTripleIterator( i )
            {            
            protected final GraphEventManager gem = g.getEventManager();
            @Override
            public void remove()
                {

View Full Code Here

    
    public void failingTestDoubleRemoveAll() {
      final Graph g = getGraph();
      if (g.getCapabilities().iteratorRemoveAllowed() ) {
        graphAdd(g,"c S d; e:ff GGG hhhh; _i J 27; Ell Em 'en'"  );
        Iterator<Triple> it = new TrackingTripleIterator(g.find(Triple.ANY)){
          @Override
          public void remove() {
            super.remove(); // removes current
            g.delete(current); // no-op.
          }
        };
        while (it.hasNext()) {
          it.next();
          it.remove();
        }
        assertTrue( g.isEmpty() );
      }
    }

View Full Code Here


    public void failingTestDoubleRemoveAll() {
        final Graph g = getGraph();
        if (g.getCapabilities().iteratorRemoveAllowed() ) {
            graphAdd(g,"c S d; e:ff GGG hhhh; _i J 27; Ell Em 'en'"  );
            Iterator<Triple> it = new TrackingTripleIterator(g.find(Triple.ANY)){
                @Override
                public void remove() {
                    super.remove(); // removes current
                    g.delete(current); // no-op.
                }
            };
            while (it.hasNext()) {
                it.next();
                it.remove();
            }
            assertTrue( g.isEmpty() );
        }
    }

View Full Code Here

TOP

Related Classes of com.hp.hpl.jena.mem.TrackingTripleIterator

com.hp.hpl.jena.graph.impl.SimpleEventManager

com.hp.hpl.jena.graph.test.AbstractTestGraph

com.hp.hpl.jena.gvs.impl.FCAGraphImpl

org.apache.clerezza.rdf.jena.facade.JenaGraph

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.