How to Install and Uninstall libconcurrentqueue-dev Package on Kali Linux
Last updated: February 17,2025
1. Install "libconcurrentqueue-dev" package
This guide covers the steps necessary to install libconcurrentqueue-dev on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libconcurrentqueue-dev
Copied
2. Uninstall "libconcurrentqueue-dev" package
Learn how to uninstall libconcurrentqueue-dev on Kali Linux:
$
sudo apt remove
libconcurrentqueue-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libconcurrentqueue-dev package on Kali Linux
Package: libconcurrentqueue-dev
Source: concurrentqueue
Version: 1.0.4+ds-1
Installed-Size: 402
Maintainer: Debian Med Packaging Team
Architecture: amd64
Size: 59944
SHA256: 8c73b49e7e7d82ed7dbb53acf6b0ebadf35315b01749224b1494439e259201d4
SHA1: d4f65cf46c7ace07bd75e5d0eb2d8e61155f77dd
MD5sum: 01843f1cd3fbe34e272887935b193b62
Description: 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).
Description-md5:
Homepage: https://github.com/cameron314/concurrentqueue
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/c/concurrentqueue/libconcurrentqueue-dev_1.0.4+ds-1_amd64.deb
Source: concurrentqueue
Version: 1.0.4+ds-1
Installed-Size: 402
Maintainer: Debian Med Packaging Team
Architecture: amd64
Size: 59944
SHA256: 8c73b49e7e7d82ed7dbb53acf6b0ebadf35315b01749224b1494439e259201d4
SHA1: d4f65cf46c7ace07bd75e5d0eb2d8e61155f77dd
MD5sum: 01843f1cd3fbe34e272887935b193b62
Description: 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).
Description-md5:
Homepage: https://github.com/cameron314/concurrentqueue
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/c/concurrentqueue/libconcurrentqueue-dev_1.0.4+ds-1_amd64.deb