summaryrefslogtreecommitdiff
path: root/doc/gperf_9.html
blob: e9c933d9c46621c3a59bcb289c2221f4c7d3f215 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
<HTML>
<HEAD>
<!-- This HTML file has been created by texi2html 1.51
     from gperf.texi on 26 September 2000 -->

<TITLE>Perfect Hash Function Generator - 7  Implementation Details of GNU gperf</TITLE>
</HEAD>
<BODY>
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_8.html">previous</A>, <A HREF="gperf_10.html">next</A>, <A HREF="gperf_11.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
<P><HR><P>


<H1><A NAME="SEC22" HREF="gperf_toc.html#TOC22">7  Implementation Details of GNU <CODE>gperf</CODE></A></H1>

<P>
A paper describing the high-level description of the data structures and
algorithms used to implement <CODE>gperf</CODE> will soon be available.  This
paper is useful not only from a maintenance and enhancement perspective,
but also because they demonstrate several clever and useful programming
techniques, e.g., `Iteration Number' boolean arrays, double
hashing, a "safe" and efficient method for reading arbitrarily long
input from a file, and a provably optimal algorithm for simultaneously
determining both the minimum and maximum elements in a list.

</P>

<P><HR><P>
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_8.html">previous</A>, <A HREF="gperf_10.html">next</A>, <A HREF="gperf_11.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
</BODY>
</HTML>