From f7f55db8f6d049225898d4ebcd7bc1d53623f32d Mon Sep 17 00:00:00 2001 From: Ricardo Wurmus Date: Fri, 11 Dec 2015 15:57:45 +0100 Subject: 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. --- gnu/packages/crypto.scm | 25 ------------------------- 1 file changed, 25 deletions(-) (limited to 'gnu/packages/crypto.scm') 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 @@ (define-public libsodium 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))) -- cgit v1.2.3