How to Install and Uninstall libmmmulti-dev Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 16,2024

1. Install "libmmmulti-dev" package

This tutorial shows how to install libmmmulti-dev on Ubuntu 21.04 (Hirsute Hippo)

$ sudo apt update $ sudo apt install libmmmulti-dev

2. Uninstall "libmmmulti-dev" package

This is a short guide on how to uninstall libmmmulti-dev on Ubuntu 21.04 (Hirsute Hippo):

$ sudo apt remove libmmmulti-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the libmmmulti-dev package on Ubuntu 21.04 (Hirsute Hippo)

Package: libmmmulti-dev
Architecture: all
Version: 0.1-2
Multi-Arch: foreign
Priority: optional
Section: universe/libdevel
Source: libmmmulti
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Med Packaging Team
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 54
Filename: pool/universe/libm/libmmmulti/libmmmulti-dev_0.1-2_all.deb
Size: 10152
MD5sum: cd9a87a89d0d5406a258ac4d87349c49
SHA1: ced35a2993a2e7f1e22d6fa2ad3006ba25690295
SHA256: 6f2e556a4c830a402b4c9ebfc732458a20e1fb5fa84543a27bbb39e2fafe9466
SHA512: dab3ae6fac651a3031e0917efbd04bf4f6f500a38234f3b2dd8702e90cf7e79ee8db663b200d0d77facffec81aa56b5e67b56742a473c3b05d619c4de32c0c6c
Homepage: https://github.com/ekg/mmmulti
Description-en: 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 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.
Description-md5: edf40902f9c23b66a4c46e6c9af16ba4