You are viewing a plain text version of this content. The canonical link for it is here.

Posted to commits@jena.apache.org by an...@apache.org on 2013/05/01 21:37:05 UTC

svn commit: r1478155 - /jena/trunk/jena-arq/src/main/java/com/hp/hpl/jena/sparql/core/GraphViewDataset.java

Author: andy
Date: Wed May  1 19:36:56 2013
New Revision: 1478155

URL: http://svn.apache.org/r1478155
Log:
Better code comment.

Modified:
    jena/trunk/jena-arq/src/main/java/com/hp/hpl/jena/sparql/core/GraphViewDataset.java

Modified: jena/trunk/jena-arq/src/main/java/com/hp/hpl/jena/sparql/core/GraphViewDataset.java
URL: http://svn.apache.org/viewvc/jena/trunk/jena-arq/src/main/java/com/hp/hpl/jena/sparql/core/GraphViewDataset.java?rev=1478155&r1=1478154&r2=1478155&view=diff
==============================================================================
--- jena/trunk/jena-arq/src/main/java/com/hp/hpl/jena/sparql/core/GraphViewDataset.java (original)
+++ jena/trunk/jena-arq/src/main/java/com/hp/hpl/jena/sparql/core/GraphViewDataset.java Wed May  1 19:36:56 2013
@@ -107,7 +107,9 @@ public class GraphViewDataset extends Gr
 
     protected ExtendedIterator<Triple> graphUnionFind(Node s, Node p, Node o)
     {
-        // Implementation may wish to do better so this is separated out.
+        // Implementations may wish to do better so this is separated out.
+        // For example, Iter.distinctAdjacent is a lot cheaper than Iter.distinct
+        // but assumes thing come back in a particular order
         Iterator<Triple> iter = GLib.quads2triples(dsg.find(gn, s, p, o)) ;
         // Suppress duplicates after projecting to triples.
         iter = Iter.distinct(iter) ;