Dev list for Drools rule engine ()

Mark Proctor | 8 Jul 2012 12:55

Re: [rules-dev] range indexing - help wanted

On 07/07/2012 07:13, Wolfgang Laun wrote:
> Also, found this is in RBTree.java, where it doesn't belong?
>     import org.junit.Test;
> -W
It's a rough but of unfinished code, that mostly, but not completely 
works. Feel free to run with it how you wish.

Mark
>
>
> On 07/07/2012, Wolfgang Laun <wolfgang.laun <at> gmail.com> wrote:
>> 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 <at> 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.

(Continue reading)

headers

Mark Proctor | 8 Jul 2012 12:57

Re: [rules-dev] range indexing - help wanted

On 08/07/2012 11:55, Mark Proctor wrote:
> On 07/07/2012 07:13, Wolfgang Laun wrote:
>> Also, found this is in RBTree.java, where it doesn't belong?
>>     import org.junit.Test;
>> -W
> It's a rough but of unfinished code, that mostly, but not completely 
> works. Feel free to run with it how you wish.
note the code is not in master and was deleted some time ago, so anyone 
wishing to use it as a starting point, will need to recover it from the 
listed commit.

Mark
>
> Mark
>>
>>
>> On 07/07/2012, Wolfgang Laun <wolfgang.laun <at> gmail.com> wrote:
>>> 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
>>>

(Continue reading)

headers

Wolfgang Laun | 8 Jul 2012 13:54

Re: [rules-dev] range indexing - help wanted

Did you miss my first mail identifying the problem of the failing
tests marked with  <at> Ignore?
-W

On 08/07/2012, Mark Proctor <mproctor <at> codehaus.org> wrote:
> On 08/07/2012 11:55, Mark Proctor wrote:
>> On 07/07/2012 07:13, Wolfgang Laun wrote:
>>> Also, found this is in RBTree.java, where it doesn't belong?
>>>     import org.junit.Test;
>>> -W
>> It's a rough but of unfinished code, that mostly, but not completely
>> works. Feel free to run with it how you wish.
> note the code is not in master and was deleted some time ago, so anyone
> wishing to use it as a starting point, will need to recover it from the
> listed commit.
>
> Mark
>>
>> Mark
>>>
>>>
>>> On 07/07/2012, Wolfgang Laun <wolfgang.laun <at> gmail.com> wrote:
>>>> 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 );

(Continue reading)