diff options
| author | Marius Bakke <mbakke@fastmail.com> | 2017-04-18 18:30:13 +0200 |
|---|---|---|
| committer | Marius Bakke <mbakke@fastmail.com> | 2017-04-18 18:30:13 +0200 |
| commit | 8c4b4b65624198261d6e583214da9aa7c5524290 (patch) | |
| tree | 5950b2d9e7608d154109b69dc349d1ab2b3ab371 /gnu/packages/datastructures.scm | |
| parent | 40522a7e89bc169233ec724592c9439e8004f4ad (diff) | |
| parent | f8818360d5c185543b4bd1ad1c3c3ad7191af0c4 (diff) | |
| download | guix-8c4b4b65624198261d6e583214da9aa7c5524290.tar guix-8c4b4b65624198261d6e583214da9aa7c5524290.tar.gz | |
Merge branch 'master' into staging
Diffstat (limited to 'gnu/packages/datastructures.scm')
| -rw-r--r-- | gnu/packages/datastructures.scm | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gnu/packages/datastructures.scm b/gnu/packages/datastructures.scm index ef249b9659..79068a54d0 100644 --- a/gnu/packages/datastructures.scm +++ b/gnu/packages/datastructures.scm @@ -65,7 +65,7 @@ and heaps.") "This library contains several hash-map implementations, similar in API to SGI's @code{hash_map} class, but with different performance characteristics. @code{sparse_hash_map} uses very little space overhead, 1-2 -bits per entry. @code{dense_hash_map} is very fast, particulary on lookup. +bits per entry. @code{dense_hash_map} is very fast, particularly on lookup. @code{sparse_hash_set} and @code{dense_hash_set} are the set versions of these routines. All these implementation use a hashtable with internal quadratic probing. This method is space-efficient -- there is no pointer overhead -- |