mirror of
https://git.savannah.gnu.org/git/gperf.git
synced 2025-12-02 13:09:22 +00:00
Initial revision
This commit is contained in:
30
doc/gperf_10.html
Normal file
30
doc/gperf_10.html
Normal file
@@ -0,0 +1,30 @@
|
||||
<HTML>
|
||||
<HEAD>
|
||||
<!-- This HTML file has been created by texi2html 1.51
|
||||
from gperf.texi on 15 April 1998 -->
|
||||
|
||||
<TITLE>User's Guide to gperf - 7 Implementation Details of GNU gperf</TITLE>
|
||||
</HEAD>
|
||||
<BODY>
|
||||
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_9.html">previous</A>, <A HREF="gperf_11.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_9.html">previous</A>, <A HREF="gperf_11.html">next</A>, <A HREF="gperf_11.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
|
||||
</BODY>
|
||||
</HTML>
|
||||
Reference in New Issue
Block a user