How to Install and Uninstall libatomic-queue0 Package on Ubuntu 21.10 (Impish Indri)
Last updated: November 07,2024
1. Install "libatomic-queue0" package
Please follow the guidelines below to install libatomic-queue0 on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
libatomic-queue0
Copied
2. Uninstall "libatomic-queue0" package
This is a short guide on how to uninstall libatomic-queue0 on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
libatomic-queue0
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libatomic-queue0 package on Ubuntu 21.10 (Impish Indri)
Package: libatomic-queue0
Architecture: amd64
Version: 0.0+git20201108.d9d66b6-2ubuntu1
Priority: optional
Section: universe/libs
Source: libatomic-queue
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Med Packaging Team
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 220
Depends: libc6 (>= 2.32), libgcc-s1 (>= 3.0), libstdc++6 (>= 5.2)
Filename: pool/universe/liba/libatomic-queue/libatomic-queue0_0.0+git20201108.d9d66b6-2ubuntu1_amd64.deb
Size: 56144
MD5sum: c0df1ec57993cf5bb1d8751dc34b38a8
SHA1: f597200379eeacb1f7820cb50f5f8da7c464afc5
SHA256: 0aed7f88a55358e0adcb97abf59cdfca7b27ae0a1e86730c902d1336f836e2a3
SHA512: 071a160b9b0fe5fafbe7a89f70a184cc8a24423e5961a8978198c71a0037cd81bb291f418a234ca92f9e2898b8b7ceaa5c068c657c373fd54c8b4ce24b950bd8
Homepage: https://github.com/max0x7ba/atomic_queue
Description-en: C++ atomic_queue library
C++11 multiple-producer-multiple-consumer lockless queues based on
circular buffer with std::atomic. The main design principle these
queues follow is simplicity: the bare minimum of atomic operations,
fixed size buffer, value semantics.
.
The circular buffer side-steps the memory reclamation problem inherent
in linked-list based queues for the price of fixed buffer size. See
Effective memory reclamation for lock-free data structures in C++
for more details.
.
These qualities are also limitations:
.
* The maximum queue size must be set at compile time or construction time.
* There are no OS-blocking push/pop functions.
.
Nevertheless, ultra-low-latency applications need just that and nothing
more. The simplicity pays off, see the throughput and latency benchmarks.
.
Available containers are:
.
* AtomicQueue - a fixed size ring-buffer for atomic elements.
* OptimistAtomicQueue - a faster fixed size ring-buffer for atomic
elements which busy-waits when empty or full.
* AtomicQueue2 - a fixed size ring-buffer for non-atomic elements.
* OptimistAtomicQueue2 - a faster fixed size ring-buffer for non-atomic
elements which busy-waits when empty or full.
.
These containers have corresponding AtomicQueueB, OptimistAtomicQueueB,
AtomicQueueB2, OptimistAtomicQueueB2 versions where the buffer size is
specified as an argument to the constructor.
.
This package contains the dynamic library.
Description-md5: 8010ede9e291a894c26bb927cfedb6fb
Architecture: amd64
Version: 0.0+git20201108.d9d66b6-2ubuntu1
Priority: optional
Section: universe/libs
Source: libatomic-queue
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Med Packaging Team
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 220
Depends: libc6 (>= 2.32), libgcc-s1 (>= 3.0), libstdc++6 (>= 5.2)
Filename: pool/universe/liba/libatomic-queue/libatomic-queue0_0.0+git20201108.d9d66b6-2ubuntu1_amd64.deb
Size: 56144
MD5sum: c0df1ec57993cf5bb1d8751dc34b38a8
SHA1: f597200379eeacb1f7820cb50f5f8da7c464afc5
SHA256: 0aed7f88a55358e0adcb97abf59cdfca7b27ae0a1e86730c902d1336f836e2a3
SHA512: 071a160b9b0fe5fafbe7a89f70a184cc8a24423e5961a8978198c71a0037cd81bb291f418a234ca92f9e2898b8b7ceaa5c068c657c373fd54c8b4ce24b950bd8
Homepage: https://github.com/max0x7ba/atomic_queue
Description-en: C++ atomic_queue library
C++11 multiple-producer-multiple-consumer lockless queues based on
circular buffer with std::atomic. The main design principle these
queues follow is simplicity: the bare minimum of atomic operations,
fixed size buffer, value semantics.
.
The circular buffer side-steps the memory reclamation problem inherent
in linked-list based queues for the price of fixed buffer size. See
Effective memory reclamation for lock-free data structures in C++
for more details.
.
These qualities are also limitations:
.
* The maximum queue size must be set at compile time or construction time.
* There are no OS-blocking push/pop functions.
.
Nevertheless, ultra-low-latency applications need just that and nothing
more. The simplicity pays off, see the throughput and latency benchmarks.
.
Available containers are:
.
* AtomicQueue - a fixed size ring-buffer for atomic elements.
* OptimistAtomicQueue - a faster fixed size ring-buffer for atomic
elements which busy-waits when empty or full.
* AtomicQueue2 - a fixed size ring-buffer for non-atomic elements.
* OptimistAtomicQueue2 - a faster fixed size ring-buffer for non-atomic
elements which busy-waits when empty or full.
.
These containers have corresponding AtomicQueueB, OptimistAtomicQueueB,
AtomicQueueB2, OptimistAtomicQueueB2 versions where the buffer size is
specified as an argument to the constructor.
.
This package contains the dynamic library.
Description-md5: 8010ede9e291a894c26bb927cfedb6fb