Re: Binary search tree
"Colin Adams" <[email protected]>
| Newsgroups | gmane.comp.lang.eiffel.gobo.devel |
|---|---|
| Message-ID | <[email protected]> |
On 24/04/2008, Daniel Tuser <[email protected]> wrote: > > Some of the routines are too long to read on the screen. > > > > > I don't like that as well. Those are the algorithms that could also be > implemented as recursive features. I will see what I can do to improve that. > But I will not make them recursive. > A splitting into more features is also not easy as some features would > require about 4 or 5 arguments. I was already working on that but stopped > because the resulting code was not more readable. It could be done using > attributes. But it would take some time. > Do you think that has to be changed? I would say yes, provided there is no significant performance impact. I don't think passing 5 arguments is a reason not to do it, as the routines receiving 5 arguments are all secret. ------------------------------------------------------------------------- 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