deb_control_files:
- control
- md5sums
- shlibs
- symbols
- triggers
deb_fields:
Architecture: amd64
Depends: libc6 (>= 2.38), libgcc-s1 (>= 3.3.1), libstdc++6 (>= 11)
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.
Homepage: https://github.com/max0x7ba/atomic_queue
Installed-Size: '188'
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Package: libatomic-queue0
Priority: optional
Section: libs
Source: libatomic-queue
Version: 1.6.5-1
srcpkg_name: libatomic-queue
srcpkg_version: 1.6.5-1