libmmmulti 0.1-3 source package in Ubuntu
Changelog
libmmmulti (0.1-3) unstable; urgency=medium
* Team upload.
* Standards-Version: 4.6.2 (routine-update)
* d/clean: Remove generated bin/ directory (Closes: #1048502)
* d/salsa-ci.yml: Disable i386 builds, since some build depends are not
installable (libatomic-queue-dev and libsdsl-dev)
-- Lance Lin <email address hidden> Thu, 21 Dec 2023 19:41:36 +0700
Upload details
- Uploaded by:
- Debian Med
- Uploaded to:
- Sid
- Original maintainer:
- Debian Med
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc | |
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libmmmulti_0.1-3.dsc | 2.1 KiB | e130ec5c1e18a6fe5b612a13304566c2034dba3626fcef9967986a816b69bd62 |
| libmmmulti_0.1.orig.tar.gz | 14.9 KiB | acff00f6603c43c23d405db2d7b8a3b6b40ed9bf72d6bd9bcd80296156beeefa |
| libmmmulti_0.1-3.debian.tar.xz | 6.2 KiB | 6817205dfa6b2fb4cb68287a2bbde3a9ec03037d5a5f2815dde26219c0d73967 |
Available diffs
- diff from 0.1-2 to 0.1-3 (924 bytes)
No changes file available.
Binary packages built by this source
- libmmmulti-dev: 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
to support very large (>memory but <disk) multimaps, multisets, and
interval trees.
.
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.
- mmmulti: 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.
- mmmulti-dbgsym: debug symbols for mmmulti
