Is TMap always fast?
No. It depends on how you use it. It's implemented as a Red-Black Tree. If you want the fastest possible lookup, you should go for a Radix Tree like say, a Patricia Tree.As far as I can tell though, nobody has so far made such a data structure in BlitzMAX. Could be wrong tho' so it probably wouldn't hurt to search the Code Archives for Radix.