GNU gperf is a perfect hash function generator.
It was written by computer scientist Douglas Schmidt. The code is available under a copyleft license and is not allowed to be used within proprietary software.
Sidebar - what is a perfect hash function?
A perfect hash function has both a computer science meaning and a mathematical meaning, both of which are equivalent. It maps distinct elements in a set S to a set of integers with no collisions (mathematically; an injective function; or one-to-one function).
Sidebar - what is a perfect hash function generator?
A perfect hash function generator takes source data (list of keywords, let's say size N) and creates a (perfect) hash function.
It was written by computer scientist Douglas Schmidt. The code is available under a copyleft license and is not allowed to be used within proprietary software.
Sidebar - what is a perfect hash function?
A perfect hash function has both a computer science meaning and a mathematical meaning, both of which are equivalent. It maps distinct elements in a set S to a set of integers with no collisions (mathematically; an injective function; or one-to-one function).
Sidebar - what is a perfect hash function generator?
A perfect hash function generator takes source data (list of keywords, let's say size N) and creates a (perfect) hash function.
Posts
No comments:
Post a Comment