Re: Object Euphoria optimiztion
Look, Mike, let's not dwell on it. Originally, you gave bad advice, on
that single point, and I tried to be polite about it. You compounded
your mistake by supplying phony evidence. We all make mistakes, that's
nothing tragic, it's the fastest way to learn.
How you solve your search problem is, of course, up to you. But
remnants of my common sense tell me (people in the OO camp are not
terrible well known for it - sorry about the cheap crack ;)) a very
reasonable approach, for small to medium sized sets, would be to keep
the most frequently used elements simply at the beginning of the
sequence. For larger sets, at least some hundreds, possibly thousands
of items, you can choose from any number of hash table schemes, or
simply sort the thing and employ a binary search or whatever, they all
would be just as good, and probably better, than what you are
proposing.
Btw, quite unreasonably, the topic has been abandoned at this end!
jiri
|
Not Categorized, Please Help
|
|
