concurrentqueue 1.0.4+ds-1 source package in Ubuntu

Changelog

concurrentqueue (1.0.4+ds-1) unstable; urgency=medium

  * Team upload.
  * New upstream version
  * Standards-Version: 4.6.2 (routine-update)
  * Architecture: any (due to some architecture dependant cmake files

 -- Andreas Tille <email address hidden>  Wed, 12 Jul 2023 14:22:47 +0200

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 Pocket Published Component Section
Oracular release universe misc
Noble release universe misc
Mantic release universe misc

Downloads

File Size SHA-256 Checksum
concurrentqueue_1.0.4+ds-1.dsc 2.1 KiB 9bfc58e2e7f7edda0fa5fc2427375fd880935adf45f7d07783621414b861f304
concurrentqueue_1.0.4+ds.orig.tar.xz 225.3 KiB 831080e7defcd5649716ef70a250c3763c733d26d40028729c4b0acb77a96d4f
concurrentqueue_1.0.4+ds-1.debian.tar.xz 6.2 KiB d7aed9bd72df2f0da92adf01c0b2aa7c0cca41eb24ded112866c6c4f70b6bca3

Available diffs

No changes file available.

Binary packages built by this source

libconcurrentqueue-dev: industrial-strength lock-free queue for C++

 Features
  * Knock-your-socks-off blazing fast performance.
  * Single-header implementation. Just drop it in your project.
  * Fully thread-safe lock-free queue. Use concurrently from any number
    of threads.
  * C++11 implementation -- elements are moved (instead of copied)
    where possible.
  * Templated, obviating the need to deal exclusively with pointers --
    memory is managed for you.
  * No artificial limitations on element types or maximum count.
    Memory can be allocated once up-front, or dynamically as needed.
  * Fully portable (no assembly; all is done through standard C++11
    primitives).
  * Supports super-fast bulk operations.
  * Includes a low-overhead blocking version (BlockingConcurrentQueue).
  * Exception safe.
 .
 Reasons to use
 .
 There are not that many full-fledged lock-free queues for C++. Boost has
 one, but it's limited to objects with trivial assignment operators and
 trivial destructors, for example. Intel's TBB queue isn't lock-free,
 and requires trivial constructors too. There're many academic papers
 that implement lock-free queues in C++, but usable source code is hard
 to find, and tests even more so.
 .
 This queue not only has less limitations than others (for the most part),
 but it's also faster. It's been fairly well-tested, and offers advanced
 features like bulk enqueueing/dequeueing (which, with the new design, is
 much faster than one element at a time, approaching and even surpassing
 the speed of a non-concurrent queue even under heavy contention).