[med-svn] [Git][med-team/libmmmulti][master] Separate tool from architecture all library

[Andreas Tille]

Andreas Tille pushed to branch master at Debian Med / libmmmulti


Commits:
f7ea4225 by Andreas Tille at 2020-10-27T17:19:15+01:00
Separate tool from architecture all library

- - - - -


4 changed files:

- debian/control
- debian/libmmmulti-dev.install
- + debian/mmmulti.install
- debian/manpages → debian/mmmulti.manpages


Changes:

=====================================
debian/control
=====================================
@@ -21,10 +21,10 @@ Rules-Requires-Root: no
 
 Package: libmmmulti-dev
 Section: libdevel
-Architecture: any
+Architecture: all
 Multi-Arch: foreign
 Depends: ${shlibs:Depends}, ${misc:Depends}
-Description: header files for mmmulti library
+Description: header only library for mmmulti
  Sometimes you have a lot of plain-old data, but you need random access
  to it. These header-only classes combine memory-mapped files with
  high-performance parallel sorting and appropriate indexing strategies
@@ -50,3 +50,29 @@ Description: header files for mmmulti library
  scale to extremely large problem sizes, limited only by available disk
  space. Although performance is much slower than an in-memory structure,
  it is virtually guaranteed to be able to complete the compute.
+
+Package: mmmulti
+Section: science
+Architecture: any
+Multi-Arch: foreign
+Depends: ${shlibs:Depends}, ${misc:Depends}
+Description: memory backed multimap
+ This implements a memory backed multimap intended for use where:
+  * your keys are integers, or can be mapped to dense range of integers,
+  * the memory mapped file is on fast storage, like an SSD (although
+    this is not a requirement),
+  * you have arbitrary values of fixed size (e.g. structs, other POD
+    types) that can be sorted,
+  * you don't need dynamic updates of the table,
+  * and you are likely to run out of memory of you use a traditional
+    map or hash table,
+  * but you can handle approximately 1 bit per record in RAM.
+ .
+ These may seem to be very specific, but many problems can be mapped into
+ a dense integer set. mmmulti::map developed first as a data structure
+ to support seqwish, which uses it to generate precise variation graphs
+ from pairwise alignments between collections of sequences. As this
+ multimap forms a key data processing kernel in the algorithm, it can
+ scale to extremely large problem sizes, limited only by available disk
+ space. Although performance is much slower than an in-memory structure,
+ it is virtually guaranteed to be able to complete the compute.


=====================================
debian/libmmmulti-dev.install
=====================================
@@ -1,2 +1 @@
-bin/*		usr/bin
 src/*.hpp	usr/include


=====================================
debian/mmmulti.install
=====================================
@@ -0,0 +1 @@
+bin/*		usr/bin


=====================================
debian/manpages → debian/mmmulti.manpages
=====================================



View it on GitLab: https://salsa.debian.org/med-team/libmmmulti/-/commit/f7ea422597daa7f046cccd9d2f4582da5f5d087c

-- 
View it on GitLab: https://salsa.debian.org/med-team/libmmmulti/-/commit/f7ea422597daa7f046cccd9d2f4582da5f5d087c
You're receiving this email because of your account on salsa.debian.org.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://alioth-lists.debian.net/pipermail/debian-med-commit/attachments/20201027/ee8ffab6/attachment-0001.html>