mirror of
https://git.in.rschanz.org/ryan77627/guix.git
synced 2024-12-30 08:02:38 -05:00
d1e4ad1b02
* 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.
118 lines
5.1 KiB
Scheme
118 lines
5.1 KiB
Scheme
;;; GNU Guix --- Functional package management for GNU
|
|
;;; Copyright © 2015, 2016 Ricardo Wurmus <rekado@elephly.net>
|
|
;;; Copyright © 2016, 2017 Tobias Geerinckx-Rice <me@tobias.gr>
|
|
;;;
|
|
;;; 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 (gnu packages perl)
|
|
#:use-module ((guix licenses) #:prefix license:)
|
|
#:use-module (guix packages)
|
|
#:use-module (guix download)
|
|
#:use-module (guix build-system gnu))
|
|
|
|
(define-public gdsl
|
|
(package
|
|
(name "gdsl")
|
|
(version "1.8")
|
|
(source (origin
|
|
(method url-fetch)
|
|
(uri (string-append "http://download.gna.org/gdsl/"
|
|
"gdsl-" version ".tar.gz"))
|
|
(sha256
|
|
(base32
|
|
"1v64jvlnj8jfpphphgjgb36p0kv50kwfyqncf0y12f16v8ydyiaw"))))
|
|
(build-system gnu-build-system)
|
|
(home-page "http://home.gna.org/gdsl/")
|
|
(synopsis "Generic data structures library")
|
|
(description "The Generic Data Structures Library (GDSL) is a collection
|
|
of routines for generic data structures manipulation. It is a re-entrant
|
|
library fully written from scratch in pure ANSI C. It is designed to offer
|
|
for C programmers common data structures with powerful algorithms, and hidden
|
|
implementation. Available structures are lists, queues, stacks, hash tables,
|
|
binary trees, binary search trees, red-black trees, 2D arrays, permutations
|
|
and heaps.")
|
|
(license license:gpl2+)))
|
|
|
|
(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, 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 --
|
|
and time-efficient for good hash functions.")
|
|
(home-page "https://github.com/sparsehash/sparsehash")
|
|
(license license:bsd-3)))
|
|
|
|
(define-public ssdeep
|
|
(package
|
|
(name "ssdeep")
|
|
(version "2.13")
|
|
(source (origin
|
|
(method url-fetch)
|
|
(uri (string-append "mirror://sourceforge/ssdeep/"
|
|
name "-" version "/"
|
|
name "-" version ".tar.gz"))
|
|
(sha256
|
|
(base32
|
|
"1igqy0j7jrklb8fdlrm6ald4cyl1fda5ipfl8crzyl6bax2ajk3f"))))
|
|
(build-system gnu-build-system)
|
|
(home-page "http://ssdeep.sourceforge.net")
|
|
(synopsis "Context-triggered piecewise hashing algorithm")
|
|
(description "ssdeep computes and matches context triggered piecewise
|
|
hashes (CTPH), also called fuzzy checksums. It can identify similar files
|
|
that have sequences of identical bytes in the same order, even though bytes
|
|
in between these sequences may be different in both content and length.")
|
|
(license license:gpl2+)))
|
|
|
|
(define-public liburcu
|
|
(package
|
|
(name "liburcu")
|
|
(version "0.9.3")
|
|
(source (origin
|
|
(method url-fetch)
|
|
(uri (string-append "https://www.lttng.org/files/urcu/"
|
|
"userspace-rcu-" version ".tar.bz2"))
|
|
(sha256
|
|
(base32
|
|
"01j0xp3f0w147yfyzybkjvb7i67i7prsvnkssgvgwry9lvk35khv"))))
|
|
(build-system gnu-build-system)
|
|
(native-inputs
|
|
`(("perl" ,perl))) ; for tests
|
|
(home-page "http://liburcu.org/")
|
|
(synopsis "User-space RCU data synchronisation library")
|
|
(description "liburcu is a user-space @dfn{Read-Copy-Update} (RCU) data
|
|
synchronisation library. It provides read-side access that scales linearly
|
|
with the number of cores. liburcu-cds provides efficient data structures
|
|
based on RCU and lock-free algorithms. These structures include hash tables,
|
|
queues, stacks, and doubly-linked lists.")
|
|
(license license:lgpl2.1+)))
|