public void testTerms3() { Triple t1 = triple("s p 1"); Triple t01 = triple("s p 01"); Graph base = newGraph(); base.add(t1); Delta delta = new Delta( base ) ; delta.add(t01); delta.delete(t01); delta.delete(t1); assertFalse(delta.getDeletions().contains(t01)); assertTrue(delta.getDeletions().contains(t1)); assertFalse(delta.getDeletions().contains(t01)); assertFalse(delta.getAdditions().contains(t01)); }
public void testTerms1() { Triple t1 = triple("s p 1"); Triple t01 = triple("s p 01"); Graph base = newGraph(); base.add(t1); Delta delta = new Delta( base ) ; delta.add(t01); assertTrue(delta.getAdditions().contains(triple("s p 01"))); assertFalse(delta.getAdditions().contains(triple("s p 1"))); assertTrue(delta.contains(t1)); assertTrue(delta.contains(t01)); }
public void testDeleteGoesToDeletions() { Graph base = graphWith( DEFAULT_TRIPLES ); Delta delta = new Delta( base ); delta.delete( triple( "x R y" ) ); assertIsomorphic(graphWith( DEFAULT_TRIPLES ), base); assertIsomorphic(graphWith( "x R y" ), delta.getDeletions()); assertIsomorphic(graphWith( "p S q" ), delta); }
protected Delta createNewGraph() { Graph g = memGraph(); Delta d = new Delta(g); map.put(d, g); return d;
/** * Find all the base triples matching tm, exclude the ones that are deleted, * add the ones that have been added. */ @Override protected ExtendedIterator<Triple> graphBaseFind(Triple t) { ExtendedIterator<Triple> iterator = base.find(t).filterDrop(ifIn(GraphUtil.findAll(deletions))).andThen(additions.find(t)) ; return SimpleEventManager.notifyingRemove( this, iterator ) ; }
@Override protected ExtendedIterator<Triple> graphBaseFind(Triple t) { //ExtendedIterator<Triple> base = super.graphBaseFind(t); ExtendedIterator<Triple> base = WrappedIterator.create(super.graphBaseFind(t).toList().iterator()); ExtendedIterator<Triple> fixed = WrappedIterator.create(new IteratorClosable<Triple>(new TrackingTripleIterator(base) { public void remove() { performDelete(current); }; }, () -> base.close())); return SimpleEventManager.notifyingRemove(this, fixed); } }
public void testTerms1() { Triple t1 = triple("s p 1"); Triple t01 = triple("s p 01"); Graph base = newGraph(); base.add(t1); Delta delta = new Delta( base ) ; delta.add(t01); assertTrue(delta.getAdditions().contains(triple("s p 01"))); assertFalse(delta.getAdditions().contains(triple("s p 1"))); assertTrue(delta.contains(t1)); assertTrue(delta.contains(t01)); }
public void testDeleteGoesToDeletions() { Graph base = graphWith( DEFAULT_TRIPLES ); Delta delta = new Delta( base ); delta.delete( triple( "x R y" ) ); assertIsomorphic(graphWith( DEFAULT_TRIPLES ), base); assertIsomorphic(graphWith( "x R y" ), delta.getDeletions()); assertIsomorphic(graphWith( "p S q" ), delta); }
protected Delta createNewGraph() { Graph g = memGraph(); Delta d = new Delta(g); map.put(d, g); return d;
/** * Find all the base triples matching tm, exclude the ones that are deleted, * add the ones that have been added. */ @Override protected ExtendedIterator<Triple> graphBaseFind(Triple t) { ExtendedIterator<Triple> iterator = base.find(t).filterDrop(ifIn(GraphUtil.findAll(deletions))).andThen(additions.find(t)) ; return SimpleEventManager.notifyingRemove( this, iterator ) ; }
public void testTerms3() { Triple t1 = triple("s p 1"); Triple t01 = triple("s p 01"); Graph base = newGraph(); base.add(t1); Delta delta = new Delta( base ) ; delta.add(t01); delta.delete(t01); delta.delete(t1); assertFalse(delta.getDeletions().contains(t01)); assertTrue(delta.getDeletions().contains(t1)); assertFalse(delta.getDeletions().contains(t01)); assertFalse(delta.getAdditions().contains(t01)); }
@Override protected Delta createNewGraph() { Graph g = memGraph(); Delta d = new Delta(g); map.put(d, g); return d; }
public void testAddAndDelete() { Graph base = graphWith( DEFAULT_TRIPLES ) ; Delta delta = new Delta( base ) ; delta.delete( triple( "a T b" ) ) ; delta.add( triple( "x R z" ) ) ; delta.delete( triple( "p S q" ) ) ; delta.add( triple( "a T b" ) ) ; assertIsomorphic(graphWith( DEFAULT_TRIPLES ), base); assertIsomorphic(graphWith( "a T b; x R z" ), delta.getAdditions()); assertIsomorphic(graphWith( "p S q" ), delta.getDeletions()); assertIsomorphic(graphWith( "x R y ; x R z; a T b" ), delta); }
@Override public Graph getGraph() { Graph gBase = graphWith( "" ); return new Delta( gBase ); }
public void testAddAndDelete() { Graph base = graphWith( DEFAULT_TRIPLES ) ; Delta delta = new Delta( base ) ; delta.delete( triple( "a T b" ) ) ; delta.add( triple( "x R z" ) ) ; delta.delete( triple( "p S q" ) ) ; delta.add( triple( "a T b" ) ) ; assertIsomorphic(graphWith( DEFAULT_TRIPLES ), base); assertIsomorphic(graphWith( "a T b; x R z" ), delta.getAdditions()); assertIsomorphic(graphWith( "p S q" ), delta.getDeletions()); assertIsomorphic(graphWith( "x R y ; x R z; a T b" ), delta); }
@Override protected Delta createNewGraph() { Graph g = memGraph(); Delta d = new Delta(g); map.put(d, g); return d; }
public void testTerms4() { Triple t1 = triple("s p 1"); Triple t01 = triple("s p 01"); Graph base = newGraph(); Delta delta = new Delta( base ) ; delta.add(t1); delta.delete(t01); assertFalse(delta.getDeletions().contains(triple("s p 01"))); assertTrue(delta.getDeletions().isEmpty()); assertTrue(delta.getAdditions().contains(triple("s p 1"))); assertFalse(delta.getAdditions().isEmpty()); } }
@Override public Graph getGraph() { Graph gBase = graphWith( "" ); return new Delta( gBase ); }
public void testTerms4() { Triple t1 = triple("s p 1"); Triple t01 = triple("s p 01"); Graph base = newGraph(); Delta delta = new Delta( base ) ; delta.add(t1); delta.delete(t01); assertFalse(delta.getDeletions().contains(triple("s p 01"))); assertTrue(delta.getDeletions().isEmpty()); assertTrue(delta.getAdditions().contains(triple("s p 1"))); assertFalse(delta.getAdditions().isEmpty()); } }
public void testDeltaMirrorsBase() { Graph base = graphWith( DEFAULT_TRIPLES ); Delta delta = new Delta( base ); assertIsomorphic(base, delta); }