How to Install and Uninstall libreaderwriterqueue-dev Package on Kali Linux

Last updated: May 19,2024

1. Install "libreaderwriterqueue-dev" package

Please follow the steps below to install libreaderwriterqueue-dev on Kali Linux

$ sudo apt update $ sudo apt install libreaderwriterqueue-dev

2. Uninstall "libreaderwriterqueue-dev" package

Please follow the step by step instructions below to uninstall libreaderwriterqueue-dev on Kali Linux:

$ sudo apt remove libreaderwriterqueue-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the libreaderwriterqueue-dev package on Kali Linux

Package: libreaderwriterqueue-dev
Source: readerwriterqueue
Version: 1.0.6-1
Installed-Size: 145
Maintainer: Debian Med Packaging Team
Architecture: all
Size: 18292
SHA256: f219a074fc06382e41414ad261dc3fba7a3667b0c7a1c7709490b8ea3fbf55a8
SHA1: e8b85efd1dc01dfe9e10ea0633a45e3d5923da77
MD5sum: 6bf9a79fbc4de83eeb51325f510e86e5
Description: single-producer, single-consumer lock-free queue for C++
This package provides a lock-free queue for C++. It only supports
a two-thread use case (one consuming, and one producing). The threads
can't switch roles, though you could use this queue completely from a
single thread if you wish (but that would sort of defeat the purpose!).
.
Features:
* Blazing fast
* Compatible with C++11 (supports moving objects instead of making
copies)
* Fully generic (templated container of any type) -- just like
std::queue, you never need to allocate memory for elements yourself
(which saves you the hassle of writing a lock-free memory manager
to hold the elements you're queueing)
* Allocates memory up front, in contiguous blocks
* Provides a try_enqueue method which is guaranteed never to allocate
memory (the queue starts with an initial capacity)
* Also provides an enqueue method which can dynamically grow the size
of the queue as needed
* Also provides try_emplace/emplace convenience methods
* Has a blocking version with wait_dequeue
* Completely "wait-free" (no compare-and-swap loop). Enqueue and
dequeue are always O(1) (not counting memory allocation)
* On x86, the memory barriers compile down to no-ops, meaning enqueue
and dequeue are just a simple series of loads and stores (and
branches)
Description-md5:
Homepage: https://github.com/cameron314/readerwriterqueue
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/r/readerwriterqueue/libreaderwriterqueue-dev_1.0.6-1_all.deb