Each map node should have a double ]lots[/b] of stuff on it, you'll need a fast way to find stuff on the node.Originally Posted by Gadget
For this? Yes. While adds are O(1), removals are O(N) operations.I wonder if TList are slow to use?
It would help if you posted more info on this.
Bookmarks