For binary search, do normal string sort on the keys, and then assign hash values from 0 to N-1. Then go ahead with the normal logic that is there for perfect hashing.
source not stored for this graph (policy: none)
no test coverage detected