Re: Binary search tree
Eric Bezault <[email protected]>
| Newsgroups | gmane.comp.lang.eiffel.gobo.devel |
|---|---|
| Message-ID | <[email protected]> |
Daniel Tuser wrote: > Eric Bezault wrote: >> Hi Daniel, >> >> Is there a reason why `void_is_valid_key' is False >> in DS_BINARY_SEARCH_TREE? For example in DS_HASH_TABLE >> it is possible to have void keys. And the algorithms >> seem to work with void anyway since `void_is_valid_key' >> is True in DS_BINARY_SEARCH_TREE_SET. I think that it >> would make the interface simplier if we could get rid >> of this feature `void_is_valid_key'. > I will have a closer look at it as I have more time next week. If it > works in the void case too, you probably found an artifact I missed. I just wrote test cases and it works fine. -- Eric Bezault mailto:[email protected] http://www.gobosoft.com ------------------------------------------------------------------------- This SF.Net email is sponsored by the Moblin Your Move Developer's challenge Build the coolest Linux based applications with Moblin SDK & win great prizes Grand prize is a trip for two to an Open Source event anywhere in the world http://moblin-contest.org/redirect.php?banner_id=100&url=/