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 2011/06/19 21:20:14 UTC

svn commit: r1137416 - in /incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix: RadixNode.java RadixTree.java

Author: andy
Date: Sun Jun 19 19:20:14 2011
New Revision: 1137416

URL: http://svn.apache.org/viewvc?rev=1137416&view=rev
Log: (empty)

Modified:
    incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixNode.java
    incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixTree.java

Modified: incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixNode.java
URL: http://svn.apache.org/viewvc/incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixNode.java?rev=1137416&r1=1137415&r2=1137416&view=diff
==============================================================================
--- incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixNode.java (original)
+++ incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixNode.java Sun Jun 19 19:20:14 2011
@@ -155,7 +155,6 @@ public final class RadixNode //extends P
                 // No bytes is lowest 
                 continue ;
             
-            
             int x = Bytes.compareByte(b, nodes.get(i).prefix[0]) ;
             //int x = compare(bytes, start, nodes.get(i).prefix) ;
             if ( x > 0 ) 

Modified: incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixTree.java
URL: http://svn.apache.org/viewvc/incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixTree.java?rev=1137416&r1=1137415&r2=1137416&view=diff
==============================================================================
--- incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixTree.java (original)
+++ incubator/jena/Scratch/AFS/trunk/src-lib/structure/radix/RadixTree.java Sun Jun 19 19:20:14 2011
@@ -230,7 +230,7 @@ public final class RadixTree
                 int split = node.locate(node1.prefix, 0) ;
                 if ( checking )
                 {
-                    if ( split > 0 )
+                    if ( split >= 0 )
                         error("Found prefix for new inserted key") ;
                 }
                 split = -(split+1) ;