Re: [gobo-eiffel-develop] Binary search tree

[Daniel T. <dan...@gm...>]

The test cases for binary search trees are now written. The attachment 
also contains some modifications.
I've got a proposals for the class hierarchy of the DS_* classes. I 
would like to have DS_BILINEAR_TABLE and DS_BILINEAR_SET. And 
DS_SPARSE_TABLE inherits DS_BILINEAR_TABLE and DS_SPARSE_SET inherits 
DS_BILINIEAR_SET. In the attachment the binary search tree 
implementation already uses DS_BILINEAR_TABLE. In my opinion it makes 
sense to have a common ancestor for hash table and binary search trees 
that has both the table and cursor features.
I am working on a set implementation based on binary search trees. That 
is why I would like to have DS_BILINEAR_SET as well. I am trying to make 
it very much like hash table and hash set. The goal is actually to get 
an abstraction of binary search tree that can be reused for the set 
implementation.
Feedback is still welcome. Colin, are the features still too long?