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
2000-08-20 18:44:23 +00:00
parent 4bdae61027
commit 745d7fc2fb
23 changed files with 4031 additions and 3212 deletions
Download Patch File Download Diff File Expand all files Collapse all files

128
doc/gperf_11.html
View File

@@ -1,79 +1,79 @@
<HTML>
<HEAD>
<!-- This HTML file has been created by texi2html 1.51
from gperf.texi on 15 April 1998 -->
from gperf.texi on 20 August 2000 -->
<TITLE>User's Guide to gperf - 8 Bibliography</TITLE>
<TITLE>Perfect Hash Function Generator - Concept Index</TITLE>
</HEAD>
<BODY>
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_10.html">previous</A>, next, last section, <A HREF="gperf_toc.html">table of contents</A>.
<P><HR><P>
<H1><A NAME="SEC23" HREF="gperf_toc.html#TOC23">8 Bibliography</A></H1>
<H1><A NAME="SEC24" HREF="gperf_toc.html#TOC24">Concept Index</A></H1>
<P>
[1] Chang, C.C.: <I>A Scheme for Constructing Ordered Minimal Perfect
Hashing Functions</I> Information Sciences 39(1986), 187-195.
[2] Cichelli, Richard J. <I>Author's Response to "On Cichelli's Minimal Perfect Hash
Functions Method"</I> Communications of the ACM, 23, 12(December 1980), 729.
[3] Cichelli, Richard J. <I>Minimal Perfect Hash Functions Made Simple</I>
Communications of the ACM, 23, 1(January 1980), 17-19.
[4] Cook, C. R. and Oldehoeft, R.R. <I>A Letter Oriented Minimal
Perfect Hashing Function</I> SIGPLAN Notices, 17, 9(September 1982), 18-27.
</P>
<P>
[5] Cormack, G. V. and Horspool, R. N. S. and Kaiserwerth, M.
<I>Practical Perfect Hashing</I> Computer Journal, 28, 1(January 1985), 54-58.
[6] Jaeschke, G. <I>Reciprocal Hashing: A Method for Generating Minimal
Perfect Hashing Functions</I> Communications of the ACM, 24, 12(December
1981), 829-833.
</P>
<P>
[7] Jaeschke, G. and Osterburg, G. <I>On Cichelli's Minimal Perfect
Hash Functions Method</I> Communications of the ACM, 23, 12(December 1980),
728-729.
</P>
<P>
[8] Sager, Thomas J. <I>A Polynomial Time Generator for Minimal Perfect
Hash Functions</I> Communications of the ACM, 28, 5(December 1985), 523-532
</P>
<P>
[9] Schmidt, Douglas C. <I>GPERF: A Perfect Hash Function Generator</I>
Second USENIX C++ Conference Proceedings, April 1990.
</P>
<P>
[10] Sebesta, R.W. and Taylor, M.A. <I>Minimal Perfect Hash Functions
for Reserved Word Lists</I> SIGPLAN Notices, 20, 12(September 1985), 47-53.
</P>
<P>
[11] Sprugnoli, R. <I>Perfect Hashing Functions: A Single Probe
Retrieving Method for Static Sets</I> Communications of the ACM, 20
11(November 1977), 841-850.
</P>
<P>
[12] Stallman, Richard M. <I>Using and Porting GNU CC</I> Free Software Foundation,
1988.
</P>
<P>
[13] Stroustrup, Bjarne <I>The C++ Programming Language.</I> Addison-Wesley, 1986.
</P>
<P>
[14] Tiemann, Michael D. <I>User's Guide to GNU C++</I> Free Software
Foundation, 1989.
<H2>%</H2>
<DIR>
<LI><A HREF="gperf_5.html#IDX8"><SAMP>`%%'</SAMP></A>
<LI><A HREF="gperf_5.html#IDX9"><SAMP>`%{'</SAMP></A>
<LI><A HREF="gperf_5.html#IDX10"><SAMP>`%}'</SAMP></A>
</DIR>
<H2>a</H2>
<DIR>
<LI><A HREF="gperf_6.html#IDX20">Array name</A>
</DIR>
<H2>b</H2>
<DIR>
<LI><A HREF="gperf_2.html#IDX1">Bugs</A>
</DIR>
<H2>c</H2>
<DIR>
<LI><A HREF="gperf_6.html#IDX19">Class name</A>
</DIR>
<H2>d</H2>
<DIR>
<LI><A HREF="gperf_5.html#IDX5">Declaration section</A>
<LI><A HREF="gperf_6.html#IDX16">Delimiters</A>
<LI><A HREF="gperf_6.html#IDX22">Duplicates</A>
</DIR>
<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>h</H2>
<DIR>
<LI><A HREF="gperf_5.html#IDX12">hash</A>
<LI><A HREF="gperf_5.html#IDX11">hash table</A>
</DIR>
<H2>i</H2>
<DIR>
<LI><A HREF="gperf_5.html#IDX13">in_word_set</A>
<LI><A HREF="gperf_6.html#IDX18">Initializers</A>
</DIR>
<H2>j</H2>
<DIR>
<LI><A HREF="gperf_6.html#IDX23">Jump value</A>
</DIR>
<H2>k</H2>
<DIR>
<LI><A HREF="gperf_5.html#IDX6">Keywords section</A>
</DIR>
<H2>m</H2>
<DIR>
<LI><A HREF="gperf_4.html#IDX3">Minimal perfect hash functions</A>
</DIR>
<H2>n</H2>
<DIR>
<LI><A HREF="gperf_5.html#IDX15">NUL</A>
</DIR>
<H2>s</H2>
<DIR>
<LI><A HREF="gperf_6.html#IDX17">Slot name</A>
<LI><A HREF="gperf_4.html#IDX2">Static search structure</A>
<LI><A HREF="gperf_5.html#IDX14"><CODE>switch</CODE></A>, <A HREF="gperf_6.html#IDX21"><CODE>switch</CODE></A>
</DIR>
</P>
<P><HR><P>