How to Install and Uninstall robin-map-devel.noarch Package on Rocky Linux 9
Last updated: November 28,2024
1. Install "robin-map-devel.noarch" package
Please follow the guidelines below to install robin-map-devel.noarch on Rocky Linux 9
$
sudo dnf update
Copied
$
sudo dnf install
robin-map-devel.noarch
Copied
2. Uninstall "robin-map-devel.noarch" package
Please follow the step by step instructions below to uninstall robin-map-devel.noarch on Rocky Linux 9:
$
sudo dnf remove
robin-map-devel.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the robin-map-devel.noarch package on Rocky Linux 9
Last metadata expiration check: 0:56:18 ago on Fri Feb 16 06:49:52 2024.
Available Packages
Name : robin-map-devel
Version : 1.2.1
Release : 1.el9
Architecture : noarch
Size : 34 k
Source : robin-map-1.2.1-1.el9.src.rpm
Repository : epel
Summary : C++ implementation of a fast hash map and hash set using robin hood hashing
URL : https://github.com/Tessil/robin-map
License : MIT
Description : The robin-map library is a C++ implementation of a fast hash map and hash set
: using open-addressing and linear robin hood hashing with backward shift
: deletion to resolve collisions.
:
: Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map
: and tsl::robin_pg_set. The first two are faster and use a power of two growth
: policy, the last two use a prime growth policy instead and are able to cope
: better with a poor hash function. Use the prime version if there is a chance of
: repeating patterns in the lower bits of your hash (e.g. you are storing
: pointers with an identity hash function). See GrowthPolicy for details.
:
: A benchmark of tsl::robin_map against other hash maps may be found here. This
: page also gives some advices on which hash table structure you should try for
: your use case (useful if you are a bit lost with the multiple hash tables
: implementations in the tsl namespace).
Available Packages
Name : robin-map-devel
Version : 1.2.1
Release : 1.el9
Architecture : noarch
Size : 34 k
Source : robin-map-1.2.1-1.el9.src.rpm
Repository : epel
Summary : C++ implementation of a fast hash map and hash set using robin hood hashing
URL : https://github.com/Tessil/robin-map
License : MIT
Description : The robin-map library is a C++ implementation of a fast hash map and hash set
: using open-addressing and linear robin hood hashing with backward shift
: deletion to resolve collisions.
:
: Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map
: and tsl::robin_pg_set. The first two are faster and use a power of two growth
: policy, the last two use a prime growth policy instead and are able to cope
: better with a poor hash function. Use the prime version if there is a chance of
: repeating patterns in the lower bits of your hash (e.g. you are storing
: pointers with an identity hash function). See GrowthPolicy for details.
:
: A benchmark of tsl::robin_map against other hash maps may be found here. This
: page also gives some advices on which hash table structure you should try for
: your use case (useful if you are a bit lost with the multiple hash tables
: implementations in the tsl namespace).