Highly efficient key-value storage. Maps keys to indices via a hash function for $O(1)$ average time complexity.
1function put(key, val):2 idx = hash(key)3 bucket = table[idx]4 if key exists: update(val)5 else: bucket.append({key, val})
Enter key-value pairs to store.