> A perfect hash function is one that maps a finite set of keys into the same number of buckets with no collisions. To be even more precise, that's a minimal p

> A perfect hash function is one that maps a finite set of keys into the same number of buckets with no collisions. To be even more precise, that's a minimal perfect hash function. "Perfect" only means that it produces no collisions on that key set (F is injective). It is also "minimal" if the number of buckets (the codomain) has the same size as the input set (F is bijective).