Re: Binary search tree

Eric Bezault wrote:
> Daniel Tuser wrote:
>> Just to make it clear, the binary search tree implementation is still 
>> not finished. There is still at least one bug and I didn't test it 
>> extensively.
>
> In that case, I suggest that I release a new version of Gobo
> first. Then I will have more time to review your code and see
> how to best integrate it with the existing classes.
>
Yes. We have enough time :-).

I just found a problem related to gec. I know that you try to make gec 
compatible to the compiler of Eiffel Software. The following class works 
with EiffelStudio but does not compile with gec. I didn't have time to 
have a closer look at the inheritance problem, so I just show you the 
problem as you are preparing a release. You certainly need the binary 
search tree classes from the previous post to compile the test.

class TEST_1

create

    make

feature {NONE}

    make is
           -- Creation procedure.
       local
          l_comparator: DS_COMPARABLE_COMPARATOR [STRING]
       do
          create l_comparator.make
          create tree.make (l_comparator)
       end

    tree: DS_AVL_TREE_SET [STRING]

end

-------------------------------------------------------------------------
This SF.net email is sponsored by the 2008 JavaOne(SM) Conference 
Don't miss this year's exciting event. There's still time to save $100. 
Use priority code J8TL2D2. 
http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone