Tidy comments.

Project: http://git-wip-us.apache.org/repos/asf/jena/repo
Commit: http://git-wip-us.apache.org/repos/asf/jena/commit/15e4e8fb
Tree: http://git-wip-us.apache.org/repos/asf/jena/tree/15e4e8fb
Diff: http://git-wip-us.apache.org/repos/asf/jena/diff/15e4e8fb

Branch: refs/heads/hadoop-rdf
Commit: 15e4e8fb8354a3f6e1485c1653a7c509cd752063
Parents: 8b54987
Author: Andy Seaborne <a...@apache.org>
Authored: Tue Nov 11 15:38:23 2014 +0000
Committer: Andy Seaborne <a...@apache.org>
Committed: Tue Nov 11 15:38:23 2014 +0000

----------------------------------------------------------------------
 .../java/com/hp/hpl/jena/tdb/solver/StageMatchTuple.java | 11 ++++-------
 1 file changed, 4 insertions(+), 7 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/jena/blob/15e4e8fb/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/StageMatchTuple.java
----------------------------------------------------------------------
diff --git 
a/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/StageMatchTuple.java 
b/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/StageMatchTuple.java
index ab6fbe8..5287334 100644
--- a/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/StageMatchTuple.java
+++ b/jena-tdb/src/main/java/com/hp/hpl/jena/tdb/solver/StageMatchTuple.java
@@ -101,21 +101,18 @@ public class StageMatchTuple extends 
RepeatApplyIterator<BindingNodeId>
         if ( anyGraphs )
         {
             iterMatches = Iter.operate(iterMatches, quadsToAnyTriples) ;
-            // If any slots were set, then the index would be ???G and we can 
use distinctAdjacent.
-            // If all slots are unset, the index is probably GSPO (SPOG would 
be better in this one case). 
-            // This is a safe, if potentially costly, choice. 
-            
             //Guaranteed 
             //iterMatches = Iter.distinct(iterMatches) ;
             
-            // This depends on the way indexes are choose and
+            // This depends on the way indexes are chosen and
             // the indexing pattern. It assumes that the index 
             // chosen ends in G so same triples are adjacent 
             // in a union query.
+            // 
             // If any slot is defined, then the index will be X??G.
-            // if no slot is defined, then the index will be ???G.
+            // If no slot is defined, then the index will be ???G.
+            // But the  TupleTable
             //  See TupleTable.scanAllIndex that ensures the latter.
-            //  The former assumes indexes are either G... or ...G.
             //  No G part way through.
             iterMatches = Iter.distinctAdjacent(iterMatches) ;
         }

Reply via email to