amaharaneko/guix-mirrors
1
1
Fork 0
mirror of https://codeberg.org/guix/guix.git synced 2025-10-02 02:15:12 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

gnu: Fix typos in descriptions.

Browse source 
* gnu/packages/admin.scm (di)[description]: Likewise.
* gnu/packages/bioinformatics.scm (r-annotate)[description]: Likewise.
* gnu/packages/datastructures.scm (sparsehash)[description]: Likewise.
* gnu/packages/dns.scm (knot)[description]: Likewise.
* gnu/packages/emacs.scm (emacs-idle-highlight)[synopsis, description]:
Likewise.
* gnu/packages/gnome.scm (libpeas)[description]: Likewise.
* gnu/packages/gtk.scm (python2-pygtk)[description]: Likewise.
* gnu/packages/kde-frameworks.scm (kactivities)[description]: Fix typo.
* gnu/packages/libevent.scm (perl-anyevent)[description]: Likewise.
* gnu/packages/machine-learning.scm (ghmm)[description]: Likewise.
* gnu/packages/mail.scm (mlmmj)[description]: Likewise.
* gnu/packages/maths.scm (vc)[description]: Likewise.
* gnu/packages/music.scm (gx-super-fuzz-lv2)[description]: Likewise.
* gnu/packages/networking.scm (nload)[description]: Likewise.
* gnu/packages/python.scm (python-execnet)[description]: Likewise.
* gnu/packages/terminals.scm (tilda)[description]: Likewise.
* gnu/packages/python.scm (python-execnet, python-tables)
(python2-coverage-test-runner, python2-rope)[description]: Likewise.
This commit is contained in:
Tobias Geerinckx-Rice 2017-04-16 18:06:57 +02:00
parent 0d82fafea4
commit d1e4ad1b02
No known key found for this signature in database
GPG key ID: 91CCDB9B48541B99
16 changed files with 26 additions and 26 deletions
Download patch file Download diff file Expand all files Collapse all files

2
gnu/packages/datastructures.scm
View file

@ -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 --