/** * Flush out all cached results. Future queries have to start from scratch. */ @Override public synchronized void reset() { version++; bEngine.reset(); this.setPreparedState(false); }
/** * Flush out all cached results. Future queries have to start from scratch. */ @Override public synchronized void reset() { version++; bEngine.reset(); this.setPreparedState(false); }
/** * Cause the inference graph to reconsult the underlying graph to take * into account changes. Normally changes are made through the InfGraph's add and * remove calls are will be handled appropriately. However, in some cases changes * are made "behind the InfGraph's back" and this forces a full reconsult of * the changed data. */ @Override public void rebind() { version++; if (bEngine != null) bEngine.reset(); this.setPreparedState(false); }
/** * Cause the inference graph to reconsult the underlying graph to take * into account changes. Normally changes are made through the InfGraph's add and * remove calls are will be handled appropriately. However, in some cases changes * are made "behind the InfGraph's back" and this forces a full reconsult of * the changed data. */ @Override public void rebind() { version++; if (bEngine != null) bEngine.reset(); this.setPreparedState(false); }
fdata.getGraph().add(t); if (useTGCCaching) { if (transitiveEngine.add(t)) this.setPreparedState(false); this.setPreparedState(false); } else { engine.add(t);
fdata.getGraph().add(t); if (useTGCCaching) { if (transitiveEngine.add(t)) this.setPreparedState(false); this.setPreparedState(false); } else { engine.add(t);
/** * Removes the triple t (if possible) from the set belonging to this graph. */ @Override public void performDelete(Triple t) { version++; //boolean removeIsFromBase = fdata.getGraph().contains(t); fdata.getGraph().delete(t); if (useTGCCaching) { if (transitiveEngine.delete(t)) { if (this.isPrepared()) { bEngine.deleteAllRules(); } this.setPreparedState(false); } } // Full incremental remove processing requires reference counting // of all deductions. It's not clear the cost of maintaining the // reference counts is worth it so the current implementation // forces a recompute if any external deletes are performed. if (this.isPrepared()) { bEngine.deleteAllRules(); this.setPreparedState(false); // Re-enable the code below when/if ref counting is added and remove above // if (removeIsFromBase) engine.delete(t); } bEngine.reset(); }
/** * Removes the triple t (if possible) from the set belonging to this graph. */ @Override public void performDelete(Triple t) { version++; //boolean removeIsFromBase = fdata.getGraph().contains(t); fdata.getGraph().delete(t); if (useTGCCaching) { if (transitiveEngine.delete(t)) { if (this.isPrepared()) { bEngine.deleteAllRules(); } this.setPreparedState(false); } } // Full incremental remove processing requires reference counting // of all deductions. It's not clear the cost of maintaining the // reference counts is worth it so the current implementation // forces a recompute if any external deletes are performed. if (this.isPrepared()) { bEngine.deleteAllRules(); this.setPreparedState(false); // Re-enable the code below when/if ref counting is added and remove above // if (removeIsFromBase) engine.delete(t); } bEngine.reset(); }
if (this.isPrepared()) return; this.setPreparedState(true);
if (this.isPrepared()) return; this.setPreparedState(true);