Hashtable lookups are O(1). What are you complaining about? If they did this in plain C they'd probably end up using binary search trees and then everything would be slower.