aboutsummaryrefslogtreecommitdiff
path: root/gnu
diff options
context:
space:
mode:
authorRicardo Wurmus <ricardo.wurmus@mdc-berlin.de>2015-12-11 15:57:45 +0100
committerRicardo Wurmus <ricardo.wurmus@mdc-berlin.de>2015-12-11 15:59:20 +0100
commitf7f55db8f6d049225898d4ebcd7bc1d53623f32d (patch)
treeb21e1cb4f68a1f4095c1f0978290cca27e29816c /gnu
parentca3476cd6c5a048a67ac92fc05ca77ded5a1b7f0 (diff)
downloadguix-f7f55db8f6d049225898d4ebcd7bc1d53623f32d.tar.gz
guix-f7f55db8f6d049225898d4ebcd7bc1d53623f32d.zip
gnu: Move sparsehash to datastructures module.
* gnu/packages/crypto.scm (sparsehash): Move variable to... * gnu/packages/datastructures.scm: ...new file. * gnu-system.am (GNU_SYSTEM_MODULES): Add it.
Diffstat (limited to 'gnu')
-rw-r--r--gnu/packages/crypto.scm25
-rw-r--r--gnu/packages/datastructures.scm49
2 files changed, 49 insertions, 25 deletions
diff --git a/gnu/packages/crypto.scm b/gnu/packages/crypto.scm
index 08af95f8eb..d4742ca0e4 100644
--- a/gnu/packages/crypto.scm
+++ b/gnu/packages/crypto.scm
@@ -43,28 +43,3 @@
communication, encryption, decryption, signatures, etc.")
(license isc)
(home-page "http://libsodium.org")))
-
-(define-public sparsehash
- (package
- (name "sparsehash")
- (version "2.0.3")
- (source (origin
- (method url-fetch)
- (uri (string-append "https://github.com/sparsehash/sparsehash/"
- "archive/sparsehash-" version ".tar.gz"))
- (sha256
- (base32
- "133szz0ldwch0kd91l0sa57qsnl020njn622szd9cxrjqyjqds85"))))
- (build-system gnu-build-system)
- (synopsis "Memory-efficient hashtable implementations")
- (description
- "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.
-@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 --
-and time-efficient for good hash functions.")
- (home-page "https://github.com/sparsehash/sparsehash")
- (license bsd-3)))
diff --git a/gnu/packages/datastructures.scm b/gnu/packages/datastructures.scm
new file mode 100644
index 0000000000..361490000a
--- /dev/null
+++ b/gnu/packages/datastructures.scm
@@ -0,0 +1,49 @@
+;;; GNU Guix --- Functional package management for GNU
+;;; Copyright © 2015 Ricardo Wurmus <rekado@elephly.net>
+;;;
+;;; This file is part of GNU Guix.
+;;;
+;;; GNU Guix is free software; you can redistribute it and/or modify it
+;;; under the terms of the GNU General Public License as published by
+;;; the Free Software Foundation; either version 3 of the License, or (at
+;;; your option) any later version.
+;;;
+;;; GNU Guix is distributed in the hope that it will be useful, but
+;;; WITHOUT ANY WARRANTY; without even the implied warranty of
+;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+;;; GNU General Public License for more details.
+;;;
+;;; You should have received a copy of the GNU General Public License
+;;; along with GNU Guix. If not, see <http://www.gnu.org/licenses/>.
+
+(define-module (gnu packages datastructures)
+ #:use-module (gnu packages)
+ #:use-module ((guix licenses) #:prefix license:)
+ #:use-module (guix packages)
+ #:use-module (guix download)
+ #:use-module (guix build-system gnu))
+
+(define-public sparsehash
+ (package
+ (name "sparsehash")
+ (version "2.0.3")
+ (source (origin
+ (method url-fetch)
+ (uri (string-append "https://github.com/sparsehash/sparsehash/"
+ "archive/sparsehash-" version ".tar.gz"))
+ (sha256
+ (base32
+ "133szz0ldwch0kd91l0sa57qsnl020njn622szd9cxrjqyjqds85"))))
+ (build-system gnu-build-system)
+ (synopsis "Memory-efficient hashtable implementations")
+ (description
+ "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.
+@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 --
+and time-efficient for good hash functions.")
+ (home-page "https://github.com/sparsehash/sparsehash")
+ (license license:bsd-3)))