TMap<> is a hashed key/value pair. TArray<> is a contiguous block of memory holding T items and accessed by Index. If the number of items is large and your key hashes well, then a TMap will be faster than a linear search through a TArray. If N is small, then a linear search can be faster depending on the size of T and the size of a cache line
2 Likes