head	1.2;
access;
symbols
	RELENG_8_4:1.2.0.2
	RELENG_9_1_0_RELEASE:1.1.1.3.48.1
	RELENG_9_1:1.1.1.3.48.1.0.2
	RELENG_9_1_BP:1.1.1.3.48.1
	RELENG_8_3_0_RELEASE:1.1.1.3.36.1
	RELENG_8_3:1.1.1.3.36.1.0.2
	RELENG_8_3_BP:1.1.1.3.36.1
	RELENG_9_0_0_RELEASE:1.1.1.3
	RELENG_9_0:1.1.1.3.0.50
	RELENG_9_0_BP:1.1.1.3
	RELENG_9:1.1.1.3.0.48
	RELENG_9_BP:1.1.1.3
	RELENG_7_4_0_RELEASE:1.1.1.3
	RELENG_8_2_0_RELEASE:1.1.1.3
	RELENG_7_4:1.1.1.3.0.46
	RELENG_7_4_BP:1.1.1.3
	RELENG_8_2:1.1.1.3.0.44
	RELENG_8_2_BP:1.1.1.3
	RELENG_8_1_0_RELEASE:1.1.1.3
	RELENG_8_1:1.1.1.3.0.42
	RELENG_8_1_BP:1.1.1.3
	RELENG_7_3_0_RELEASE:1.1.1.3
	RELENG_7_3:1.1.1.3.0.40
	RELENG_7_3_BP:1.1.1.3
	RELENG_8_0_0_RELEASE:1.1.1.3
	RELENG_8_0:1.1.1.3.0.38
	RELENG_8_0_BP:1.1.1.3
	RELENG_8:1.1.1.3.0.36
	RELENG_8_BP:1.1.1.3
	RELENG_7_2_0_RELEASE:1.1.1.3
	RELENG_7_2:1.1.1.3.0.34
	RELENG_7_2_BP:1.1.1.3
	RELENG_7_1_0_RELEASE:1.1.1.3
	RELENG_6_4_0_RELEASE:1.1.1.3
	RELENG_7_1:1.1.1.3.0.32
	RELENG_7_1_BP:1.1.1.3
	RELENG_6_4:1.1.1.3.0.30
	RELENG_6_4_BP:1.1.1.3
	RELENG_7_0_0_RELEASE:1.1.1.3
	RELENG_6_3_0_RELEASE:1.1.1.3
	RELENG_7_0:1.1.1.3.0.28
	RELENG_7_0_BP:1.1.1.3
	RELENG_6_3:1.1.1.3.0.26
	RELENG_6_3_BP:1.1.1.3
	RELENG_7:1.1.1.3.0.24
	RELENG_7_BP:1.1.1.3
	RELENG_6_2_0_RELEASE:1.1.1.3
	RELENG_6_2:1.1.1.3.0.22
	RELENG_6_2_BP:1.1.1.3
	RELENG_5_5_0_RELEASE:1.1.1.3
	RELENG_5_5:1.1.1.3.0.20
	RELENG_5_5_BP:1.1.1.3
	RELENG_6_1_0_RELEASE:1.1.1.3
	RELENG_6_1:1.1.1.3.0.18
	RELENG_6_1_BP:1.1.1.3
	RELENG_6_0_0_RELEASE:1.1.1.3
	RELENG_6_0:1.1.1.3.0.16
	RELENG_6_0_BP:1.1.1.3
	RELENG_6:1.1.1.3.0.14
	RELENG_6_BP:1.1.1.3
	RELENG_5_4_0_RELEASE:1.1.1.3
	RELENG_5_4:1.1.1.3.0.12
	RELENG_5_4_BP:1.1.1.3
	RELENG_4_11_0_RELEASE:1.1.1.1.8.1
	RELENG_4_11:1.1.1.1.8.1.0.18
	RELENG_4_11_BP:1.1.1.1.8.1
	RELENG_5_3_0_RELEASE:1.1.1.3
	RELENG_5_3:1.1.1.3.0.10
	RELENG_5_3_BP:1.1.1.3
	RELENG_5:1.1.1.3.0.8
	RELENG_5_BP:1.1.1.3
	RELENG_4_10_0_RELEASE:1.1.1.1.8.1
	RELENG_4_10:1.1.1.1.8.1.0.16
	RELENG_4_10_BP:1.1.1.1.8.1
	RELENG_5_2_1_RELEASE:1.1.1.3
	RELENG_5_2_0_RELEASE:1.1.1.3
	RELENG_5_2:1.1.1.3.0.6
	RELENG_5_2_BP:1.1.1.3
	RELENG_4_9_0_RELEASE:1.1.1.1.8.1
	RELENG_4_9:1.1.1.1.8.1.0.14
	RELENG_4_9_BP:1.1.1.1.8.1
	RELENG_5_1_0_RELEASE:1.1.1.3
	RELENG_5_1:1.1.1.3.0.4
	RELENG_5_1_BP:1.1.1.3
	RELENG_4_8_0_RELEASE:1.1.1.1.8.1
	RELENG_4_8:1.1.1.1.8.1.0.12
	RELENG_4_8_BP:1.1.1.1.8.1
	RELENG_5_0_0_RELEASE:1.1.1.3
	RELENG_5_0:1.1.1.3.0.2
	RELENG_5_0_BP:1.1.1.3
	RELENG_4_7_0_RELEASE:1.1.1.1.8.1
	RELENG_4_7:1.1.1.1.8.1.0.10
	RELENG_4_7_BP:1.1.1.1.8.1
	RELENG_4_6_2_RELEASE:1.1.1.1.8.1
	RELENG_4_6_1_RELEASE:1.1.1.1.8.1
	RELENG_4_6_0_RELEASE:1.1.1.1.8.1
	RELENG_4_6:1.1.1.1.8.1.0.8
	RELENG_4_6_BP:1.1.1.1.8.1
	RELENG_4_5_0_RELEASE:1.1.1.1.8.1
	RELENG_4_5:1.1.1.1.8.1.0.6
	RELENG_4_5_BP:1.1.1.1.8.1
	RELENG_4_4_0_RELEASE:1.1.1.1.8.1
	RELENG_4_4:1.1.1.1.8.1.0.4
	RELENG_4_4_BP:1.1.1.1.8.1
	RELENG_4_3_0_RELEASE:1.1.1.1.8.1
	RELENG_4_3:1.1.1.1.8.1.0.2
	RELENG_4_3_BP:1.1.1.1.8.1
	RELENG_4_2_0_RELEASE:1.1.1.1
	v2_7_2:1.1.1.3
	RELENG_4_1_1_RELEASE:1.1.1.1
	PRE_SMPNG:1.1.1.2
	RELENG_4_1_0_RELEASE:1.1.1.1
	RELENG_3_5_0_RELEASE:1.1.1.1
	v2_7:1.1.1.2
	RELENG_4_0_0_RELEASE:1.1.1.1
	RELENG_4:1.1.1.1.0.8
	RELENG_4_BP:1.1.1.1
	RELENG_3_4_0_RELEASE:1.1.1.1
	RELENG_3_3_0_RELEASE:1.1.1.1
	RELENG_3_2_PAO:1.1.1.1.0.6
	RELENG_3_2_PAO_BP:1.1.1.1
	RELENG_3_2_0_RELEASE:1.1.1.1
	RELENG_3_1_0_RELEASE:1.1.1.1
	RELENG_3:1.1.1.1.0.4
	RELENG_3_BP:1.1.1.1
	RELENG_2_2_8_RELEASE:1.1.1.1
	RELENG_3_0_0_RELEASE:1.1.1.1
	RELENG_2_2_7_RELEASE:1.1.1.1
	RELENG_2_2_6_RELEASE:1.1.1.1
	RELENG_2_2_5_RELEASE:1.1.1.1
	RELENG_2_2_2_RELEASE:1.1.1.1
	RELENG_2_2_1_RELEASE:1.1.1.1
	RELENG_2_2_0_RELEASE:1.1.1.1
	RELENG_2_2:1.1.1.1.0.2
	RELENG_2_2_BP:1.1.1.1
	v2_1a:1.1.1.1
	FSF:1.1.1;
locks; strict;
comment	@# @;


1.2
date	2011.11.28.12.29.16;	author bapt;	state Exp;
branches
	1.2.2.1;
next	1.1;

1.1
date	96.09.10.13.48.13;	author peter;	state Exp;
branches
	1.1.1.1;
next	;

1.2.2.1
date	2011.11.28.12.29.16;	author svnexp;	state dead;
branches;
next	1.2.2.2;

1.2.2.2
date	2013.03.28.13.01.11;	author svnexp;	state Exp;
branches;
next	;

1.1.1.1
date	96.09.10.13.48.13;	author peter;	state Exp;
branches
	1.1.1.1.8.1;
next	1.1.1.2;

1.1.1.2
date	2000.03.25.07.44.31;	author kris;	state Exp;
branches;
next	1.1.1.3;

1.1.1.3
date	2000.10.13.12.03.53;	author obrien;	state Exp;
branches
	1.1.1.3.36.1
	1.1.1.3.48.1;
next	;

1.1.1.1.8.1
date	2001.02.15.12.32.00;	author obrien;	state Exp;
branches;
next	;

1.1.1.3.36.1
date	2012.01.16.22.26.45;	author bapt;	state Exp;
branches;
next	;

1.1.1.3.48.1
date	2012.01.16.22.17.12;	author bapt;	state Exp;
branches;
next	;


desc
@@


1.2
log
@SVN rev 228060 on 2011-11-28 12:29:16Z by bapt

upgrade gperf to the last GPLv2 version (3.0.3)

Reviewed by:	cognet
Approved by:	cognet
@
text
@This is GNU gperf. It is a program that generates perfect hash
functions for sets of key words.  A perfect hash function is:

          A hash function and a data structure that allows 
          recognition of a key word in a set of words using 
          exactly 1 probe into the data structure.

The doc/gperf.html file explains how the program works, the form of
the input, what options are available, and hints on choosing the best
options for particular key words set.

See the file NEWS for a list of major changes in the current release.

See the file INSTALL for compilation and installation instructions.

Output from the GPERF program is used to recognize reserved words in
the GNU C, GNU C++, and GNU Pascal compilers, as well as with the GNU
indent program.

For general documentation on the coding and usage standards
this distribution follows, see the GNU standards document
ftp://ftp.gnu.org/pub/gnu/standards.*, especially the 'Makefile
Conventions', 'Configuration', and 'User Interfaces' sections.

Mail suggestions and bug reports to <bug-gnu-gperf@@gnu.org>.  When
reporting bugs, please include in the subject line the package name
and version (output of 'gperf --version') for which you found a problem.

@


1.2.2.1
log
@file README was added on branch RELENG_8_4 on 2013-03-28 13:01:11 +0000
@
text
@d1 28
@


1.2.2.2
log
@## SVN ## Exported commit - http://svnweb.freebsd.org/changeset/base/248810
## SVN ## CVS IS DEPRECATED: http://wiki.freebsd.org/CvsIsDeprecated
@
text
@a0 28
This is GNU gperf. It is a program that generates perfect hash
functions for sets of key words.  A perfect hash function is:

          A hash function and a data structure that allows 
          recognition of a key word in a set of words using 
          exactly 1 probe into the data structure.

The doc/gperf.html file explains how the program works, the form of
the input, what options are available, and hints on choosing the best
options for particular key words set.

See the file NEWS for a list of major changes in the current release.

See the file INSTALL for compilation and installation instructions.

Output from the GPERF program is used to recognize reserved words in
the GNU C, GNU C++, and GNU Pascal compilers, as well as with the GNU
indent program.

For general documentation on the coding and usage standards
this distribution follows, see the GNU standards document
ftp://ftp.gnu.org/pub/gnu/standards.*, especially the 'Makefile
Conventions', 'Configuration', and 'User Interfaces' sections.

Mail suggestions and bug reports to <bug-gnu-gperf@@gnu.org>.  When
reporting bugs, please include in the subject line the package name
and version (output of 'gperf --version') for which you found a problem.

@


1.1
log
@Initial revision
@
text
@d1 5
a5 6
While teaching a data structures course at University of California,
Irvine, I developed a program called GPERF that generates perfect hash
functions for sets of key words.  A perfect hash function is simply:
 
          A hash function and a data structure that allows
          recognition of a key word in a set of words using
d7 9
a15 13
 
The gperf.texinfo file explains how the program works, the form of the
input, what options are available, and hints on choosing the best
options for particular key word sets.  The texinfo file is readable
both via the GNU emacs `info' command, and is also suitable for
typesetting with TeX.  The texinfo.tex macros needed to run 
gperf.texinfo through TeX are available in the GNU GCC release.  If 
you don't have access to these please email me and I'll send them to
you (about 75k).
 
The enclosed Makefile creates the executable program ``gperf'' and
also runs some tests.
 
d19 10
a28 5
 
Happy hacking!
 
Douglas C. Schmidt
schmidt@@ics.uci.edu
@


1.1.1.1
log
@Import the FSF release of gperf-2.1a, used in the build of gcc-2.7.2.1
(to be imported soon).
@
text
@@


1.1.1.1.8.1
log
@MFC: version 2.7.2
@
text
@d1 6
a6 5
This is GNU gperf. It is a program that generates perfect hash
functions for sets of key words.  A perfect hash function is:

          A hash function and a data structure that allows 
          recognition of a key word in a set of words using 
d8 13
a20 9

The doc/gperf.html file explains how the program works, the form of
the input, what options are available, and hints on choosing the best
options for particular key words set.

See the file NEWS for a list of major changes in the current release.

See the file INSTALL for compilation and installation instructions.

d24 5
a28 11

For general documentation on the coding and usage standards
this distribution follows, see the GNU standards document
ftp://ftp.gnu.org/pub/gnu/standards.*, especially the 'Makefile
Conventions', 'Configuration', and 'User Interfaces' sections.

Mail suggestions and bug reports to both <bug-gnu-utils@@gnu.org> and
<gperf-bugs@@lists.sourceforge.net>.  When reporting bugs, please
include in the subject line the package name and version (output of
'gperf --version') for which you found a problem.

@


1.1.1.2
log
@Virgin import of gperf v2.7
@
text
@d4 3
a6 3

          A hash function and a data structure that allows 
          recognition of a key word in a set of words using 
d8 1
a8 1

d13 5
a17 2
typesetting with TeX.

d20 1
a20 1

d24 1
a24 1

d26 1
a26 1

d28 1
@


1.1.1.3
log
@Virgin import of gperf v2.7.2.
@
text
@d1 3
a3 2
This is GNU gperf. It is a program that generates perfect hash
functions for sets of key words.  A perfect hash function is:
d9 5
a13 3
The doc/gperf.html file explains how the program works, the form of
the input, what options are available, and hints on choosing the best
options for particular key words set.
d15 2
a16 3
See the file NEWS for a list of major changes in the current release.

See the file INSTALL for compilation and installation instructions.
d22 1
a22 9
For general documentation on the coding and usage standards
this distribution follows, see the GNU standards document
ftp://ftp.gnu.org/pub/gnu/standards.*, especially the 'Makefile
Conventions', 'Configuration', and 'User Interfaces' sections.

Mail suggestions and bug reports to both <bug-gnu-utils@@gnu.org> and
<gperf-bugs@@lists.sourceforge.net>.  When reporting bugs, please
include in the subject line the package name and version (output of
'gperf --version') for which you found a problem.
d24 1
@


1.1.1.3.36.1
log
@SVN rev 230239 on 2012-01-16 22:26:45Z by bapt

MFC r228060, r228068, r228060

Upgrade gperf to 3.0.3 latest GPLv2 version

Approved by:    des (mentor)
@
text
@d25 4
a28 3
Mail suggestions and bug reports to <bug-gnu-gperf@@gnu.org>.  When
reporting bugs, please include in the subject line the package name
and version (output of 'gperf --version') for which you found a problem.
@


1.1.1.3.48.1
log
@SVN rev 230237 on 2012-01-16 22:17:12Z by bapt

MFC r228060, r228068, r228060

Upgrade gperf to 3.0.3 latest GPLv2 version

Approved by:    des (mentor)
@
text
@d25 4
a28 3
Mail suggestions and bug reports to <bug-gnu-gperf@@gnu.org>.  When
reporting bugs, please include in the subject line the package name
and version (output of 'gperf --version') for which you found a problem.
@


