perfect hash function generator
Gperf is a perfect hash function generator. For a given list of strings, it produces a hash function and hash table in the form of C or C++ code, for looking up a value depending on the input string. The hash function is perfect, which means that the hash table has no collisions, and the hash table lookup needs a single string comparison only.
GNU gperf is highly customizable. There are options for generating C and C++ code, for emitting 'switch' statements or nested 'ifs' instead of a hash table, and for tuning the algorithm that gperf uses.
released on 5 January 2017
git clone git://git.sv.gnu.org/gperf.git
|License||Verified by||Verified on||Notes|
|License:GPLv3orlater||Genium||13 January 2017|
Leaders and contributors
Resources and communication
|VCS Repository Webview||https://git.savannah.gnu.org/cgit/gperf.git|
|Required to use||libstdc++ 2.9|
|Required to use||libc6|
This entry (in part or in whole) was last reviewed on 2 May 2018.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.