How to Install and Uninstall libboost-container1.83.0 Package on Kali Linux

Last updated: November 08,2024

1. Install "libboost-container1.83.0" package

This guide let you learn how to install libboost-container1.83.0 on Kali Linux

$ sudo apt update $ sudo apt install libboost-container1.83.0

2. Uninstall "libboost-container1.83.0" package

Here is a brief guide to show you how to uninstall libboost-container1.83.0 on Kali Linux:

$ sudo apt remove libboost-container1.83.0 $ sudo apt autoclean && sudo apt autoremove

3. Information about the libboost-container1.83.0 package on Kali Linux

Package: libboost-container1.83.0
Source: boost1.83 (1.83.0-2)
Version: 1.83.0-2+b2
Installed-Size: 2227
Maintainer: Debian Boost Team
Architecture: amd64
Depends: libc6 (>= 2.34), libgcc-s1 (>= 3.0), libstdc++6 (>= 5)
Size: 258720
SHA256: 9a7fa11c050a78411d2cb671131488ac99cd9c2f2c993c1b8516806180e05398
SHA1: 788c9c7abb2d1ca9c3d5f9bb9fbd3f0f1a40e18d
MD5sum: 7f9f3f1c9fd5764b6292386cbbe0ebed
Description: C++ library that implements several well-known containers
This package forms part of the Boost C++ Libraries collection.
.
Boost.Container library implements several well-known containers,
including STL containers. The aim of the library is to offers
advanced features not present in standard containers or to offer the
latest standard draft features for compilers that don't comply with
the latest C++ standard.
.
In short, what does Boost.Container offer?
.
* Move semantics are implemented, including move emulation
for pre-C++11 compilers.
* New advanced features (e.g. placement insertion,
recursive containers) are present.
* Containers support stateful allocators and are compatible with
Boost.Interprocess (they can be safely placed in shared memory).
* The library offers new useful containers:
* flat_map, flat_set, flat_multimap and flat_multiset: drop-in
replacements for standard associative containers but more
memory friendly and with faster searches.
* stable_vector: a std::list and std::vector hybrid container:
vector-like random-access iterators and list-like iterator
stability in insertions and erasures.
* slist: the classic pre-standard singly linked list implementation
offering constant-time size(). Note that C++11 forward_list has no size().
Description-md5:
Multi-Arch: same
Homepage: http://boost.org/libs/container/
Section: libs
Priority: optional
Filename: pool/main/b/boost1.83/libboost-container1.83.0_1.83.0-2+b2_amd64.deb