 So goes in Bucket E.

Below is the extendible hashing algorithm in Python, with the disc block / memory page association, caching and consistency issues removed.Note a problem exists if the depth exceeds the bit size of an integer, because then doubling of the directory or splitting of a bucket won't allow entries to be rehashed to different buckets.The code uses the "least significant bits", which makes it more efficient to expand the table, as the entire directory can be copied as one block ().