Return a theoretical upper bound on the largest number of elements that this hash‐table could possibly hold. Note that there is no guarantee that the hash‐table can successfully grow to the returned size, or even close to that size without running out of resources.