How to Install and Uninstall libatomic-queue0 Package on Kali Linux
Last updated: November 07,2024
1. Install "libatomic-queue0" package
Here is a brief guide to show you how to install libatomic-queue0 on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libatomic-queue0
Copied
2. Uninstall "libatomic-queue0" package
Here is a brief guide to show you how to uninstall libatomic-queue0 on Kali Linux:
$
sudo apt remove
libatomic-queue0
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libatomic-queue0 package on Kali Linux
Package: libatomic-queue0
Source: libatomic-queue
Version: 1.4-1
Installed-Size: 221
Maintainer: Debian Med Packaging Team
Architecture: amd64
Depends: libc6 (>= 2.34), libgcc-s1 (>= 3.0), libstdc++6 (>= 11)
Size: 59704
SHA256: 82f94f2f666404df0c64a650271b806d649efa268f6d724f3f5fc347cb89df50
SHA1: 088a68e624bcb7c2a1ea486ba5c37f2e6794bc5d
MD5sum: 362ea23de2d41d19f4c0cf1328abc426
Description: 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:
Homepage: https://github.com/max0x7ba/atomic_queue
Tag: role::shared-lib
Section: libs
Priority: optional
Filename: pool/main/liba/libatomic-queue/libatomic-queue0_1.4-1_amd64.deb
Source: libatomic-queue
Version: 1.4-1
Installed-Size: 221
Maintainer: Debian Med Packaging Team
Architecture: amd64
Depends: libc6 (>= 2.34), libgcc-s1 (>= 3.0), libstdc++6 (>= 11)
Size: 59704
SHA256: 82f94f2f666404df0c64a650271b806d649efa268f6d724f3f5fc347cb89df50
SHA1: 088a68e624bcb7c2a1ea486ba5c37f2e6794bc5d
MD5sum: 362ea23de2d41d19f4c0cf1328abc426
Description: 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:
Homepage: https://github.com/max0x7ba/atomic_queue
Tag: role::shared-lib
Section: libs
Priority: optional
Filename: pool/main/liba/libatomic-queue/libatomic-queue0_1.4-1_amd64.deb