svn commit: r1506856 - /jena/trunk/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/SolverLib.java

[andy]

Author: andy
Date: Thu Jul 25 09:18:08 2013
New Revision: 1506856

URL: http://svn.apache.org/r1506856
Log:
Add comment.

Modified:
    jena/trunk/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/SolverLib.java

Modified: 
jena/trunk/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/SolverLib.java
URL: 
http://svn.apache.org/viewvc/jena/trunk/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/SolverLib.java?rev=1506856&r1=1506855&r2=1506856&view=diff
==============================================================================
--- jena/trunk/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/SolverLib.java 
(original)
+++ jena/trunk/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/SolverLib.java 
Thu Jul 25 09:18:08 2013
@@ -289,6 +289,10 @@ public class SolverLib
         if ( exists ) {
             // Node exists but is it used in the quad position?
             NodeTupleTable ntt = ds.getQuadTable().getNodeTupleTable() ;
+            // Don't worry about abortable - this iterator should be fast
+            // (with normal indexing - at least one G???).
+            // Either it finds a starting point, or it doesn't.  We are only 
+            // interested in the first .hasNext.
             Iterator<Tuple<NodeId>> iter1 = ntt.find(nid, NodeId.NodeIdAny, 
NodeId.NodeIdAny, NodeId.NodeIdAny) ;
             if ( filter != null )
                 iter1 = Iter.filter(iter1, filter) ;