On Tue, 6 Jan 1998, Daniel Koepke wrote:
>On Tue, 6 Jan 1998, Mark A. Heilpern wrote:
>
>->Any other linear searches you can think of in the code that might
>->(or might not) benefit from a binary tree?
>
>Not to rain on anyone's parade, but I don't think any linear searches
>in Circle would benefit from binary trees. They don't have noticable
>impact on performance as is (they're actually binary searches at the
>time being), and I think the time spent on coding binary trees would
>be better spent on other things.
We're talking about user input and I doubt anyone has users that can type a
command every 1/10th of a second constantly to the point where it would
make a difference to have it a tree.
--
George Greer - Me@Null.net | Genius may have its limitations, but stupidity
http://www.van.ml.org/~greerga | is not thus handicapped. -- Elbert Hubbard
+------------------------------------------------------------+
| Ensure that you have read the CircleMUD Mailing List FAQ: |
| http://democracy.queensu.ca/~fletcher/Circle/list-faq.html |
+------------------------------------------------------------+
This archive was generated by hypermail 2b30 : 12/15/00 PST