From ba6bfe01ee0d5cf3f06003ced36879aff1cc2ddf Mon Sep 17 00:00:00 2001 From: Bruno Haible Date: Thu, 12 Jun 2003 17:04:40 +0000 Subject: [PATCH] Regenerated. --- doc/gperf.1 | 2 +- doc/gperf.dvi | Bin 104136 -> 104364 bytes doc/gperf.html | 355 +- doc/gperf.info | 77 +- doc/gperf.pdf | Bin 234439 -> 224738 bytes doc/gperf.ps | 8603 ++++++++++++++++++++++++++------------------ doc/gperf_1.html | 39 +- doc/gperf_10.html | 58 +- doc/gperf_2.html | 3 +- doc/gperf_3.html | 11 +- doc/gperf_4.html | 23 +- doc/gperf_5.html | 116 +- doc/gperf_6.html | 36 +- doc/gperf_7.html | 9 +- doc/gperf_8.html | 9 +- doc/gperf_9.html | 37 +- doc/gperf_toc.html | 58 +- 17 files changed, 5468 insertions(+), 3968 deletions(-) diff --git a/doc/gperf.1 b/doc/gperf.1 index 9ed2d09..d40b419 100644 --- a/doc/gperf.1 +++ b/doc/gperf.1 @@ -1,5 +1,5 @@ .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.23. -.TH GPERF "1" "May 2003" "GNU gperf 3.0" FSF +.TH GPERF "1" "June 2003" "GNU gperf 3.0.1" FSF .SH NAME gperf \- generate a perfect hash function from a key set .SH SYNOPSIS diff --git a/doc/gperf.dvi b/doc/gperf.dvi index 1ef26a686e236f805a6ec1fd359ad7fcfc316040..f7a1afa127cb5e6956d64c4e96faf365f375ba89 100644 GIT binary patch delta 1099 zcmZ8fVN6?980EXKErCb3cCZzuCKedzgtwK#WRNJ^!U!lXtZ~syWu<-4hSG*om7y?r=IygzQvJvra^ zoqO*6{7ea=k&OHxM;0e z*eaNE(3FQ2&2EwIfL&^c;GrymQccGi*ss9G^}HU^=%K8Gdax)=Mq#xcW)(P6-k1O{ zDzM7Zk_5{N{H^*Lz-fBf+Ng#oN{5r_^L68DNM+DK(;M7+SfbM5$F)$$m}gMaZc&9( z3kK=S?bnHFNMA6B#U0gYx+6ZnUlNwzS#0uon{B=x_0*XLkK5zQ0cpTpTy6bS#{zx1E~+a2ZvK@b9g@Q$|%@xaO4mFoviZUUBJL%_Rf8;v#;`fTu>XSBj=bW|@n1a^-_@ z!SN*c41XRAV|srwjf`(ra~pR*hM%8*LKWWdYYByk2ykn6YH{epcd_C^F?-{|_&|H? z3+u4zN){P?U71p4*?`+8O{%aVT8H(M4rLsEG1&xtczMdh_FWgFoGw~Nf4n$NxV69J zWUfNNGgs~>lB-)8 zP7ZbokU^K1uJYvDm=T4@qzQK-Jh^jxmH2-7AW!~?ed`s498|-wmS_yCOj|OvYT?gS zVv7-;)e_^`7$dVedpWWtpB)VHJrlIWlf1W;L+5rVQIjIYj(qDW_$rY+eO#U@hcpf3 z%h&e60twpo!FqXiFZ6OyAlvuBEdaAz@d9MmR@17vvu=Nic^u7cD delta 872 zcmXYuZAg<*6vsXHc{XutvpIEIDOzepxy)t06k1u7W+5461ldqidztC%Rgs`il{weZ zEfvain=MSqn?8i;Gzu(Bgdoc@%U+1UsOW{Vq`PO`FX#8aobx~Dp4-+T9lS2B30KBx zW8#yR$HgX`^YZcn)Jr4GS%v1_19OvO(l_K4l@%2mESzJXP8+in<8h0=rZfBmT@R@e zXvR}fTG}l&DIr_LvH-aX0_mx!V=BlLZ=w=%R4^#w&9o99*dgNftfRBwhlsy&o&hw{ z$NCZpwBTBonr0VtNg#lshDIJTsNf~T&2*yjR_ zl*1{frPyQ&1S1~ki>Fg2BXBpin=#is&0h{KQR7C81_wQkk-*#BHJ56)!WH~nJH|Wx z7N_8FUA@Pv(6SC3sIxA@_V**Gy|{^~lNampnnerM;s6m=jbBlLp|~_ZI#+MZA75B) zQ|NS9`SA@Z8$y^J)zPI5<39N1iW+S;4Q70o({q26fMfPv@9HY|qLp~V5=E>{qTy+q z3X5lQdC_LZ(ZxH}44E_WWoDUuWq`4=jcOKTu$k0BKua5qektZ2e z{W4fd$0tYS( z#=#0<(@uB?5G!bR!2&sp+wveZh@@Q*N-LmP0dd0Q8F(Ql<$9sNj%9k+j*{sGEw BTzUWi diff --git a/doc/gperf.html b/doc/gperf.html index 6dde98c..d619e68 100644 --- a/doc/gperf.html +++ b/doc/gperf.html @@ -1,14 +1,13 @@ - + Perfect Hash Function Generator -

User's Guide to gperf 3.0

+

User's Guide to gperf 3.0.1

The GNU Perfect Hash Function Generator

-

Edition 3.0, 7 May 2003

+

Edition 3.0.1, 12 June 2003

Douglas C. Schmidt
Bruno Haible

@@ -21,37 +20,37 @@

  • How to Apply These Terms to Your New Programs
  • Contributors to GNU gperf Utility -
  • 1 Introduction -
  • 2 Static search structures and GNU gperf -
  • 3 High-Level Description of GNU gperf +
  • 1. Introduction +
  • 2. Static search structures and GNU gperf +
  • 3. High-Level Description of GNU gperf -
  • 4 Invoking gperf +
  • 4. Invoking gperf -
  • 5 Known Bugs and Limitations with gperf -
  • 6 Things Still Left to Do -
  • 7 Bibliography +
  • 5. Known Bugs and Limitations with gperf +
  • 6. Things Still Left to Do +
  • 7. Bibliography
  • Concept Index


    @@ -62,7 +61,7 @@

    Version 2, June 1991 -

    +
     Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
    @@ -87,7 +86,7 @@ using it.  (Some other Free Software Foundation software is covered by
     the GNU Library General Public License instead.)  You can apply it to
     your programs, too.
     
    -

    +

    When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you @@ -96,14 +95,14 @@ this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. -

    +

    To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. -

    +

    For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that @@ -111,13 +110,13 @@ you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. -

    +

    We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. -

    +

    Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free @@ -126,7 +125,7 @@ want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. -

    +

    Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free @@ -134,16 +133,16 @@ program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. -

    +

    The precise terms and conditions for copying, distribution and modification follow. -

    +

    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION -

    +
    1. @@ -412,7 +411,7 @@ POSSIBILITY OF SUCH DAMAGES.

      END OF TERMS AND CONDITIONS -

      +

      How to Apply These Terms to Your New Programs

      @@ -422,14 +421,14 @@ END OF TERMS AND CONDITIONS possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. -

      +

      To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. -

      +
       one line to give the program's name and an idea of what it does.
      @@ -453,12 +452,12 @@ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
       

      Also add information on how to contact you by electronic and paper mail. -

      +

      If the program is interactive, make it output a short notice like this when it starts in an interactive mode: -

      +
       Gnomovision version 69, Copyright (C) year  name of author
      @@ -475,13 +474,13 @@ commands you use may be called something other than `show w' and
       `show c'; they could even be mouse-clicks or menu items--whatever
       suits your program.
       
      -

      +

      You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: -

      +
       Yoyodyne, Inc., hereby disclaims all copyright
      @@ -500,7 +499,7 @@ consider it more useful to permit linking proprietary applications with the
       library.  If this is what you want to do, use the GNU Library General
       Public License instead of this License.
       
      -

      +

      Contributors to GNU gperf Utility

      @@ -537,7 +536,7 @@ added a testsuite. -

      1 Introduction

      +

      1. Introduction

      gperf is a perfect hash function generator written in C++. It @@ -550,7 +549,7 @@ pair of C functions. These functions determine whether a given character string s occurs in W, using at most one probe into the lookup table. -

      +

      gperf currently generates the reserved keyword recognizer for lexical analyzers in several production and research compilers and @@ -561,16 +560,16 @@ A paper describing gperf's design and implementation in greater detail is available in the Second USENIX C++ Conference proceedings or from http://www.cs.wustl.edu/~schmidt/resume.html. -

      -

      2 Static search structures and GNU gperf

      + +

      2. Static search structures and GNU gperf

      -

      +

      -A static search structure is an Abstract Data Type with certain +A static search structure is an Abstract Data Type with certain fundamental operations, e.g., initialize, insert, and retrieve. Conceptually, all insertions occur before any retrievals. In practice, gperf generates a static array @@ -580,11 +579,11 @@ insertions. It is a useful data structure for representing static search sets. 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 keywords, are inserted into +commands. Search set members, called keywords, are inserted into the structure only once, usually during program initialization, and are not generally modified at run-time. -

      +

      Numerous static search structure implementations exist, e.g., arrays, linked lists, binary search trees, digital search tries, and @@ -596,14 +595,14 @@ proportional to log n. Conversely, hash table implementations often locate a table entry in constant time, but typically impose additional memory overhead and exhibit poor worst case performance. -

      +

      Minimal perfect hash functions provide an optimal solution for a particular class of static search sets. A minimal perfect hash function is defined by two properties: -

      +