libatomic-queue 0.0+git20201108.d9d66b6-4 source package in Ubuntu
Changelog
libatomic-queue (0.0+git20201108.d9d66b6-4) unstable; urgency=medium * Fix symbols (Closes: #997408) * Bump Standards-Version to 4.6.0 (no changes needed) -- Nilesh Patra <email address hidden> Fri, 29 Oct 2021 19:36:25 +0530
Upload details
- Uploaded by:
- Debian Med
- Uploaded to:
- Sid
- Original maintainer:
- Debian Med
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libatomic-queue_0.0+git20201108.d9d66b6-4.dsc | 2.4 KiB | adeeca08b675eaad9592a5a699c0cda45765db6c729bb3007054c1334128ddef |
| libatomic-queue_0.0+git20201108.d9d66b6.orig.tar.xz | 1.9 MiB | eef4ca99d85496dee736f0287bf8c8ea63615834ff2a5db4a641162a531d60bf |
| libatomic-queue_0.0+git20201108.d9d66b6-4.debian.tar.xz | 8.3 KiB | 1488e6cd34454492b5535cf7c001e8a1a625015f6134895651fed391fb7926f4 |
Available diffs
No changes file available.
Binary packages built by this source
- libatomic-queue-dev: devel files for 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 header files and static library.
- libatomic-queue0: 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.
- libatomic-queue0-dbgsym: debug symbols for libatomic-queue0
