Adwaith-Rajesh/gperf
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/gperf.git synced 2025-12-02 13:09:22 +00:00
Code Activity

Regenerated.

Browse Source
This commit is contained in:
Bruno Haible
2007-03-31 15:43:28 +00:00
parent 420a908211
commit faae53d552
16 changed files with 2050 additions and 1683 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
doc/gperf_4.html
View File

@@ -1,7 +1,7 @@
<HTML>
<HEAD>
<!-- This HTML file has been created by texi2html 1.52
from gperf.texi on 22 January 2006 -->
<!-- This HTML file has been created by texi2html 1.51
from gperf.texi on 31 March 2007 -->
<TITLE>Perfect Hash Function Generator - 2 Static search structures and GNU gperf</TITLE>
</HEAD>
@@ -16,7 +16,7 @@ Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_3.html">previous</A>,
</P>
<P>
A <EM>static search structure</EM> is an Abstract Data Type with certain
A <STRONG>static search structure</STRONG> is an Abstract Data Type with certain
fundamental operations, e.g., <EM>initialize</EM>, <EM>insert</EM>,
and <EM>retrieve</EM>. Conceptually, all insertions occur before any
retrievals. In practice, <CODE>gperf</CODE> generates a <EM>static</EM> array
@@ -26,7 +26,7 @@ insertions. It is a useful data structure for representing <EM>static
search sets</EM>. Static search sets occur frequently in software system
applications. Typical static search sets include compiler reserved
words, assembler instruction opcodes, and built-in shell interpreter
commands. Search set members, called <EM>keywords</EM>, are inserted into
commands. Search set members, called <STRONG>keywords</STRONG>, are inserted into
the structure only once, usually during program initialization, and are
not generally modified at run-time.