Is TMap always fast? I'm not entirely sure how it works, but does it internally run through the whole given data to find a match?
It's a binary tree internally, I think. So a search through it is a binary search. It's always fast if you have a lot of data to search through which can be sorted on a key, yeah. Of course, it takes longer to insert and remove items because they have to be inserted to the correct place in the map. But in a dictionary, you don't remove and insert words very often, if at all, so there's no downside.