summaryrefslogtreecommitdiff
path: root/devel/gperf/DESCR
diff options
context:
space:
mode:
authorjmmv <jmmv>2003-05-06 17:40:18 +0000
committerjmmv <jmmv>2003-05-06 17:40:18 +0000
commitf4ab4bfd7ecc3cdfad69293a69f2c92d7ae60161 (patch)
tree37ae7d212f46ef8018a7bd8c13edba7da1a47ed9 /devel/gperf/DESCR
parent4f4f1b81d13abc86b32673c726b70d17a6202d29 (diff)
downloadpkgsrc-f4ab4bfd7ecc3cdfad69293a69f2c92d7ae60161.tar.gz
Drop trailing whitespace. Ok'ed by wiz.
Diffstat (limited to 'devel/gperf/DESCR')
-rw-r--r--devel/gperf/DESCR4
1 files changed, 2 insertions, 2 deletions
diff --git a/devel/gperf/DESCR b/devel/gperf/DESCR
index 8b59af91364..f39fc8f4819 100644
--- a/devel/gperf/DESCR
+++ b/devel/gperf/DESCR
@@ -4,8 +4,8 @@ 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
+ 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.
Output from the GPERF program is used to recognize reserved words in