Assertion: tree's time | /r/CapableOf | spend evaluating the hash
Facets:
Source sentences:
text: The worst-case lookup speed in an imperfect hash table is O(N) time, but far more typically is O(1), with O(m) time spent evaluating the hash.