Commit | Line | Data |
---|---|---|
f7f55db8 | 1 | ;;; GNU Guix --- Functional package management for GNU |
b4464d38 | 2 | ;;; Copyright © 2015, 2016 Ricardo Wurmus <rekado@elephly.net> |
f7f55db8 RW |
3 | ;;; |
4 | ;;; This file is part of GNU Guix. | |
5 | ;;; | |
6 | ;;; GNU Guix is free software; you can redistribute it and/or modify it | |
7 | ;;; under the terms of the GNU General Public License as published by | |
8 | ;;; the Free Software Foundation; either version 3 of the License, or (at | |
9 | ;;; your option) any later version. | |
10 | ;;; | |
11 | ;;; GNU Guix is distributed in the hope that it will be useful, but | |
12 | ;;; WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | ;;; GNU General Public License for more details. | |
15 | ;;; | |
16 | ;;; You should have received a copy of the GNU General Public License | |
17 | ;;; along with GNU Guix. If not, see <http://www.gnu.org/licenses/>. | |
18 | ||
19 | (define-module (gnu packages datastructures) | |
20 | #:use-module (gnu packages) | |
21 | #:use-module ((guix licenses) #:prefix license:) | |
22 | #:use-module (guix packages) | |
23 | #:use-module (guix download) | |
24 | #:use-module (guix build-system gnu)) | |
25 | ||
b4464d38 RW |
26 | (define-public gdsl |
27 | (package | |
28 | (name "gdsl") | |
29 | (version "1.8") | |
30 | (source (origin | |
31 | (method url-fetch) | |
32 | (uri (string-append "http://download.gna.org/gdsl/" | |
33 | "gdsl-" version ".tar.gz")) | |
34 | (sha256 | |
35 | (base32 | |
36 | "1v64jvlnj8jfpphphgjgb36p0kv50kwfyqncf0y12f16v8ydyiaw")))) | |
37 | (build-system gnu-build-system) | |
38 | (home-page "http://home.gna.org/gdsl/") | |
39 | (synopsis "Generic data structures library") | |
40 | (description "The Generic Data Structures Library (GDSL) is a collection | |
41 | of routines for generic data structures manipulation. It is a re-entrant | |
42 | library fully written from scratch in pure ANSI C. It is designed to offer | |
43 | for C programmers common data structures with powerful algorithms, and hidden | |
44 | implementation. Available structures are lists, queues, stacks, hash tables, | |
45 | binary trees, binary search trees, red-black trees, 2D arrays, permutations | |
46 | and heaps.") | |
47 | (license license:gpl2+))) | |
48 | ||
f7f55db8 RW |
49 | (define-public sparsehash |
50 | (package | |
51 | (name "sparsehash") | |
52 | (version "2.0.3") | |
53 | (source (origin | |
54 | (method url-fetch) | |
55 | (uri (string-append "https://github.com/sparsehash/sparsehash/" | |
56 | "archive/sparsehash-" version ".tar.gz")) | |
57 | (sha256 | |
58 | (base32 | |
59 | "133szz0ldwch0kd91l0sa57qsnl020njn622szd9cxrjqyjqds85")))) | |
60 | (build-system gnu-build-system) | |
61 | (synopsis "Memory-efficient hashtable implementations") | |
62 | (description | |
63 | "This library contains several hash-map implementations, similar in API | |
64 | to SGI's @code{hash_map} class, but with different performance | |
65 | characteristics. @code{sparse_hash_map} uses very little space overhead, 1-2 | |
66 | bits per entry. @code{dense_hash_map} is very fast, particulary on lookup. | |
67 | @code{sparse_hash_set} and @code{dense_hash_set} are the set versions of these | |
68 | routines. All these implementation use a hashtable with internal quadratic | |
69 | probing. This method is space-efficient -- there is no pointer overhead -- | |
70 | and time-efficient for good hash functions.") | |
71 | (home-page "https://github.com/sparsehash/sparsehash") | |
72 | (license license:bsd-3))) |