Hash tables are good for fast lockups, but they are bigger than other primitive data structures.
In Python you can use the dict, which is an implementation of hash tables.
If you use Python 3.6+, the order is also preserved, which is not common.
I don't know pandas very well and it's implementation. If pandas uses hash-lookup, then it's fast.
If not, then it's slow.
How big is the table you want to lookup?
In Python you can use the dict, which is an implementation of hash tables.
If you use Python 3.6+, the order is also preserved, which is not common.
I don't know pandas very well and it's implementation. If pandas uses hash-lookup, then it's fast.
If not, then it's slow.
How big is the table you want to lookup?
Almost dead, but too lazy to die: https://sourceserver.info
All humans together. We don't need politicians!
All humans together. We don't need politicians!