/** * <p> * Answer an iterator over the triples in the union of the graphs in this composition. <b>Note</b> * that the requirement to remove duplicates from the union means that this will be an * expensive operation for large (and especially for persistent) graphs. * </p> * * @param t The matcher to match against * @return An iterator of all triples matching t in the union of the graphs. */ @Override public ExtendedIterator<Triple> graphBaseFind( final Triple t ) { // optimise the case where there's only one component graph. ExtendedIterator<Triple> found = optimiseOne() ? singleGraphFind( t ) : multiGraphFind( t ); return SimpleEventManager.notifyingRemove( MultiUnion.this, found ); }
/** * <p> * Answer an iterator over the triples in the union of the graphs in this composition. <b>Note</b> * that the requirement to remove duplicates from the union means that this will be an * expensive operation for large (and especially for persistent) graphs. * </p> * * @param t The matcher to match against * @return An iterator of all triples matching t in the union of the graphs. */ @Override public ExtendedIterator<Triple> graphBaseFind( final Triple t ) { // optimise the case where there's only one component graph. ExtendedIterator<Triple> found = optimiseOne() ? singleGraphFind( t ) : multiGraphFind( t ); return SimpleEventManager.notifyingRemove( MultiUnion.this, found ); }