1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
|
Source: libatomic-queue
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Uploaders: Steffen Moeller <moeller@debian.org>,
Andreas Tille <tille@debian.org>,
Nilesh Patra <nilesh@debian.org>
Section: libs
Priority: optional
Build-Depends: debhelper-compat (= 13),
d-shlibs,
libboost-dev,
libboost-test-dev,
libconcurrentqueue-dev,
libreaderwriterqueue-dev,
libtbb-dev,
libxenium-dev
Standards-Version: 4.6.1
Vcs-Browser: https://salsa.debian.org/med-team/libatomic-queue
Vcs-Git: https://salsa.debian.org/med-team/libatomic-queue.git
Homepage: https://github.com/max0x7ba/atomic_queue
Rules-Requires-Root: no
Package: libatomic-queue0
Architecture: any
Section: libs
Depends: ${shlibs:Depends},
${misc:Depends}
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.
Package: libatomic-queue-dev
Architecture: any
Section: libdevel
Depends: libatomic-queue0 (= ${binary:Version}),
libboost-dev,
${shlibs:Depends},
${misc:Depends}
Description: 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.
|