Re: [rules-dev] range indexing - help wanted
Removing the line marked with //>>> helps.
public void recurse() {
if ( depth == stack.length - 1 ) {
// increase the stack if we have used up all space
//>>> stack = new int[depth * 3 ];
stack = Arrays.copyOf( stack, stack.length * 3 );
}
Cheers
Wolfgang
On 07/07/2012, Mark Proctor <mproctor(a)codehaus.org> wrote:
I started to write this range indexing class, based on a RBTree
implementation that I lifted from the web somewhere. However it's a bit
buggy, and large ranges null pointer. Anyone want to work on making
these stable? Once done we can start using them with not/exists nodes.
Standard joins will take a bit more work, due to some integration issues
of the tuple structures.
The two classes can be found in this commit, just try removing the
@Ignore to see the issues, and feel free to add more range tests.
https://github.com/droolsjbpm/drools/commit/c789459c431763581db02653fb7bf...
drools-core/src/main/java/org/drools/core/util/RBTree.java
drools-core/src/test/java/org/drools/core/util/RBTreeTest.java
Mark
_______________________________________________
rules-dev mailing list
rules-dev(a)lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-dev