mirror of
https://git.savannah.gnu.org/git/gperf.git
synced 2025-12-02 13:09:22 +00:00
Regenerated.
This commit is contained in:
BIN
doc/gperf.dvi
BIN
doc/gperf.dvi
Binary file not shown.
@@ -1,14 +1,14 @@
|
||||
<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</TITLE>
|
||||
</HEAD>
|
||||
<BODY>
|
||||
<H1>User's Guide to <CODE>gperf</CODE> 3.0.2</H1>
|
||||
<H1>User's Guide to <CODE>gperf</CODE> 3.0.3</H1>
|
||||
<H2>The GNU Perfect Hash Function Generator</H2>
|
||||
<H2>Edition 3.0.2, 22 January 2006</H2>
|
||||
<H2>Edition 3.0.3, 31 March 2007</H2>
|
||||
<ADDRESS>Douglas C. Schmidt</ADDRESS>
|
||||
<ADDRESS>Bruno Haible</ADDRESS>
|
||||
<P>
|
||||
@@ -570,7 +570,7 @@ or from <CODE>http://www.cs.wustl.edu/~schmidt/resume.html</CODE>.
|
||||
|
||||
</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
|
||||
@@ -580,7 +580,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.
|
||||
|
||||
@@ -654,7 +654,7 @@ efficiently identify their respective reserved keywords.
|
||||
The perfect hash function generator <CODE>gperf</CODE> reads a set of
|
||||
"keywords" from an input file (or from the standard input by
|
||||
default). It attempts to derive a perfect hashing function that
|
||||
recognizes a member of the <EM>static keyword set</EM> with at most a
|
||||
recognizes a member of the <STRONG>static keyword set</STRONG> with at most a
|
||||
single probe into the lookup table. If <CODE>gperf</CODE> succeeds in
|
||||
generating such a function it produces a pair of C source code routines
|
||||
that perform hashing and table lookup recognition. All generated C code
|
||||
@@ -1211,7 +1211,7 @@ functions
|
||||
</P>
|
||||
<P>
|
||||
Several options control how the generated C code appears on the standard
|
||||
output. Two C function are generated. They are called <CODE>hash</CODE> and
|
||||
output. Two C functions are generated. They are called <CODE>hash</CODE> and
|
||||
<CODE>in_word_set</CODE>, although you may modify their names with a command-line
|
||||
option. Both functions require two arguments, a string, <CODE>char *</CODE>
|
||||
<VAR>str</VAR>, and a length parameter, <CODE>int</CODE> <VAR>len</VAR>. Their default
|
||||
@@ -1224,7 +1224,7 @@ function prototypes are as follows:
|
||||
<DD><A NAME="IDX35"></A>
|
||||
By default, the generated <CODE>hash</CODE> function returns an integer value
|
||||
created by adding <VAR>len</VAR> to several user-specified <VAR>str</VAR> byte
|
||||
positions indexed into an <EM>associated values</EM> table stored in a
|
||||
positions indexed into an <STRONG>associated values</STRONG> table stored in a
|
||||
local static array. The associated values table is constructed
|
||||
internally by <CODE>gperf</CODE> and later output as a static local C array
|
||||
called <SAMP>`hash_table'</SAMP>. The relevant selected positions (i.e. indices
|
||||
@@ -1970,34 +1970,7 @@ Foundation, 1989.
|
||||
<H1><A NAME="SEC28" HREF="gperf.html#TOC28">Concept Index</A></H1>
|
||||
|
||||
<P>
|
||||
Jump to:
|
||||
<A HREF="#cindex_%">%</A>
|
||||
-
|
||||
<A HREF="#cindex_a">a</A>
|
||||
-
|
||||
<A HREF="#cindex_b">b</A>
|
||||
-
|
||||
<A HREF="#cindex_c">c</A>
|
||||
-
|
||||
<A HREF="#cindex_d">d</A>
|
||||
-
|
||||
<A HREF="#cindex_f">f</A>
|
||||
-
|
||||
<A HREF="#cindex_h">h</A>
|
||||
-
|
||||
<A HREF="#cindex_i">i</A>
|
||||
-
|
||||
<A HREF="#cindex_j">j</A>
|
||||
-
|
||||
<A HREF="#cindex_k">k</A>
|
||||
-
|
||||
<A HREF="#cindex_m">m</A>
|
||||
-
|
||||
<A HREF="#cindex_n">n</A>
|
||||
-
|
||||
<A HREF="#cindex_s">s</A>
|
||||
<P>
|
||||
<H2><A NAME="cindex_%">%</A></H2>
|
||||
<H2>%</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX8"><SAMP>`%%'</SAMP></A>
|
||||
<LI><A HREF="gperf.html#IDX18"><SAMP>`%7bit'</SAMP></A>
|
||||
@@ -2026,56 +1999,56 @@ Jump to:
|
||||
<LI><A HREF="gperf.html#IDX32"><SAMP>`%{'</SAMP></A>
|
||||
<LI><A HREF="gperf.html#IDX33"><SAMP>`%}'</SAMP></A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_a">a</A></H2>
|
||||
<H2>a</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX43">Array name</A>, <A HREF="gperf.html#IDX44">Array name</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_b">b</A></H2>
|
||||
<H2>b</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX1">Bugs</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_c">c</A></H2>
|
||||
<H2>c</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX42">Class name</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_d">d</A></H2>
|
||||
<H2>d</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX5">Declaration section</A>
|
||||
<LI><A HREF="gperf.html#IDX39">Delimiters</A>
|
||||
<LI><A HREF="gperf.html#IDX46">Duplicates</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_f">f</A></H2>
|
||||
<H2>f</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX4">Format</A>
|
||||
<LI><A HREF="gperf.html#IDX7">Functions section</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_h">h</A></H2>
|
||||
<H2>h</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX35">hash</A>
|
||||
<LI><A HREF="gperf.html#IDX34">hash table</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_i">i</A></H2>
|
||||
<H2>i</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX36">in_word_set</A>
|
||||
<LI><A HREF="gperf.html#IDX41">Initializers</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_j">j</A></H2>
|
||||
<H2>j</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX47">Jump value</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_k">k</A></H2>
|
||||
<H2>k</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX6">Keywords section</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_m">m</A></H2>
|
||||
<H2>m</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX3">Minimal perfect hash functions</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_n">n</A></H2>
|
||||
<H2>n</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX38">NUL</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_s">s</A></H2>
|
||||
<H2>s</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf.html#IDX40">Slot name</A>
|
||||
<LI><A HREF="gperf.html#IDX2">Static search structure</A>
|
||||
@@ -2084,8 +2057,8 @@ Jump to:
|
||||
|
||||
</P>
|
||||
<P><HR><P>
|
||||
This document was generated on 22 January 2006 using the
|
||||
<A HREF="http://wwwinfo.cern.ch/dis/texi2html/">texi2html</A>
|
||||
translator version 1.52.</P>
|
||||
This document was generated on 31 March 2007 using the
|
||||
<A HREF="http://wwwcn.cern.ch/dci/texi2html/">texi2html</A>
|
||||
translator version 1.51.</P>
|
||||
</BODY>
|
||||
</HTML>
|
||||
|
||||
@@ -6,7 +6,7 @@ START-INFO-DIR-ENTRY
|
||||
END-INFO-DIR-ENTRY
|
||||
|
||||
This file documents the features of the GNU Perfect Hash Function
|
||||
Generator 3.0.2.
|
||||
Generator 3.0.3.
|
||||
|
||||
Copyright (C) 1989-2006 Free Software Foundation, Inc.
|
||||
|
||||
@@ -1019,7 +1019,7 @@ File: gperf.info, Node: Output Format, Next: Binary Strings, Prev: Input Form
|
||||
===================================================
|
||||
|
||||
Several options control how the generated C code appears on the standard
|
||||
output. Two C function are generated. They are called `hash' and
|
||||
output. Two C functions are generated. They are called `hash' and
|
||||
`in_word_set', although you may modify their names with a command-line
|
||||
option. Both functions require two arguments, a string, `char *' STR,
|
||||
and a length parameter, `int' LEN. Their default function prototypes
|
||||
@@ -1692,17 +1692,17 @@ Node: Keywords43182
|
||||
Node: Functions45127
|
||||
Node: Controls for GNU indent45662
|
||||
Node: Output Format46610
|
||||
Node: Binary Strings49401
|
||||
Node: Options50549
|
||||
Node: Output File51335
|
||||
Node: Input Details51727
|
||||
Node: Output Language53563
|
||||
Node: Output Details54979
|
||||
Node: Algorithmic Details62243
|
||||
Node: Verbosity67500
|
||||
Node: Bugs68211
|
||||
Node: Projects69804
|
||||
Node: Bibliography70933
|
||||
Node: Concept Index72990
|
||||
Node: Binary Strings49402
|
||||
Node: Options50550
|
||||
Node: Output File51336
|
||||
Node: Input Details51728
|
||||
Node: Output Language53564
|
||||
Node: Output Details54980
|
||||
Node: Algorithmic Details62244
|
||||
Node: Verbosity67501
|
||||
Node: Bugs68212
|
||||
Node: Projects69805
|
||||
Node: Bibliography70934
|
||||
Node: Concept Index72991
|
||||
|
||||
End Tag Table
|
||||
|
||||
BIN
doc/gperf.pdf
BIN
doc/gperf.pdf
Binary file not shown.
3511
doc/gperf.ps
3511
doc/gperf.ps
File diff suppressed because it is too large
Load Diff
@@ -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 - GNU GENERAL PUBLIC LICENSE</TITLE>
|
||||
</HEAD>
|
||||
|
||||
@@ -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 - Concept Index</TITLE>
|
||||
</HEAD>
|
||||
@@ -13,34 +13,7 @@ Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_9.html">previous</A>,
|
||||
<H1><A NAME="SEC28" HREF="gperf_toc.html#TOC28">Concept Index</A></H1>
|
||||
|
||||
<P>
|
||||
Jump to:
|
||||
<A HREF="#cindex_%">%</A>
|
||||
-
|
||||
<A HREF="#cindex_a">a</A>
|
||||
-
|
||||
<A HREF="#cindex_b">b</A>
|
||||
-
|
||||
<A HREF="#cindex_c">c</A>
|
||||
-
|
||||
<A HREF="#cindex_d">d</A>
|
||||
-
|
||||
<A HREF="#cindex_f">f</A>
|
||||
-
|
||||
<A HREF="#cindex_h">h</A>
|
||||
-
|
||||
<A HREF="#cindex_i">i</A>
|
||||
-
|
||||
<A HREF="#cindex_j">j</A>
|
||||
-
|
||||
<A HREF="#cindex_k">k</A>
|
||||
-
|
||||
<A HREF="#cindex_m">m</A>
|
||||
-
|
||||
<A HREF="#cindex_n">n</A>
|
||||
-
|
||||
<A HREF="#cindex_s">s</A>
|
||||
<P>
|
||||
<H2><A NAME="cindex_%">%</A></H2>
|
||||
<H2>%</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_5.html#IDX8"><SAMP>`%%'</SAMP></A>
|
||||
<LI><A HREF="gperf_5.html#IDX18"><SAMP>`%7bit'</SAMP></A>
|
||||
@@ -69,56 +42,56 @@ Jump to:
|
||||
<LI><A HREF="gperf_5.html#IDX32"><SAMP>`%{'</SAMP></A>
|
||||
<LI><A HREF="gperf_5.html#IDX33"><SAMP>`%}'</SAMP></A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_a">a</A></H2>
|
||||
<H2>a</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_6.html#IDX43">Array name</A>, <A HREF="gperf_6.html#IDX44">Array name</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_b">b</A></H2>
|
||||
<H2>b</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_2.html#IDX1">Bugs</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_c">c</A></H2>
|
||||
<H2>c</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_6.html#IDX42">Class name</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_d">d</A></H2>
|
||||
<H2>d</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_5.html#IDX5">Declaration section</A>
|
||||
<LI><A HREF="gperf_6.html#IDX39">Delimiters</A>
|
||||
<LI><A HREF="gperf_6.html#IDX46">Duplicates</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_f">f</A></H2>
|
||||
<H2>f</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_5.html#IDX4">Format</A>
|
||||
<LI><A HREF="gperf_5.html#IDX7">Functions section</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_h">h</A></H2>
|
||||
<H2>h</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_5.html#IDX35">hash</A>
|
||||
<LI><A HREF="gperf_5.html#IDX34">hash table</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_i">i</A></H2>
|
||||
<H2>i</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_5.html#IDX36">in_word_set</A>
|
||||
<LI><A HREF="gperf_6.html#IDX41">Initializers</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_j">j</A></H2>
|
||||
<H2>j</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_6.html#IDX47">Jump value</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_k">k</A></H2>
|
||||
<H2>k</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_5.html#IDX6">Keywords section</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_m">m</A></H2>
|
||||
<H2>m</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_4.html#IDX3">Minimal perfect hash functions</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_n">n</A></H2>
|
||||
<H2>n</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_5.html#IDX38">NUL</A>
|
||||
</DIR>
|
||||
<H2><A NAME="cindex_s">s</A></H2>
|
||||
<H2>s</H2>
|
||||
<DIR>
|
||||
<LI><A HREF="gperf_6.html#IDX40">Slot name</A>
|
||||
<LI><A HREF="gperf_4.html#IDX2">Static search structure</A>
|
||||
|
||||
@@ -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 - Contributors to GNU gperf Utility</TITLE>
|
||||
</HEAD>
|
||||
|
||||
@@ -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 - 1 Introduction</TITLE>
|
||||
</HEAD>
|
||||
|
||||
@@ -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.
|
||||
|
||||
|
||||
@@ -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 - 3 High-Level Description of GNU gperf</TITLE>
|
||||
</HEAD>
|
||||
@@ -16,7 +16,7 @@ Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_4.html">previous</A>,
|
||||
The perfect hash function generator <CODE>gperf</CODE> reads a set of
|
||||
"keywords" from an input file (or from the standard input by
|
||||
default). It attempts to derive a perfect hashing function that
|
||||
recognizes a member of the <EM>static keyword set</EM> with at most a
|
||||
recognizes a member of the <STRONG>static keyword set</STRONG> with at most a
|
||||
single probe into the lookup table. If <CODE>gperf</CODE> succeeds in
|
||||
generating such a function it produces a pair of C source code routines
|
||||
that perform hashing and table lookup recognition. All generated C code
|
||||
@@ -573,7 +573,7 @@ functions
|
||||
</P>
|
||||
<P>
|
||||
Several options control how the generated C code appears on the standard
|
||||
output. Two C function are generated. They are called <CODE>hash</CODE> and
|
||||
output. Two C functions are generated. They are called <CODE>hash</CODE> and
|
||||
<CODE>in_word_set</CODE>, although you may modify their names with a command-line
|
||||
option. Both functions require two arguments, a string, <CODE>char *</CODE>
|
||||
<VAR>str</VAR>, and a length parameter, <CODE>int</CODE> <VAR>len</VAR>. Their default
|
||||
@@ -586,7 +586,7 @@ function prototypes are as follows:
|
||||
<DD><A NAME="IDX35"></A>
|
||||
By default, the generated <CODE>hash</CODE> function returns an integer value
|
||||
created by adding <VAR>len</VAR> to several user-specified <VAR>str</VAR> byte
|
||||
positions indexed into an <EM>associated values</EM> table stored in a
|
||||
positions indexed into an <STRONG>associated values</STRONG> table stored in a
|
||||
local static array. The associated values table is constructed
|
||||
internally by <CODE>gperf</CODE> and later output as a static local C array
|
||||
called <SAMP>`hash_table'</SAMP>. The relevant selected positions (i.e. indices
|
||||
|
||||
@@ -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 - 4 Invoking gperf</TITLE>
|
||||
</HEAD>
|
||||
|
||||
@@ -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 - 5 Known Bugs and Limitations with gperf</TITLE>
|
||||
</HEAD>
|
||||
|
||||
@@ -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 - 6 Things Still Left to Do</TITLE>
|
||||
</HEAD>
|
||||
|
||||
@@ -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 - 7 Bibliography</TITLE>
|
||||
</HEAD>
|
||||
|
||||
@@ -1,14 +1,14 @@
|
||||
<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 - Table of Contents</TITLE>
|
||||
</HEAD>
|
||||
<BODY>
|
||||
<H1>User's Guide to <CODE>gperf</CODE> 3.0.2</H1>
|
||||
<H1>User's Guide to <CODE>gperf</CODE> 3.0.3</H1>
|
||||
<H2>The GNU Perfect Hash Function Generator</H2>
|
||||
<H2>Edition 3.0.2, 22 January 2006</H2>
|
||||
<H2>Edition 3.0.3, 31 March 2007</H2>
|
||||
<ADDRESS>Douglas C. Schmidt</ADDRESS>
|
||||
<ADDRESS>Bruno Haible</ADDRESS>
|
||||
<P>
|
||||
@@ -54,8 +54,8 @@
|
||||
<LI><A NAME="TOC28" HREF="gperf_10.html#SEC28">Concept Index</A>
|
||||
</UL>
|
||||
<P><HR><P>
|
||||
This document was generated on 22 January 2006 using the
|
||||
<A HREF="http://wwwinfo.cern.ch/dis/texi2html/">texi2html</A>
|
||||
translator version 1.52.</P>
|
||||
This document was generated on 31 March 2007 using the
|
||||
<A HREF="http://wwwcn.cern.ch/dci/texi2html/">texi2html</A>
|
||||
translator version 1.51.</P>
|
||||
</BODY>
|
||||
</HTML>
|
||||
|
||||
Reference in New Issue
Block a user