| www.delorie.com/gnu/docs/gperf/gperf_17.html | search |
![]() Buy GNU books! | |
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
struct.
Perfect_Hash.
isalnum and isgraph do
not guarantee that a character is in this range. Only an explicit
test like `c >= 'A' && c <= 'Z'' guarantees this.) This was the
default in versions of gperf earlier than 2.7; now the default is
to assume 8-bit characters.
strncmp function to perform
string comparisons. The default action is to use strcmp.
<jjc@ai.mit.edu>.
<string.h>, at the
beginning of the code. By default, this is not done; the user must
include this header file himself to allow compilation of the code.
switch statement scheme,
rather than an array lookup table. This can lead to a reduction in both
time and space requirements for some keyfiles. The argument to this
option determines how many switch statements are generated. A
value of 1 generates 1 switch containing all the elements, a
value of 2 generates 2 tables with 1/2 the elements in each
switch, etc. This is useful since many C compilers cannot
correctly generate code for large switch statements. This option
was inspired in part by Keith Bostic's original C program.
gperf. It does not do anything.
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
| webmaster donations bookstore | delorie software privacy |
| Copyright © 2003 by The Free Software Foundation | Updated Jun 2003 |