How to Install and Uninstall libreaderwriterqueue-dev Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 11,2024

1. Install "libreaderwriterqueue-dev" package

Learn how to install libreaderwriterqueue-dev on Ubuntu 21.04 (Hirsute Hippo)

$ sudo apt update $ sudo apt install libreaderwriterqueue-dev

2. Uninstall "libreaderwriterqueue-dev" package

In this section, we are going to explain the necessary steps to uninstall libreaderwriterqueue-dev on Ubuntu 21.04 (Hirsute Hippo):

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

3. Information about the libreaderwriterqueue-dev package on Ubuntu 21.04 (Hirsute Hippo)

Package: libreaderwriterqueue-dev
Architecture: all
Version: 1.0.3-1
Priority: optional
Section: universe/libdevel
Source: readerwriterqueue
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Med Packaging Team
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 117
Filename: pool/universe/r/readerwriterqueue/libreaderwriterqueue-dev_1.0.3-1_all.deb
Size: 15748
MD5sum: b8f059521e1f5a1a242fe498cc59af2b
SHA1: 2af954356698b720276121327e30725d3eb9f3e4
SHA256: 01deb6977cf7d0b747ce793a7546aba89052b6f5186233eba98d2cff3de6052a
SHA512: 41fac7a9dd5db79d2fdc7eaca67740901b4fff012a043731950f08e6330b8c61164f9e9b56a5a78c4a02c3d626b46ed735de6c54b5955b2bc0b145a2d5b382f9
Homepage: https://github.com/cameron314/readerwriterqueue
Description-en: 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: 0da35b00d425afa72acbbe4378b095d3