summaryrefslogtreecommitdiff
path: root/databases/dbh/DESCR
diff options
context:
space:
mode:
authorjmmv <jmmv@pkgsrc.org>2003-05-06 17:40:18 +0000
committerjmmv <jmmv@pkgsrc.org>2003-05-06 17:40:18 +0000
commitf1446ddf2bf8118f432b3ac74c88db3d832669a8 (patch)
tree37ae7d212f46ef8018a7bd8c13edba7da1a47ed9 /databases/dbh/DESCR
parent37170ce899bdf394cca1d0769b2215d84b15a7ee (diff)
downloadpkgsrc-f1446ddf2bf8118f432b3ac74c88db3d832669a8.tar.gz
Drop trailing whitespace. Ok'ed by wiz.
Diffstat (limited to 'databases/dbh/DESCR')
-rw-r--r--databases/dbh/DESCR2
1 files changed, 1 insertions, 1 deletions
diff --git a/databases/dbh/DESCR b/databases/dbh/DESCR
index 98a2c1ea744..1d46c0a8e94 100644
--- a/databases/dbh/DESCR
+++ b/databases/dbh/DESCR
@@ -4,4 +4,4 @@ electronic data, such as graphic information. With the multidimensional binary
tree it is possible to mathematically prove that access time to any
particular record is minimized (using the concept of critical points from
calculus), which provides the means to construct optimized databases for
-particular applications.
+particular applications.