I guess sets and dicts are two different things. Maybe one of them was originally implemented as some sort of tree rather than a hash table? Dunno.

Hash tables are heavily used within the kernel to speed access to objects of interest. Using a hash table will be faster than, say, a linear search through a single list, but there is always value in ...