It has a mostly identical interface toTMapand is designed as a drop in replacement. Keys must be unique, there is no equivalent sorted version ofTMultiMap. It uses half as much memory asTMap, but adding and removing elements is O(n), and finding is O(Log n). In practice it is faster thanTMapfor low element counts, and slower as n increases, This map is always kept sorted by the key type so cannot be sorted manually.