Yes, it uses a binary search. It isn't really designed for sorting altho of course it does do that as a by product. It's mostly for quick access when you have large amounts of data. I wouldn't describe it as being like a TList. A TList is a linked list, a TMap is a binary tree. :)
You might be using TLists like they are TMaps, but unless you have items which share the same name then you probably should be using TMaps (even items with the same name could be easily worked into TMaps tho). Might work out quite a bit faster.
You might be using TLists like they are TMaps, but unless you have items which share the same name then you probably should be using TMaps (even items with the same name could be easily worked into TMaps tho). Might work out quite a bit faster.