Gperf
This entry published by the Free Software Foundation.
Gperf
http://www.gnu.org/software/gperf/gperf.html
GNU 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.
Documentation
User manual available from http://www.gnu.org/software/gperf/manual/
Related Projects
Licensing
| License | Verified by | Verified on | Notes |
|---|---|---|---|
| GPLv2 | Kelly Hopkins | 2454867.55 February 2009 | |
| GPLv3orlater | Kelly Hopkins | 2454867.55 February 2009 |
Leaders and contributors
| Contact(s) | Role |
|---|---|
|
| Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Bug Tracking,Developer,Support | mailto:bug-gnu-gperf@gnu.org |
Software prerequisites
| Kind | Description |
|---|---|
| Required to use | libc6 |
| Required to use | libstdc++ 2.9 |
Click here if you'd like to report a problem or make a suggestion that could
This entry (in part or in whole) was last reviewed on 27 June 2007.
Problem with this listing?
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 described in this text has its own copyright notice and license, which can usually be found in the distribution itself.
This page was last modified on 12 April 2011, at 13:30.

