/** Answer true if the graph contains any triple matching <code>t</code>. The default implementation uses <code>find</code> and checks to see if the iterator is non-empty. */ protected boolean graphBaseContains( Triple t ) { return containsByFind( t ); }