File 0001-Use-system-robin-map.patch of Package heaptrack
From b5d749b924cfa4e4fccae5a787c0f39b8ec28e42 Mon Sep 17 00:00:00 2001
From: Christophe Marin <christophe@krop.fr>
Date: Tue, 1 Apr 2025 14:55:51 +0200
Subject: [PATCH] Use system robin-map
---
3rdparty/CMakeLists.txt | 4 -
3rdparty/robin-map/.codecov.yml | 5 -
3rdparty/robin-map/CMakeLists.txt | 86 -
3rdparty/robin-map/LICENSE | 21 -
3rdparty/robin-map/README.md | 483 -----
.../cmake/tsl-robin-mapConfig.cmake.in | 9 -
.../include/tsl/robin_growth_policy.h | 406 ----
3rdparty/robin-map/include/tsl/robin_hash.h | 1639 -----------------
3rdparty/robin-map/include/tsl/robin_map.h | 807 --------
3rdparty/robin-map/include/tsl/robin_set.h | 660 -------
3rdparty/robin-map/tsl-robin-map.natvis | 78 -
CMakeLists.txt | 1 +
12 files changed, 1 insertion(+), 4198 deletions(-)
delete mode 100644 3rdparty/robin-map/.codecov.yml
delete mode 100644 3rdparty/robin-map/CMakeLists.txt
delete mode 100644 3rdparty/robin-map/LICENSE
delete mode 100644 3rdparty/robin-map/README.md
delete mode 100644 3rdparty/robin-map/cmake/tsl-robin-mapConfig.cmake.in
delete mode 100644 3rdparty/robin-map/include/tsl/robin_growth_policy.h
delete mode 100644 3rdparty/robin-map/include/tsl/robin_hash.h
delete mode 100644 3rdparty/robin-map/include/tsl/robin_map.h
delete mode 100644 3rdparty/robin-map/include/tsl/robin_set.h
delete mode 100644 3rdparty/robin-map/tsl-robin-map.natvis
diff --git a/3rdparty/CMakeLists.txt b/3rdparty/CMakeLists.txt
index a2c8e69..9a994b2 100644
--- a/3rdparty/CMakeLists.txt
+++ b/3rdparty/CMakeLists.txt
@@ -17,7 +17,3 @@ if (ZSTD_FOUND AND NOT BOOST_IOSTREAMS_HAS_ZSTD)
add_subdirectory(boost-zstd)
mark_as_system_target(boost-zstd)
endif()
-
-add_subdirectory(robin-map)
-
-mark_as_system_target(robin_map)
diff --git a/3rdparty/robin-map/.codecov.yml b/3rdparty/robin-map/.codecov.yml
deleted file mode 100644
index 92a0a4a..0000000
--- a/3rdparty/robin-map/.codecov.yml
+++ /dev/null
@@ -1,5 +0,0 @@
-comment: off
-coverage:
- status:
- project: off
- patch: off
diff --git a/3rdparty/robin-map/CMakeLists.txt b/3rdparty/robin-map/CMakeLists.txt
deleted file mode 100644
index 30ae333..0000000
--- a/3rdparty/robin-map/CMakeLists.txt
+++ /dev/null
@@ -1,86 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-
-project(tsl-robin-map VERSION 1.2.1 LANGUAGES CXX)
-
-include(GNUInstallDirs)
-
-
-add_library(robin_map INTERFACE)
-# Use tsl::robin_map as target, more consistent with other libraries conventions (Boost, Qt, ...)
-add_library(tsl::robin_map ALIAS robin_map)
-
-target_include_directories(robin_map INTERFACE
- "$<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/include>"
- "$<INSTALL_INTERFACE:${CMAKE_INSTALL_INCLUDEDIR}>")
-
-list(APPEND headers "${CMAKE_CURRENT_SOURCE_DIR}/include/tsl/robin_growth_policy.h"
- "${CMAKE_CURRENT_SOURCE_DIR}/include/tsl/robin_hash.h"
- "${CMAKE_CURRENT_SOURCE_DIR}/include/tsl/robin_map.h"
- "${CMAKE_CURRENT_SOURCE_DIR}/include/tsl/robin_set.h")
-target_sources(robin_map INTERFACE "$<BUILD_INTERFACE:${headers}>")
-
-if(MSVC)
- target_sources(robin_map INTERFACE
- "$<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/tsl-robin-map.natvis>"
- "$<INSTALL_INTERFACE:${CMAKE_INSTALL_DATAROOTDIR}/tsl-robin-map.natvis>")
-endif()
-
-
-
-
-set(IS_SUBPROJECT TRUE)
-if(CMAKE_SOURCE_DIR STREQUAL PROJECT_SOURCE_DIR)
- set(IS_SUBPROJECT FALSE)
-endif()
-
-# Installation (only compatible with CMake version >= 3.3)
-if(NOT IS_SUBPROJECT AND ${CMAKE_VERSION} VERSION_GREATER "3.2")
- include(CMakePackageConfigHelpers)
-
- ## Install include directory and potential natvis file
- install(DIRECTORY "${CMAKE_CURRENT_SOURCE_DIR}/include/tsl"
- DESTINATION "${CMAKE_INSTALL_INCLUDEDIR}")
-
- if(MSVC)
- install(FILES "${CMAKE_CURRENT_SOURCE_DIR}/tsl-robin-map.natvis"
- DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}")
- endif()
-
-
-
- ## Create and install tsl-robin-mapConfig.cmake
- configure_package_config_file("${CMAKE_CURRENT_SOURCE_DIR}/cmake/tsl-robin-mapConfig.cmake.in"
- "${CMAKE_CURRENT_BINARY_DIR}/tsl-robin-mapConfig.cmake"
- INSTALL_DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/cmake/tsl-robin-map")
-
- install(FILES "${CMAKE_CURRENT_BINARY_DIR}/tsl-robin-mapConfig.cmake"
- DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/cmake/tsl-robin-map")
-
-
- ## Create local tsl-robin-mapTargets.cmake
- export(TARGETS robin_map NAMESPACE tsl:: FILE "${CMAKE_CURRENT_BINARY_DIR}/tsl-robin-mapTargets.cmake")
-
- ## Create and install global tsl-robin-mapTargets.cmake
- install(TARGETS robin_map
- EXPORT tsl-robin-mapTargets)
-
- install(EXPORT tsl-robin-mapTargets
- NAMESPACE tsl::
- DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/cmake/tsl-robin-map")
-
-
-
- ## Create and install tsl-robin-mapConfigVersion.cmake
- # tsl-robin-map is header-only and does not depend on the architecture.
- # Remove CMAKE_SIZEOF_VOID_P from tsl-robin-mapConfigVersion.cmake so that a
- # tsl-robin-mapConfig.cmake generated for a 64 bit target can be used for 32 bit
- # targets and vice versa.
- set(CMAKE_SIZEOF_VOID_P_BACKUP ${CMAKE_SIZEOF_VOID_P})
- unset(CMAKE_SIZEOF_VOID_P)
- write_basic_package_version_file("${CMAKE_CURRENT_BINARY_DIR}/tsl-robin-mapConfigVersion.cmake"
- COMPATIBILITY SameMajorVersion)
- set(CMAKE_SIZEOF_VOID_P ${CMAKE_SIZEOF_VOID_P_BACKUP})
-
- install(FILES "${CMAKE_CURRENT_BINARY_DIR}/tsl-robin-mapConfigVersion.cmake"
- DESTINATION "${CMAKE_INSTALL_DATAROOTDIR}/cmake/tsl-robin-map")
-endif()
diff --git a/3rdparty/robin-map/LICENSE b/3rdparty/robin-map/LICENSE
deleted file mode 100644
index e9c5ae9..0000000
--- a/3rdparty/robin-map/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2017 Thibaut Goetghebuer-Planchon <tessil@gmx.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/3rdparty/robin-map/README.md b/3rdparty/robin-map/README.md
deleted file mode 100644
index f8901e4..0000000
--- a/3rdparty/robin-map/README.md
+++ /dev/null
@@ -1,483 +0,0 @@
-[](https://github.com/Tessil/robin-map/actions/workflows/ci.yml)
-
-## A C++ implementation of a fast hash map and hash set using robin hood hashing
-
-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](#growth-policy) for details.
-
-A **benchmark** of `tsl::robin_map` against other hash maps may be found [here](https://tessil.github.io/2016/08/29/benchmark-hopscotch-map.html). 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).
-
-### Key features
-
-- Header-only library, just add the [include](include/) directory to your include path and you are ready to go. If you use CMake, you can also use the `tsl::robin_map` exported target from the [CMakeLists.txt](CMakeLists.txt).
-- Fast hash table, check the [benchmark](https://tessil.github.io/2016/08/29/benchmark-hopscotch-map.html) for some numbers.
-- Support for move-only and non-default constructible key/value.
-- Support for heterogeneous lookups allowing the usage of `find` with a type different than `Key` (e.g. if you have a map that uses `std::unique_ptr<foo>` as key, you can use a `foo*` or a `std::uintptr_t` as key parameter to `find` without constructing a `std::unique_ptr<foo>`, see [example](#heterogeneous-lookups)).
-- No need to reserve any sentinel value from the keys.
-- Possibility to store the hash value alongside the stored key-value for faster rehash and lookup if the hash or the key equal functions are expensive to compute. Note that hash may be stored even if not asked explicitly when the library can detect that it will have no impact on the size of the structure in memory due to alignment. See the [StoreHash](https://tessil.github.io/robin-map/classtsl_1_1robin__map.html#details) template parameter for details.
-- If the hash is known before a lookup, it is possible to pass it as parameter to speed-up the lookup (see `precalculated_hash` parameter in [API](https://tessil.github.io/robin-map/classtsl_1_1robin__map.html#a35021b11aabb61820236692a54b3a0f8)).
-- Support for efficient serialization and deserialization (see [example](#serialization) and the `serialize/deserialize` methods in the [API](https://tessil.github.io/robin-map/classtsl_1_1robin__map.html) for details).
-- The library can be used with exceptions disabled (through `-fno-exceptions` option on Clang and GCC, without an `/EH` option on MSVC or simply by defining `TSL_NO_EXCEPTIONS`). `std::terminate` is used in replacement of the `throw` instruction when exceptions are disabled.
-- API closely similar to `std::unordered_map` and `std::unordered_set`.
-
-### Differences compared to `std::unordered_map`
-
-`tsl::robin_map` tries to have an interface similar to `std::unordered_map`, but some differences exist.
-- The **strong exception guarantee only holds** if the following statement is true `std::is_nothrow_swappable<value_type>::value && std::is_nothrow_move_constructible<value_type>::value` (where `value_type` is `Key` for `tsl::robin_set` and `std::pair<Key, T>` for `tsl::robin_map`). Otherwise if an exception is thrown during the swap or the move, the structure may end up in a undefined state. Note that per the standard, a `value_type` with a noexcept copy constructor and no move constructor also satisfies this condition and will thus guarantee the strong exception guarantee for the structure (see [API](https://tessil.github.io/robin-map/classtsl_1_1robin__map.html#details) for details).
-- The type `Key`, and also `T` in case of map, must be swappable. They must also be copy and/or move constructible.
-- Iterator invalidation doesn't behave in the same way, any operation modifying the hash table invalidate them (see [API](https://tessil.github.io/robin-map/classtsl_1_1robin__map.html#details) for details).
-- References and pointers to keys or values in the map are invalidated in the same way as iterators to these keys-values.
-- For iterators of `tsl::robin_map`, `operator*()` and `operator->()` return a reference and a pointer to `const std::pair<Key, T>` instead of `std::pair<const Key, T>` making the value `T` not modifiable. To modify the value you have to call the `value()` method of the iterator to get a mutable reference. Example:
-```c++
-tsl::robin_map<int, int> map = {{1, 1}, {2, 1}, {3, 1}};
-for(auto it = map.begin(); it != map.end(); ++it) {
- //it->second = 2; // Illegal
- it.value() = 2; // Ok
-}
-```
-- No support for some buckets related methods (like `bucket_size`, `bucket`, ...).
-
-These differences also apply between `std::unordered_set` and `tsl::robin_set`.
-
-Thread-safety guarantees are the same as `std::unordered_map/set` (i.e. possible to have multiple readers with no writer).
-
-### Growth policy
-
-The library supports multiple growth policies through the `GrowthPolicy` template parameter. Three policies are provided by the library but you can easily implement your own if needed.
-
-* **[tsl::rh::power_of_two_growth_policy.](https://tessil.github.io/robin-map/classtsl_1_1rh_1_1power__of__two__growth__policy.html)** Default policy used by `tsl::robin_map/set`. This policy keeps the size of the bucket array of the hash table to a power of two. This constraint allows the policy to avoid the usage of the slow modulo operation to map a hash to a bucket, instead of <code>hash % 2<sup>n</sup></code>, it uses <code>hash & (2<sup>n</sup> - 1)</code> (see [fast modulo](https://en.wikipedia.org/wiki/Modulo_operation#Performance_issues)). Fast but this may cause a lot of collisions with a poor hash function as the modulo with a power of two only masks the most significant bits in the end.
-* **[tsl::rh::prime_growth_policy.](https://tessil.github.io/robin-map/classtsl_1_1rh_1_1prime__growth__policy.html)** Default policy used by `tsl::robin_pg_map/set`. The policy keeps the size of the bucket array of the hash table to a prime number. When mapping a hash to a bucket, using a prime number as modulo will result in a better distribution of the hash across the buckets even with a poor hash function. To allow the compiler to optimize the modulo operation, the policy use a lookup table with constant primes modulos (see [API](https://tessil.github.io/robin-map/classtsl_1_1rh_1_1prime__growth__policy.html#details) for details). Slower than `tsl::rh::power_of_two_growth_policy` but more secure.
-* **[tsl::rh::mod_growth_policy.](https://tessil.github.io/robin-map/classtsl_1_1rh_1_1mod__growth__policy.html)** The policy grows the map by a customizable growth factor passed in parameter. It then just use the modulo operator to map a hash to a bucket. Slower but more flexible.
-
-
-To implement your own policy, you have to implement the following interface.
-
-```c++
-struct custom_policy {
- // Called on hash table construction and rehash, min_bucket_count_in_out is the minimum buckets
- // that the hash table needs. The policy can change it to a higher number of buckets if needed
- // and the hash table will use this value as bucket count. If 0 bucket is asked, then the value
- // must stay at 0.
- explicit custom_policy(std::size_t& min_bucket_count_in_out);
-
- // Return the bucket [0, bucket_count()) to which the hash belongs.
- // If bucket_count() is 0, it must always return 0.
- std::size_t bucket_for_hash(std::size_t hash) const noexcept;
-
- // Return the number of buckets that should be used on next growth
- std::size_t next_bucket_count() const;
-
- // Maximum number of buckets supported by the policy
- std::size_t max_bucket_count() const;
-
- // Reset the growth policy as if the policy was created with a bucket count of 0.
- // After a clear, the policy must always return 0 when bucket_for_hash() is called.
- void clear() noexcept;
-}
-```
-
-### Installation
-
-To use robin-map, just add the [include](include/) directory to your include path. It is a **header-only** library.
-
-If you use CMake, you can also use the `tsl::robin_map` exported target from the [CMakeLists.txt](CMakeLists.txt) with `target_link_libraries`.
-```cmake
-# Example where the robin-map project is stored in a third-party directory
-add_subdirectory(third-party/robin-map)
-target_link_libraries(your_target PRIVATE tsl::robin_map)
-```
-
-If the project has been installed through `make install`, you can also use `find_package(tsl-robin-map REQUIRED)` instead of `add_subdirectory`.
-
-The library is available in [vcpkg](https://github.com/Microsoft/vcpkg/tree/master/ports/robin-map) and [conan](https://conan.io/center/tsl-robin-map). It's also present in [Debian](https://packages.debian.org/buster/robin-map-dev), [Ubuntu](https://packages.ubuntu.com/disco/robin-map-dev) and [Fedora](https://apps.fedoraproject.org/packages/robin-map-devel) package repositories.
-
-The code should work with any C++11 standard-compliant compiler and has been tested with GCC 4.8.4, Clang 3.5.0 and Visual Studio 2015.
-
-To run the tests you will need the Boost Test library and CMake.
-
-```bash
-git clone https://github.com/Tessil/robin-map.git
-cd robin-map/tests
-mkdir build
-cd build
-cmake ..
-cmake --build .
-./tsl_robin_map_tests
-```
-
-### Usage
-
-The API can be found [here](https://tessil.github.io/robin-map/).
-
-All methods are not documented yet, but they replicate the behavior of the ones in `std::unordered_map` and `std::unordered_set`, except if specified otherwise.
-
-
-### Example
-
-```c++
-#include <cstdint>
-#include <iostream>
-#include <string>
-#include <tsl/robin_map.h>
-#include <tsl/robin_set.h>
-
-int main() {
- tsl::robin_map<std::string, int> map = {{"a", 1}, {"b", 2}};
- map["c"] = 3;
- map["d"] = 4;
-
- map.insert({"e", 5});
- map.erase("b");
-
- for(auto it = map.begin(); it != map.end(); ++it) {
- //it->second += 2; // Not valid.
- it.value() += 2;
- }
-
- // {d, 6} {a, 3} {e, 7} {c, 5}
- for(const auto& key_value : map) {
- std::cout << "{" << key_value.first << ", " << key_value.second << "}" << std::endl;
- }
-
-
- if(map.find("a") != map.end()) {
- std::cout << "Found \"a\"." << std::endl;
- }
-
- const std::size_t precalculated_hash = std::hash<std::string>()("a");
- // If we already know the hash beforehand, we can pass it in parameter to speed-up lookups.
- if(map.find("a", precalculated_hash) != map.end()) {
- std::cout << "Found \"a\" with hash " << precalculated_hash << "." << std::endl;
- }
-
-
- /*
- * Calculating the hash and comparing two std::string may be slow.
- * We can store the hash of each std::string in the hash map to make
- * the inserts and lookups faster by setting StoreHash to true.
- */
- tsl::robin_map<std::string, int, std::hash<std::string>,
- std::equal_to<std::string>,
- std::allocator<std::pair<std::string, int>>,
- true> map2;
-
- map2["a"] = 1;
- map2["b"] = 2;
-
- // {a, 1} {b, 2}
- for(const auto& key_value : map2) {
- std::cout << "{" << key_value.first << ", " << key_value.second << "}" << std::endl;
- }
-
-
-
-
- tsl::robin_set<int> set;
- set.insert({1, 9, 0});
- set.insert({2, -1, 9});
-
- // {0} {1} {2} {9} {-1}
- for(const auto& key : set) {
- std::cout << "{" << key << "}" << std::endl;
- }
-}
-```
-
-#### Heterogeneous lookups
-
-Heterogeneous overloads allow the usage of other types than `Key` for lookup and erase operations as long as the used types are hashable and comparable to `Key`.
-
-To activate the heterogeneous overloads in `tsl::robin_map/set`, the qualified-id `KeyEqual::is_transparent` must be valid. It works the same way as for [`std::map::find`](http://en.cppreference.com/w/cpp/container/map/find). You can either use [`std::equal_to<>`](http://en.cppreference.com/w/cpp/utility/functional/equal_to_void) or define your own function object.
-
-Both `KeyEqual` and `Hash` will need to be able to deal with the different types.
-
-```c++
-#include <functional>
-#include <iostream>
-#include <string>
-#include <tsl/robin_map.h>
-
-
-struct employee {
- employee(int id, std::string name) : m_id(id), m_name(std::move(name)) {
- }
-
- // Either we include the comparators in the class and we use `std::equal_to<>`...
- friend bool operator==(const employee& empl, int empl_id) {
- return empl.m_id == empl_id;
- }
-
- friend bool operator==(int empl_id, const employee& empl) {
- return empl_id == empl.m_id;
- }
-
- friend bool operator==(const employee& empl1, const employee& empl2) {
- return empl1.m_id == empl2.m_id;
- }
-
-
- int m_id;
- std::string m_name;
-};
-
-// ... or we implement a separate class to compare employees.
-struct equal_employee {
- using is_transparent = void;
-
- bool operator()(const employee& empl, int empl_id) const {
- return empl.m_id == empl_id;
- }
-
- bool operator()(int empl_id, const employee& empl) const {
- return empl_id == empl.m_id;
- }
-
- bool operator()(const employee& empl1, const employee& empl2) const {
- return empl1.m_id == empl2.m_id;
- }
-};
-
-struct hash_employee {
- std::size_t operator()(const employee& empl) const {
- return std::hash<int>()(empl.m_id);
- }
-
- std::size_t operator()(int id) const {
- return std::hash<int>()(id);
- }
-};
-
-
-int main() {
- // Use std::equal_to<> which will automatically deduce and forward the parameters
- tsl::robin_map<employee, int, hash_employee, std::equal_to<>> map;
- map.insert({employee(1, "John Doe"), 2001});
- map.insert({employee(2, "Jane Doe"), 2002});
- map.insert({employee(3, "John Smith"), 2003});
-
- // John Smith 2003
- auto it = map.find(3);
- if(it != map.end()) {
- std::cout << it->first.m_name << " " << it->second << std::endl;
- }
-
- map.erase(1);
-
-
-
- // Use a custom KeyEqual which has an is_transparent member type
- tsl::robin_map<employee, int, hash_employee, equal_employee> map2;
- map2.insert({employee(4, "Johnny Doe"), 2004});
-
- // 2004
- std::cout << map2.at(4) << std::endl;
-}
-```
-
-
-#### Serialization
-
-The library provides an efficient way to serialize and deserialize a map or a set so that it can be saved to a file or send through the network.
-To do so, it requires the user to provide a function object for both serialization and deserialization.
-
-```c++
-struct serializer {
- // Must support the following types for U: std::int16_t, std::uint32_t,
- // std::uint64_t, float and std::pair<Key, T> if a map is used or Key for
- // a set.
- template<typename U>
- void operator()(const U& value);
-};
-```
-
-```c++
-struct deserializer {
- // Must support the following types for U: std::int16_t, std::uint32_t,
- // std::uint64_t, float and std::pair<Key, T> if a map is used or Key for
- // a set.
- template<typename U>
- U operator()();
-};
-```
-
-Note that the implementation leaves binary compatibility (endianness, float binary representation, size of int, ...) of the types it serializes/deserializes in the hands of the provided function objects if compatibility is required.
-
-More details regarding the `serialize` and `deserialize` methods can be found in the [API](https://tessil.github.io/robin-map/classtsl_1_1robin__map.html).
-
-```c++
-#include <cassert>
-#include <cstdint>
-#include <fstream>
-#include <type_traits>
-#include <tsl/robin_map.h>
-
-
-class serializer {
-public:
- serializer(const char* file_name) {
- m_ostream.exceptions(m_ostream.badbit | m_ostream.failbit);
- m_ostream.open(file_name, std::ios::binary);
- }
-
- template<class T,
- typename std::enable_if<std::is_arithmetic<T>::value>::type* = nullptr>
- void operator()(const T& value) {
- m_ostream.write(reinterpret_cast<const char*>(&value), sizeof(T));
- }
-
- void operator()(const std::pair<std::int64_t, std::int64_t>& value) {
- (*this)(value.first);
- (*this)(value.second);
- }
-
-private:
- std::ofstream m_ostream;
-};
-
-class deserializer {
-public:
- deserializer(const char* file_name) {
- m_istream.exceptions(m_istream.badbit | m_istream.failbit | m_istream.eofbit);
- m_istream.open(file_name, std::ios::binary);
- }
-
- template<class T>
- T operator()() {
- T value;
- deserialize(value);
-
- return value;
- }
-
-private:
- template<class T,
- typename std::enable_if<std::is_arithmetic<T>::value>::type* = nullptr>
- void deserialize(T& value) {
- m_istream.read(reinterpret_cast<char*>(&value), sizeof(T));
- }
-
- void deserialize(std::pair<std::int64_t, std::int64_t>& value) {
- deserialize(value.first);
- deserialize(value.second);
- }
-
-private:
- std::ifstream m_istream;
-};
-
-
-int main() {
- const tsl::robin_map<std::int64_t, std::int64_t> map = {{1, -1}, {2, -2}, {3, -3}, {4, -4}};
-
-
- const char* file_name = "robin_map.data";
- {
- serializer serial(file_name);
- map.serialize(serial);
- }
-
- {
- deserializer dserial(file_name);
- auto map_deserialized = tsl::robin_map<std::int64_t, std::int64_t>::deserialize(dserial);
-
- assert(map == map_deserialized);
- }
-
- {
- deserializer dserial(file_name);
-
- /**
- * If the serialized and deserialized map are hash compatibles (see conditions in API),
- * setting the argument to true speed-up the deserialization process as we don't have
- * to recalculate the hash of each key. We also know how much space each bucket needs.
- */
- const bool hash_compatible = true;
- auto map_deserialized =
- tsl::robin_map<std::int64_t, std::int64_t>::deserialize(dserial, hash_compatible);
-
- assert(map == map_deserialized);
- }
-}
-```
-
-##### Serialization with Boost Serialization and compression with zlib
-
-It is possible to use a serialization library to avoid the boilerplate.
-
-The following example uses Boost Serialization with the Boost zlib compression stream to reduce the size of the resulting serialized file. The example requires C++20 due to the usage of the template parameter list syntax in lambdas, but it can be adapted to less recent versions.
-
-```c++
-#include <boost/archive/binary_iarchive.hpp>
-#include <boost/archive/binary_oarchive.hpp>
-#include <boost/iostreams/filter/zlib.hpp>
-#include <boost/iostreams/filtering_stream.hpp>
-#include <boost/serialization/split_free.hpp>
-#include <boost/serialization/utility.hpp>
-#include <cassert>
-#include <cstdint>
-#include <fstream>
-#include <tsl/robin_map.h>
-
-
-namespace boost { namespace serialization {
- template<class Archive, class Key, class T>
- void serialize(Archive & ar, tsl::robin_map<Key, T>& map, const unsigned int version) {
- split_free(ar, map, version);
- }
-
- template<class Archive, class Key, class T>
- void save(Archive & ar, const tsl::robin_map<Key, T>& map, const unsigned int /*version*/) {
- auto serializer = [&ar](const auto& v) { ar & v; };
- map.serialize(serializer);
- }
-
- template<class Archive, class Key, class T>
- void load(Archive & ar, tsl::robin_map<Key, T>& map, const unsigned int /*version*/) {
- auto deserializer = [&ar]<typename U>() { U u; ar & u; return u; };
- map = tsl::robin_map<Key, T>::deserialize(deserializer);
- }
-}}
-
-
-int main() {
- tsl::robin_map<std::int64_t, std::int64_t> map = {{1, -1}, {2, -2}, {3, -3}, {4, -4}};
-
-
- const char* file_name = "robin_map.data";
- {
- std::ofstream ofs;
- ofs.exceptions(ofs.badbit | ofs.failbit);
- ofs.open(file_name, std::ios::binary);
-
- boost::iostreams::filtering_ostream fo;
- fo.push(boost::iostreams::zlib_compressor());
- fo.push(ofs);
-
- boost::archive::binary_oarchive oa(fo);
-
- oa << map;
- }
-
- {
- std::ifstream ifs;
- ifs.exceptions(ifs.badbit | ifs.failbit | ifs.eofbit);
- ifs.open(file_name, std::ios::binary);
-
- boost::iostreams::filtering_istream fi;
- fi.push(boost::iostreams::zlib_decompressor());
- fi.push(ifs);
-
- boost::archive::binary_iarchive ia(fi);
-
- tsl::robin_map<std::int64_t, std::int64_t> map_deserialized;
- ia >> map_deserialized;
-
- assert(map == map_deserialized);
- }
-}
-```
-
-### License
-
-The code is licensed under the MIT license, see the [LICENSE file](LICENSE) for details.
diff --git a/3rdparty/robin-map/cmake/tsl-robin-mapConfig.cmake.in b/3rdparty/robin-map/cmake/tsl-robin-mapConfig.cmake.in
deleted file mode 100644
index d2ce233..0000000
--- a/3rdparty/robin-map/cmake/tsl-robin-mapConfig.cmake.in
+++ /dev/null
@@ -1,9 +0,0 @@
-# This module sets the following variables:
-# * tsl-robin-map_FOUND - true if tsl-robin-map found on the system
-# * tsl-robin-map_INCLUDE_DIRS - the directory containing tsl-robin-map headers
-@PACKAGE_INIT@
-
-if(NOT TARGET tsl::robin_map)
- include("${CMAKE_CURRENT_LIST_DIR}/tsl-robin-mapTargets.cmake")
- get_target_property(tsl-robin-map_INCLUDE_DIRS tsl::robin_map INTERFACE_INCLUDE_DIRECTORIES)
-endif()
diff --git a/3rdparty/robin-map/include/tsl/robin_growth_policy.h b/3rdparty/robin-map/include/tsl/robin_growth_policy.h
deleted file mode 100644
index eba8cdf..0000000
--- a/3rdparty/robin-map/include/tsl/robin_growth_policy.h
+++ /dev/null
@@ -1,406 +0,0 @@
-/**
- * MIT License
- *
- * Copyright (c) 2017 Thibaut Goetghebuer-Planchon <tessil@gmx.com>
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-#ifndef TSL_ROBIN_GROWTH_POLICY_H
-#define TSL_ROBIN_GROWTH_POLICY_H
-
-#include <algorithm>
-#include <array>
-#include <climits>
-#include <cmath>
-#include <cstddef>
-#include <cstdint>
-#include <iterator>
-#include <limits>
-#include <ratio>
-#include <stdexcept>
-
-#ifdef TSL_DEBUG
-#define tsl_rh_assert(expr) assert(expr)
-#else
-#define tsl_rh_assert(expr) (static_cast<void>(0))
-#endif
-
-/**
- * If exceptions are enabled, throw the exception passed in parameter, otherwise
- * call std::terminate.
- */
-#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || \
- (defined(_MSC_VER) && defined(_CPPUNWIND))) && \
- !defined(TSL_NO_EXCEPTIONS)
-#define TSL_RH_THROW_OR_TERMINATE(ex, msg) throw ex(msg)
-#else
-#define TSL_RH_NO_EXCEPTIONS
-#ifdef TSL_DEBUG
-#include <iostream>
-#define TSL_RH_THROW_OR_TERMINATE(ex, msg) \
- do { \
- std::cerr << msg << std::endl; \
- std::terminate(); \
- } while (0)
-#else
-#define TSL_RH_THROW_OR_TERMINATE(ex, msg) std::terminate()
-#endif
-#endif
-
-#if defined(__GNUC__) || defined(__clang__)
-#define TSL_RH_LIKELY(exp) (__builtin_expect(!!(exp), true))
-#else
-#define TSL_RH_LIKELY(exp) (exp)
-#endif
-
-#define TSL_RH_UNUSED(x) static_cast<void>(x)
-
-namespace tsl {
-namespace rh {
-
-/**
- * Grow the hash table by a factor of GrowthFactor keeping the bucket count to a
- * power of two. It allows the table to use a mask operation instead of a modulo
- * operation to map a hash to a bucket.
- *
- * GrowthFactor must be a power of two >= 2.
- */
-template <std::size_t GrowthFactor>
-class power_of_two_growth_policy {
- public:
- /**
- * Called on the hash table creation and on rehash. The number of buckets for
- * the table is passed in parameter. This number is a minimum, the policy may
- * update this value with a higher value if needed (but not lower).
- *
- * If 0 is given, min_bucket_count_in_out must still be 0 after the policy
- * creation and bucket_for_hash must always return 0 in this case.
- */
- explicit power_of_two_growth_policy(std::size_t& min_bucket_count_in_out) {
- if (min_bucket_count_in_out > max_bucket_count()) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The hash table exceeds its maximum size.");
- }
-
- if (min_bucket_count_in_out > 0) {
- min_bucket_count_in_out =
- round_up_to_power_of_two(min_bucket_count_in_out);
- m_mask = min_bucket_count_in_out - 1;
- } else {
- m_mask = 0;
- }
- }
-
- /**
- * Return the bucket [0, bucket_count()) to which the hash belongs.
- * If bucket_count() is 0, it must always return 0.
- */
- std::size_t bucket_for_hash(std::size_t hash) const noexcept {
- return hash & m_mask;
- }
-
- /**
- * Return the number of buckets that should be used on next growth.
- */
- std::size_t next_bucket_count() const {
- if ((m_mask + 1) > max_bucket_count() / GrowthFactor) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The hash table exceeds its maximum size.");
- }
-
- return (m_mask + 1) * GrowthFactor;
- }
-
- /**
- * Return the maximum number of buckets supported by the policy.
- */
- std::size_t max_bucket_count() const {
- // Largest power of two.
- return (std::numeric_limits<std::size_t>::max() / 2) + 1;
- }
-
- /**
- * Reset the growth policy as if it was created with a bucket count of 0.
- * After a clear, the policy must always return 0 when bucket_for_hash is
- * called.
- */
- void clear() noexcept { m_mask = 0; }
-
- private:
- static std::size_t round_up_to_power_of_two(std::size_t value) {
- if (is_power_of_two(value)) {
- return value;
- }
-
- if (value == 0) {
- return 1;
- }
-
- --value;
- for (std::size_t i = 1; i < sizeof(std::size_t) * CHAR_BIT; i *= 2) {
- value |= value >> i;
- }
-
- return value + 1;
- }
-
- static constexpr bool is_power_of_two(std::size_t value) {
- return value != 0 && (value & (value - 1)) == 0;
- }
-
- protected:
- static_assert(is_power_of_two(GrowthFactor) && GrowthFactor >= 2,
- "GrowthFactor must be a power of two >= 2.");
-
- std::size_t m_mask;
-};
-
-/**
- * Grow the hash table by GrowthFactor::num / GrowthFactor::den and use a modulo
- * to map a hash to a bucket. Slower but it can be useful if you want a slower
- * growth.
- */
-template <class GrowthFactor = std::ratio<3, 2>>
-class mod_growth_policy {
- public:
- explicit mod_growth_policy(std::size_t& min_bucket_count_in_out) {
- if (min_bucket_count_in_out > max_bucket_count()) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The hash table exceeds its maximum size.");
- }
-
- if (min_bucket_count_in_out > 0) {
- m_mod = min_bucket_count_in_out;
- } else {
- m_mod = 1;
- }
- }
-
- std::size_t bucket_for_hash(std::size_t hash) const noexcept {
- return hash % m_mod;
- }
-
- std::size_t next_bucket_count() const {
- if (m_mod == max_bucket_count()) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The hash table exceeds its maximum size.");
- }
-
- const double next_bucket_count =
- std::ceil(double(m_mod) * REHASH_SIZE_MULTIPLICATION_FACTOR);
- if (!std::isnormal(next_bucket_count)) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The hash table exceeds its maximum size.");
- }
-
- if (next_bucket_count > double(max_bucket_count())) {
- return max_bucket_count();
- } else {
- return std::size_t(next_bucket_count);
- }
- }
-
- std::size_t max_bucket_count() const { return MAX_BUCKET_COUNT; }
-
- void clear() noexcept { m_mod = 1; }
-
- private:
- static constexpr double REHASH_SIZE_MULTIPLICATION_FACTOR =
- 1.0 * GrowthFactor::num / GrowthFactor::den;
- static const std::size_t MAX_BUCKET_COUNT =
- std::size_t(double(std::numeric_limits<std::size_t>::max() /
- REHASH_SIZE_MULTIPLICATION_FACTOR));
-
- static_assert(REHASH_SIZE_MULTIPLICATION_FACTOR >= 1.1,
- "Growth factor should be >= 1.1.");
-
- std::size_t m_mod;
-};
-
-namespace detail {
-
-#if SIZE_MAX >= ULLONG_MAX
-#define TSL_RH_NB_PRIMES 51
-#elif SIZE_MAX >= ULONG_MAX
-#define TSL_RH_NB_PRIMES 40
-#else
-#define TSL_RH_NB_PRIMES 23
-#endif
-
-static constexpr const std::array<std::size_t, TSL_RH_NB_PRIMES> PRIMES = {{
- 1u,
- 5u,
- 17u,
- 29u,
- 37u,
- 53u,
- 67u,
- 79u,
- 97u,
- 131u,
- 193u,
- 257u,
- 389u,
- 521u,
- 769u,
- 1031u,
- 1543u,
- 2053u,
- 3079u,
- 6151u,
- 12289u,
- 24593u,
- 49157u,
-#if SIZE_MAX >= ULONG_MAX
- 98317ul,
- 196613ul,
- 393241ul,
- 786433ul,
- 1572869ul,
- 3145739ul,
- 6291469ul,
- 12582917ul,
- 25165843ul,
- 50331653ul,
- 100663319ul,
- 201326611ul,
- 402653189ul,
- 805306457ul,
- 1610612741ul,
- 3221225473ul,
- 4294967291ul,
-#endif
-#if SIZE_MAX >= ULLONG_MAX
- 6442450939ull,
- 12884901893ull,
- 25769803751ull,
- 51539607551ull,
- 103079215111ull,
- 206158430209ull,
- 412316860441ull,
- 824633720831ull,
- 1649267441651ull,
- 3298534883309ull,
- 6597069766657ull,
-#endif
-}};
-
-template <unsigned int IPrime>
-static constexpr std::size_t mod(std::size_t hash) {
- return hash % PRIMES[IPrime];
-}
-
-// MOD_PRIME[iprime](hash) returns hash % PRIMES[iprime]. This table allows for
-// faster modulo as the compiler can optimize the modulo code better with a
-// constant known at the compilation.
-static constexpr const std::array<std::size_t (*)(std::size_t),
- TSL_RH_NB_PRIMES>
- MOD_PRIME = {{
- &mod<0>, &mod<1>, &mod<2>, &mod<3>, &mod<4>, &mod<5>,
- &mod<6>, &mod<7>, &mod<8>, &mod<9>, &mod<10>, &mod<11>,
- &mod<12>, &mod<13>, &mod<14>, &mod<15>, &mod<16>, &mod<17>,
- &mod<18>, &mod<19>, &mod<20>, &mod<21>, &mod<22>,
-#if SIZE_MAX >= ULONG_MAX
- &mod<23>, &mod<24>, &mod<25>, &mod<26>, &mod<27>, &mod<28>,
- &mod<29>, &mod<30>, &mod<31>, &mod<32>, &mod<33>, &mod<34>,
- &mod<35>, &mod<36>, &mod<37>, &mod<38>, &mod<39>,
-#endif
-#if SIZE_MAX >= ULLONG_MAX
- &mod<40>, &mod<41>, &mod<42>, &mod<43>, &mod<44>, &mod<45>,
- &mod<46>, &mod<47>, &mod<48>, &mod<49>, &mod<50>,
-#endif
- }};
-
-} // namespace detail
-
-/**
- * Grow the hash table by using prime numbers as bucket count. Slower than
- * tsl::rh::power_of_two_growth_policy in general but will probably distribute
- * the values around better in the buckets with a poor hash function.
- *
- * To allow the compiler to optimize the modulo operation, a lookup table is
- * used with constant primes numbers.
- *
- * With a switch the code would look like:
- * \code
- * switch(iprime) { // iprime is the current prime of the hash table
- * case 0: hash % 5ul;
- * break;
- * case 1: hash % 17ul;
- * break;
- * case 2: hash % 29ul;
- * break;
- * ...
- * }
- * \endcode
- *
- * Due to the constant variable in the modulo the compiler is able to optimize
- * the operation by a series of multiplications, substractions and shifts.
- *
- * The 'hash % 5' could become something like 'hash - (hash * 0xCCCCCCCD) >> 34)
- * * 5' in a 64 bits environment.
- */
-class prime_growth_policy {
- public:
- explicit prime_growth_policy(std::size_t& min_bucket_count_in_out) {
- auto it_prime = std::lower_bound(
- detail::PRIMES.begin(), detail::PRIMES.end(), min_bucket_count_in_out);
- if (it_prime == detail::PRIMES.end()) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The hash table exceeds its maximum size.");
- }
-
- m_iprime = static_cast<unsigned int>(
- std::distance(detail::PRIMES.begin(), it_prime));
- if (min_bucket_count_in_out > 0) {
- min_bucket_count_in_out = *it_prime;
- } else {
- min_bucket_count_in_out = 0;
- }
- }
-
- std::size_t bucket_for_hash(std::size_t hash) const noexcept {
- return detail::MOD_PRIME[m_iprime](hash);
- }
-
- std::size_t next_bucket_count() const {
- if (m_iprime + 1 >= detail::PRIMES.size()) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The hash table exceeds its maximum size.");
- }
-
- return detail::PRIMES[m_iprime + 1];
- }
-
- std::size_t max_bucket_count() const { return detail::PRIMES.back(); }
-
- void clear() noexcept { m_iprime = 0; }
-
- private:
- unsigned int m_iprime;
-
- static_assert(std::numeric_limits<decltype(m_iprime)>::max() >=
- detail::PRIMES.size(),
- "The type of m_iprime is not big enough.");
-};
-
-} // namespace rh
-} // namespace tsl
-
-#endif
diff --git a/3rdparty/robin-map/include/tsl/robin_hash.h b/3rdparty/robin-map/include/tsl/robin_hash.h
deleted file mode 100644
index 5fdc07f..0000000
--- a/3rdparty/robin-map/include/tsl/robin_hash.h
+++ /dev/null
@@ -1,1639 +0,0 @@
-/**
- * MIT License
- *
- * Copyright (c) 2017 Thibaut Goetghebuer-Planchon <tessil@gmx.com>
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-#ifndef TSL_ROBIN_HASH_H
-#define TSL_ROBIN_HASH_H
-
-#include <algorithm>
-#include <cassert>
-#include <cmath>
-#include <cstddef>
-#include <cstdint>
-#include <exception>
-#include <iterator>
-#include <limits>
-#include <memory>
-#include <new>
-#include <stdexcept>
-#include <tuple>
-#include <type_traits>
-#include <utility>
-#include <vector>
-
-#include "robin_growth_policy.h"
-
-namespace tsl {
-
-namespace detail_robin_hash {
-
-template <typename T>
-struct make_void {
- using type = void;
-};
-
-template <typename T, typename = void>
-struct has_is_transparent : std::false_type {};
-
-template <typename T>
-struct has_is_transparent<T,
- typename make_void<typename T::is_transparent>::type>
- : std::true_type {};
-
-template <typename U>
-struct is_power_of_two_policy : std::false_type {};
-
-template <std::size_t GrowthFactor>
-struct is_power_of_two_policy<tsl::rh::power_of_two_growth_policy<GrowthFactor>>
- : std::true_type {};
-
-// Only available in C++17, we need to be compatible with C++11
-template <class T>
-const T& clamp(const T& v, const T& lo, const T& hi) {
- return std::min(hi, std::max(lo, v));
-}
-
-template <typename T, typename U>
-static T numeric_cast(U value,
- const char* error_message = "numeric_cast() failed.") {
- T ret = static_cast<T>(value);
- if (static_cast<U>(ret) != value) {
- TSL_RH_THROW_OR_TERMINATE(std::runtime_error, error_message);
- }
-
- const bool is_same_signedness =
- (std::is_unsigned<T>::value && std::is_unsigned<U>::value) ||
- (std::is_signed<T>::value && std::is_signed<U>::value);
- if (!is_same_signedness && (ret < T{}) != (value < U{})) {
- TSL_RH_THROW_OR_TERMINATE(std::runtime_error, error_message);
- }
-
- return ret;
-}
-
-template <class T, class Deserializer>
-static T deserialize_value(Deserializer& deserializer) {
- // MSVC < 2017 is not conformant, circumvent the problem by removing the
- // template keyword
-#if defined(_MSC_VER) && _MSC_VER < 1910
- return deserializer.Deserializer::operator()<T>();
-#else
- return deserializer.Deserializer::template operator()<T>();
-#endif
-}
-
-/**
- * Fixed size type used to represent size_type values on serialization. Need to
- * be big enough to represent a std::size_t on 32 and 64 bits platforms, and
- * must be the same size on both platforms.
- */
-using slz_size_type = std::uint64_t;
-static_assert(std::numeric_limits<slz_size_type>::max() >=
- std::numeric_limits<std::size_t>::max(),
- "slz_size_type must be >= std::size_t");
-
-using truncated_hash_type = std::uint32_t;
-
-/**
- * Helper class that stores a truncated hash if StoreHash is true and nothing
- * otherwise.
- */
-template <bool StoreHash>
-class bucket_entry_hash {
- public:
- bool bucket_hash_equal(std::size_t /*hash*/) const noexcept { return true; }
-
- truncated_hash_type truncated_hash() const noexcept { return 0; }
-
- protected:
- void set_hash(truncated_hash_type /*hash*/) noexcept {}
-};
-
-template <>
-class bucket_entry_hash<true> {
- public:
- bool bucket_hash_equal(std::size_t hash) const noexcept {
- return m_hash == truncated_hash_type(hash);
- }
-
- truncated_hash_type truncated_hash() const noexcept { return m_hash; }
-
- protected:
- void set_hash(truncated_hash_type hash) noexcept {
- m_hash = truncated_hash_type(hash);
- }
-
- private:
- truncated_hash_type m_hash;
-};
-
-/**
- * Each bucket entry has:
- * - A value of type `ValueType`.
- * - An integer to store how far the value of the bucket, if any, is from its
- * ideal bucket (ex: if the current bucket 5 has the value 'foo' and
- * `hash('foo') % nb_buckets` == 3, `dist_from_ideal_bucket()` will return 2 as
- * the current value of the bucket is two buckets away from its ideal bucket) If
- * there is no value in the bucket (i.e. `empty()` is true)
- * `dist_from_ideal_bucket()` will be < 0.
- * - A marker which tells us if the bucket is the last bucket of the bucket
- * array (useful for the iterator of the hash table).
- * - If `StoreHash` is true, 32 bits of the hash of the value, if any, are also
- * stored in the bucket. If the size of the hash is more than 32 bits, it is
- * truncated. We don't store the full hash as storing the hash is a potential
- * opportunity to use the unused space due to the alignment of the bucket_entry
- * structure. We can thus potentially store the hash without any extra space
- * (which would not be possible with 64 bits of the hash).
- */
-template <typename ValueType, bool StoreHash>
-class bucket_entry : public bucket_entry_hash<StoreHash> {
- using bucket_hash = bucket_entry_hash<StoreHash>;
-
- public:
- using value_type = ValueType;
- using distance_type = std::int16_t;
-
- bucket_entry() noexcept
- : bucket_hash(),
- m_dist_from_ideal_bucket(EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET),
- m_last_bucket(false) {
- tsl_rh_assert(empty());
- }
-
- bucket_entry(bool last_bucket) noexcept
- : bucket_hash(),
- m_dist_from_ideal_bucket(EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET),
- m_last_bucket(last_bucket) {
- tsl_rh_assert(empty());
- }
-
- bucket_entry(const bucket_entry& other) noexcept(
- std::is_nothrow_copy_constructible<value_type>::value)
- : bucket_hash(other),
- m_dist_from_ideal_bucket(EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET),
- m_last_bucket(other.m_last_bucket) {
- if (!other.empty()) {
- ::new (static_cast<void*>(std::addressof(m_value)))
- value_type(other.value());
- m_dist_from_ideal_bucket = other.m_dist_from_ideal_bucket;
- }
- tsl_rh_assert(empty() == other.empty());
- }
-
- /**
- * Never really used, but still necessary as we must call resize on an empty
- * `std::vector<bucket_entry>`. and we need to support move-only types. See
- * robin_hash constructor for details.
- */
- bucket_entry(bucket_entry&& other) noexcept(
- std::is_nothrow_move_constructible<value_type>::value)
- : bucket_hash(std::move(other)),
- m_dist_from_ideal_bucket(EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET),
- m_last_bucket(other.m_last_bucket) {
- if (!other.empty()) {
- ::new (static_cast<void*>(std::addressof(m_value)))
- value_type(std::move(other.value()));
- m_dist_from_ideal_bucket = other.m_dist_from_ideal_bucket;
- }
- tsl_rh_assert(empty() == other.empty());
- }
-
- bucket_entry& operator=(const bucket_entry& other) noexcept(
- std::is_nothrow_copy_constructible<value_type>::value) {
- if (this != &other) {
- clear();
-
- bucket_hash::operator=(other);
- if (!other.empty()) {
- ::new (static_cast<void*>(std::addressof(m_value)))
- value_type(other.value());
- }
-
- m_dist_from_ideal_bucket = other.m_dist_from_ideal_bucket;
- m_last_bucket = other.m_last_bucket;
- }
-
- return *this;
- }
-
- bucket_entry& operator=(bucket_entry&&) = delete;
-
- ~bucket_entry() noexcept { clear(); }
-
- void clear() noexcept {
- if (!empty()) {
- destroy_value();
- m_dist_from_ideal_bucket = EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET;
- }
- }
-
- bool empty() const noexcept {
- return m_dist_from_ideal_bucket == EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET;
- }
-
- value_type& value() noexcept {
- tsl_rh_assert(!empty());
-#if defined(__cplusplus) && __cplusplus >= 201703L
- return *std::launder(
- reinterpret_cast<value_type*>(std::addressof(m_value)));
-#else
- return *reinterpret_cast<value_type*>(std::addressof(m_value));
-#endif
- }
-
- const value_type& value() const noexcept {
- tsl_rh_assert(!empty());
-#if defined(__cplusplus) && __cplusplus >= 201703L
- return *std::launder(
- reinterpret_cast<const value_type*>(std::addressof(m_value)));
-#else
- return *reinterpret_cast<const value_type*>(std::addressof(m_value));
-#endif
- }
-
- distance_type dist_from_ideal_bucket() const noexcept {
- return m_dist_from_ideal_bucket;
- }
-
- bool last_bucket() const noexcept { return m_last_bucket; }
-
- void set_as_last_bucket() noexcept { m_last_bucket = true; }
-
- template <typename... Args>
- void set_value_of_empty_bucket(distance_type dist_from_ideal_bucket,
- truncated_hash_type hash,
- Args&&... value_type_args) {
- tsl_rh_assert(dist_from_ideal_bucket >= 0);
- tsl_rh_assert(empty());
-
- ::new (static_cast<void*>(std::addressof(m_value)))
- value_type(std::forward<Args>(value_type_args)...);
- this->set_hash(hash);
- m_dist_from_ideal_bucket = dist_from_ideal_bucket;
-
- tsl_rh_assert(!empty());
- }
-
- void swap_with_value_in_bucket(distance_type& dist_from_ideal_bucket,
- truncated_hash_type& hash, value_type& value) {
- tsl_rh_assert(!empty());
- tsl_rh_assert(dist_from_ideal_bucket > m_dist_from_ideal_bucket);
-
- using std::swap;
- swap(value, this->value());
- swap(dist_from_ideal_bucket, m_dist_from_ideal_bucket);
-
- if (StoreHash) {
- const truncated_hash_type tmp_hash = this->truncated_hash();
- this->set_hash(hash);
- hash = tmp_hash;
- } else {
- // Avoid warning of unused variable if StoreHash is false
- TSL_RH_UNUSED(hash);
- }
- }
-
- static truncated_hash_type truncate_hash(std::size_t hash) noexcept {
- return truncated_hash_type(hash);
- }
-
- private:
- void destroy_value() noexcept {
- tsl_rh_assert(!empty());
- value().~value_type();
- }
-
- public:
- static const distance_type EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET = -1;
- static const distance_type DIST_FROM_IDEAL_BUCKET_LIMIT = 8192;
- static_assert(DIST_FROM_IDEAL_BUCKET_LIMIT <=
- std::numeric_limits<distance_type>::max() - 1,
- "DIST_FROM_IDEAL_BUCKET_LIMIT must be <= "
- "std::numeric_limits<distance_type>::max() - 1.");
-
- private:
- distance_type m_dist_from_ideal_bucket;
- bool m_last_bucket;
- alignas(value_type) unsigned char m_value[sizeof(value_type)];
-};
-
-/**
- * Internal common class used by `robin_map` and `robin_set`.
- *
- * ValueType is what will be stored by `robin_hash` (usually `std::pair<Key, T>`
- * for map and `Key` for set).
- *
- * `KeySelect` should be a `FunctionObject` which takes a `ValueType` in
- * parameter and returns a reference to the key.
- *
- * `ValueSelect` should be a `FunctionObject` which takes a `ValueType` in
- * parameter and returns a reference to the value. `ValueSelect` should be void
- * if there is no value (in a set for example).
- *
- * The strong exception guarantee only holds if the expression
- * `std::is_nothrow_swappable<ValueType>::value &&
- * std::is_nothrow_move_constructible<ValueType>::value` is true.
- *
- * Behaviour is undefined if the destructor of `ValueType` throws.
- */
-template <class ValueType, class KeySelect, class ValueSelect, class Hash,
- class KeyEqual, class Allocator, bool StoreHash, class GrowthPolicy>
-class robin_hash : private Hash, private KeyEqual, private GrowthPolicy {
- private:
- template <typename U>
- using has_mapped_type =
- typename std::integral_constant<bool, !std::is_same<U, void>::value>;
-
- static_assert(
- noexcept(std::declval<GrowthPolicy>().bucket_for_hash(std::size_t(0))),
- "GrowthPolicy::bucket_for_hash must be noexcept.");
- static_assert(noexcept(std::declval<GrowthPolicy>().clear()),
- "GrowthPolicy::clear must be noexcept.");
-
- public:
- template <bool IsConst>
- class robin_iterator;
-
- using key_type = typename KeySelect::key_type;
- using value_type = ValueType;
- using size_type = std::size_t;
- using difference_type = std::ptrdiff_t;
- using hasher = Hash;
- using key_equal = KeyEqual;
- using allocator_type = Allocator;
- using reference = value_type&;
- using const_reference = const value_type&;
- using pointer = value_type*;
- using const_pointer = const value_type*;
- using iterator = robin_iterator<false>;
- using const_iterator = robin_iterator<true>;
-
- private:
- /**
- * Either store the hash because we are asked by the `StoreHash` template
- * parameter or store the hash because it doesn't cost us anything in size and
- * can be used to speed up rehash.
- */
- static constexpr bool STORE_HASH =
- StoreHash ||
- ((sizeof(tsl::detail_robin_hash::bucket_entry<value_type, true>) ==
- sizeof(tsl::detail_robin_hash::bucket_entry<value_type, false>)) &&
- (sizeof(std::size_t) == sizeof(truncated_hash_type) ||
- is_power_of_two_policy<GrowthPolicy>::value) &&
- // Don't store the hash for primitive types with default hash.
- (!std::is_arithmetic<key_type>::value ||
- !std::is_same<Hash, std::hash<key_type>>::value));
-
- /**
- * Only use the stored hash on lookup if we are explicitly asked. We are not
- * sure how slow the KeyEqual operation is. An extra comparison may slow
- * things down with a fast KeyEqual.
- */
- static constexpr bool USE_STORED_HASH_ON_LOOKUP = StoreHash;
-
- /**
- * We can only use the hash on rehash if the size of the hash type is the same
- * as the stored one or if we use a power of two modulo. In the case of the
- * power of two modulo, we just mask the least significant bytes, we just have
- * to check that the truncated_hash_type didn't truncated more bytes.
- */
- static bool USE_STORED_HASH_ON_REHASH(size_type bucket_count) {
- if (STORE_HASH && sizeof(std::size_t) == sizeof(truncated_hash_type)) {
- TSL_RH_UNUSED(bucket_count);
- return true;
- } else if (STORE_HASH && is_power_of_two_policy<GrowthPolicy>::value) {
- return bucket_count == 0 ||
- (bucket_count - 1) <=
- std::numeric_limits<truncated_hash_type>::max();
- } else {
- TSL_RH_UNUSED(bucket_count);
- return false;
- }
- }
-
- using bucket_entry =
- tsl::detail_robin_hash::bucket_entry<value_type, STORE_HASH>;
- using distance_type = typename bucket_entry::distance_type;
-
- using buckets_allocator = typename std::allocator_traits<
- allocator_type>::template rebind_alloc<bucket_entry>;
- using buckets_container_type = std::vector<bucket_entry, buckets_allocator>;
-
- public:
- /**
- * The 'operator*()' and 'operator->()' methods return a const reference and
- * const pointer respectively to the stored value type.
- *
- * In case of a map, to get a mutable reference to the value associated to a
- * key (the '.second' in the stored pair), you have to call 'value()'.
- *
- * The main reason for this is that if we returned a `std::pair<Key, T>&`
- * instead of a `const std::pair<Key, T>&`, the user may modify the key which
- * will put the map in a undefined state.
- */
- template <bool IsConst>
- class robin_iterator {
- friend class robin_hash;
-
- private:
- using bucket_entry_ptr =
- typename std::conditional<IsConst, const bucket_entry*,
- bucket_entry*>::type;
-
- robin_iterator(bucket_entry_ptr bucket) noexcept : m_bucket(bucket) {}
-
- public:
- using iterator_category = std::forward_iterator_tag;
- using value_type = const typename robin_hash::value_type;
- using difference_type = std::ptrdiff_t;
- using reference = value_type&;
- using pointer = value_type*;
-
- robin_iterator() noexcept {}
-
- // Copy constructor from iterator to const_iterator.
- template <bool TIsConst = IsConst,
- typename std::enable_if<TIsConst>::type* = nullptr>
- robin_iterator(const robin_iterator<!TIsConst>& other) noexcept
- : m_bucket(other.m_bucket) {}
-
- robin_iterator(const robin_iterator& other) = default;
- robin_iterator(robin_iterator&& other) = default;
- robin_iterator& operator=(const robin_iterator& other) = default;
- robin_iterator& operator=(robin_iterator&& other) = default;
-
- const typename robin_hash::key_type& key() const {
- return KeySelect()(m_bucket->value());
- }
-
- template <class U = ValueSelect,
- typename std::enable_if<has_mapped_type<U>::value &&
- IsConst>::type* = nullptr>
- const typename U::value_type& value() const {
- return U()(m_bucket->value());
- }
-
- template <class U = ValueSelect,
- typename std::enable_if<has_mapped_type<U>::value &&
- !IsConst>::type* = nullptr>
- typename U::value_type& value() const {
- return U()(m_bucket->value());
- }
-
- reference operator*() const { return m_bucket->value(); }
-
- pointer operator->() const { return std::addressof(m_bucket->value()); }
-
- robin_iterator& operator++() {
- while (true) {
- if (m_bucket->last_bucket()) {
- ++m_bucket;
- return *this;
- }
-
- ++m_bucket;
- if (!m_bucket->empty()) {
- return *this;
- }
- }
- }
-
- robin_iterator operator++(int) {
- robin_iterator tmp(*this);
- ++*this;
-
- return tmp;
- }
-
- friend bool operator==(const robin_iterator& lhs,
- const robin_iterator& rhs) {
- return lhs.m_bucket == rhs.m_bucket;
- }
-
- friend bool operator!=(const robin_iterator& lhs,
- const robin_iterator& rhs) {
- return !(lhs == rhs);
- }
-
- private:
- bucket_entry_ptr m_bucket;
- };
-
- public:
-#if defined(__cplusplus) && __cplusplus >= 201402L
- robin_hash(size_type bucket_count, const Hash& hash, const KeyEqual& equal,
- const Allocator& alloc,
- float min_load_factor = DEFAULT_MIN_LOAD_FACTOR,
- float max_load_factor = DEFAULT_MAX_LOAD_FACTOR)
- : Hash(hash),
- KeyEqual(equal),
- GrowthPolicy(bucket_count),
- m_buckets_data(bucket_count, alloc),
- m_buckets(m_buckets_data.empty() ? static_empty_bucket_ptr()
- : m_buckets_data.data()),
- m_bucket_count(bucket_count),
- m_nb_elements(0),
- m_grow_on_next_insert(false),
- m_try_shrink_on_next_insert(false) {
- if (bucket_count > max_bucket_count()) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The map exceeds its maximum bucket count.");
- }
-
- if (m_bucket_count > 0) {
- tsl_rh_assert(!m_buckets_data.empty());
- m_buckets_data.back().set_as_last_bucket();
- }
-
- this->min_load_factor(min_load_factor);
- this->max_load_factor(max_load_factor);
- }
-#else
- /**
- * C++11 doesn't support the creation of a std::vector with a custom allocator
- * and 'count' default-inserted elements. The needed contructor `explicit
- * vector(size_type count, const Allocator& alloc = Allocator());` is only
- * available in C++14 and later. We thus must resize after using the
- * `vector(const Allocator& alloc)` constructor.
- *
- * We can't use `vector(size_type count, const T& value, const Allocator&
- * alloc)` as it requires the value T to be copyable.
- */
- robin_hash(size_type bucket_count, const Hash& hash, const KeyEqual& equal,
- const Allocator& alloc,
- float min_load_factor = DEFAULT_MIN_LOAD_FACTOR,
- float max_load_factor = DEFAULT_MAX_LOAD_FACTOR)
- : Hash(hash),
- KeyEqual(equal),
- GrowthPolicy(bucket_count),
- m_buckets_data(alloc),
- m_buckets(static_empty_bucket_ptr()),
- m_bucket_count(bucket_count),
- m_nb_elements(0),
- m_grow_on_next_insert(false),
- m_try_shrink_on_next_insert(false) {
- if (bucket_count > max_bucket_count()) {
- TSL_RH_THROW_OR_TERMINATE(std::length_error,
- "The map exceeds its maximum bucket count.");
- }
-
- if (m_bucket_count > 0) {
- m_buckets_data.resize(m_bucket_count);
- m_buckets = m_buckets_data.data();
-
- tsl_rh_assert(!m_buckets_data.empty());
- m_buckets_data.back().set_as_last_bucket();
- }
-
- this->min_load_factor(min_load_factor);
- this->max_load_factor(max_load_factor);
- }
-#endif
-
- robin_hash(const robin_hash& other)
- : Hash(other),
- KeyEqual(other),
- GrowthPolicy(other),
- m_buckets_data(other.m_buckets_data),
- m_buckets(m_buckets_data.empty() ? static_empty_bucket_ptr()
- : m_buckets_data.data()),
- m_bucket_count(other.m_bucket_count),
- m_nb_elements(other.m_nb_elements),
- m_load_threshold(other.m_load_threshold),
- m_min_load_factor(other.m_min_load_factor),
- m_max_load_factor(other.m_max_load_factor),
- m_grow_on_next_insert(other.m_grow_on_next_insert),
- m_try_shrink_on_next_insert(other.m_try_shrink_on_next_insert) {}
-
- robin_hash(robin_hash&& other) noexcept(
- std::is_nothrow_move_constructible<
- Hash>::value&& std::is_nothrow_move_constructible<KeyEqual>::value&&
- std::is_nothrow_move_constructible<GrowthPolicy>::value&&
- std::is_nothrow_move_constructible<buckets_container_type>::value)
- : Hash(std::move(static_cast<Hash&>(other))),
- KeyEqual(std::move(static_cast<KeyEqual&>(other))),
- GrowthPolicy(std::move(static_cast<GrowthPolicy&>(other))),
- m_buckets_data(std::move(other.m_buckets_data)),
- m_buckets(m_buckets_data.empty() ? static_empty_bucket_ptr()
- : m_buckets_data.data()),
- m_bucket_count(other.m_bucket_count),
- m_nb_elements(other.m_nb_elements),
- m_load_threshold(other.m_load_threshold),
- m_min_load_factor(other.m_min_load_factor),
- m_max_load_factor(other.m_max_load_factor),
- m_grow_on_next_insert(other.m_grow_on_next_insert),
- m_try_shrink_on_next_insert(other.m_try_shrink_on_next_insert) {
- other.clear_and_shrink();
- }
-
- robin_hash& operator=(const robin_hash& other) {
- if (&other != this) {
- Hash::operator=(other);
- KeyEqual::operator=(other);
- GrowthPolicy::operator=(other);
-
- m_buckets_data = other.m_buckets_data;
- m_buckets = m_buckets_data.empty() ? static_empty_bucket_ptr()
- : m_buckets_data.data();
- m_bucket_count = other.m_bucket_count;
- m_nb_elements = other.m_nb_elements;
-
- m_load_threshold = other.m_load_threshold;
- m_min_load_factor = other.m_min_load_factor;
- m_max_load_factor = other.m_max_load_factor;
-
- m_grow_on_next_insert = other.m_grow_on_next_insert;
- m_try_shrink_on_next_insert = other.m_try_shrink_on_next_insert;
- }
-
- return *this;
- }
-
- robin_hash& operator=(robin_hash&& other) {
- other.swap(*this);
- other.clear_and_shrink();
-
- return *this;
- }
-
- allocator_type get_allocator() const {
- return m_buckets_data.get_allocator();
- }
-
- /*
- * Iterators
- */
- iterator begin() noexcept {
- std::size_t i = 0;
- while (i < m_bucket_count && m_buckets[i].empty()) {
- i++;
- }
-
- return iterator(m_buckets + i);
- }
-
- const_iterator begin() const noexcept { return cbegin(); }
-
- const_iterator cbegin() const noexcept {
- std::size_t i = 0;
- while (i < m_bucket_count && m_buckets[i].empty()) {
- i++;
- }
-
- return const_iterator(m_buckets + i);
- }
-
- iterator end() noexcept { return iterator(m_buckets + m_bucket_count); }
-
- const_iterator end() const noexcept { return cend(); }
-
- const_iterator cend() const noexcept {
- return const_iterator(m_buckets + m_bucket_count);
- }
-
- /*
- * Capacity
- */
- bool empty() const noexcept { return m_nb_elements == 0; }
-
- size_type size() const noexcept { return m_nb_elements; }
-
- size_type max_size() const noexcept { return m_buckets_data.max_size(); }
-
- /*
- * Modifiers
- */
- void clear() noexcept {
- if (m_min_load_factor > 0.0f) {
- clear_and_shrink();
- } else {
- for (auto& bucket : m_buckets_data) {
- bucket.clear();
- }
-
- m_nb_elements = 0;
- m_grow_on_next_insert = false;
- }
- }
-
- template <typename P>
- std::pair<iterator, bool> insert(P&& value) {
- return insert_impl(KeySelect()(value), std::forward<P>(value));
- }
-
- template <typename P>
- iterator insert_hint(const_iterator hint, P&& value) {
- if (hint != cend() &&
- compare_keys(KeySelect()(*hint), KeySelect()(value))) {
- return mutable_iterator(hint);
- }
-
- return insert(std::forward<P>(value)).first;
- }
-
- template <class InputIt>
- void insert(InputIt first, InputIt last) {
- if (std::is_base_of<
- std::forward_iterator_tag,
- typename std::iterator_traits<InputIt>::iterator_category>::value) {
- const auto nb_elements_insert = std::distance(first, last);
- const size_type nb_free_buckets = m_load_threshold - size();
- tsl_rh_assert(m_load_threshold >= size());
-
- if (nb_elements_insert > 0 &&
- nb_free_buckets < size_type(nb_elements_insert)) {
- reserve(size() + size_type(nb_elements_insert));
- }
- }
-
- for (; first != last; ++first) {
- insert(*first);
- }
- }
-
- template <class K, class M>
- std::pair<iterator, bool> insert_or_assign(K&& key, M&& obj) {
- auto it = try_emplace(std::forward<K>(key), std::forward<M>(obj));
- if (!it.second) {
- it.first.value() = std::forward<M>(obj);
- }
-
- return it;
- }
-
- template <class K, class M>
- iterator insert_or_assign(const_iterator hint, K&& key, M&& obj) {
- if (hint != cend() && compare_keys(KeySelect()(*hint), key)) {
- auto it = mutable_iterator(hint);
- it.value() = std::forward<M>(obj);
-
- return it;
- }
-
- return insert_or_assign(std::forward<K>(key), std::forward<M>(obj)).first;
- }
-
- template <class... Args>
- std::pair<iterator, bool> emplace(Args&&... args) {
- return insert(value_type(std::forward<Args>(args)...));
- }
-
- template <class... Args>
- iterator emplace_hint(const_iterator hint, Args&&... args) {
- return insert_hint(hint, value_type(std::forward<Args>(args)...));
- }
-
- template <class K, class... Args>
- std::pair<iterator, bool> try_emplace(K&& key, Args&&... args) {
- return insert_impl(key, std::piecewise_construct,
- std::forward_as_tuple(std::forward<K>(key)),
- std::forward_as_tuple(std::forward<Args>(args)...));
- }
-
- template <class K, class... Args>
- iterator try_emplace_hint(const_iterator hint, K&& key, Args&&... args) {
- if (hint != cend() && compare_keys(KeySelect()(*hint), key)) {
- return mutable_iterator(hint);
- }
-
- return try_emplace(std::forward<K>(key), std::forward<Args>(args)...).first;
- }
-
- /**
- * Here to avoid `template<class K> size_type erase(const K& key)` being used
- * when we use an `iterator` instead of a `const_iterator`.
- */
- iterator erase(iterator pos) {
- erase_from_bucket(pos);
-
- /**
- * Erase bucket used a backward shift after clearing the bucket.
- * Check if there is a new value in the bucket, if not get the next
- * non-empty.
- */
- if (pos.m_bucket->empty()) {
- ++pos;
- }
-
- m_try_shrink_on_next_insert = true;
-
- return pos;
- }
-
- iterator erase(const_iterator pos) { return erase(mutable_iterator(pos)); }
-
- iterator erase(const_iterator first, const_iterator last) {
- if (first == last) {
- return mutable_iterator(first);
- }
-
- auto first_mutable = mutable_iterator(first);
- auto last_mutable = mutable_iterator(last);
- for (auto it = first_mutable.m_bucket; it != last_mutable.m_bucket; ++it) {
- if (!it->empty()) {
- it->clear();
- m_nb_elements--;
- }
- }
-
- if (last_mutable == end()) {
- m_try_shrink_on_next_insert = true;
- return end();
- }
-
- /*
- * Backward shift on the values which come after the deleted values.
- * We try to move the values closer to their ideal bucket.
- */
- std::size_t icloser_bucket =
- static_cast<std::size_t>(first_mutable.m_bucket - m_buckets);
- std::size_t ito_move_closer_value =
- static_cast<std::size_t>(last_mutable.m_bucket - m_buckets);
- tsl_rh_assert(ito_move_closer_value > icloser_bucket);
-
- const std::size_t ireturn_bucket =
- ito_move_closer_value -
- std::min(
- ito_move_closer_value - icloser_bucket,
- std::size_t(
- m_buckets[ito_move_closer_value].dist_from_ideal_bucket()));
-
- while (ito_move_closer_value < m_bucket_count &&
- m_buckets[ito_move_closer_value].dist_from_ideal_bucket() > 0) {
- icloser_bucket =
- ito_move_closer_value -
- std::min(
- ito_move_closer_value - icloser_bucket,
- std::size_t(
- m_buckets[ito_move_closer_value].dist_from_ideal_bucket()));
-
- tsl_rh_assert(m_buckets[icloser_bucket].empty());
- const distance_type new_distance = distance_type(
- m_buckets[ito_move_closer_value].dist_from_ideal_bucket() -
- (ito_move_closer_value - icloser_bucket));
- m_buckets[icloser_bucket].set_value_of_empty_bucket(
- new_distance, m_buckets[ito_move_closer_value].truncated_hash(),
- std::move(m_buckets[ito_move_closer_value].value()));
- m_buckets[ito_move_closer_value].clear();
-
- ++icloser_bucket;
- ++ito_move_closer_value;
- }
-
- m_try_shrink_on_next_insert = true;
-
- return iterator(m_buckets + ireturn_bucket);
- }
-
- template <class K>
- size_type erase(const K& key) {
- return erase(key, hash_key(key));
- }
-
- template <class K>
- size_type erase(const K& key, std::size_t hash) {
- auto it = find(key, hash);
- if (it != end()) {
- erase_from_bucket(it);
- m_try_shrink_on_next_insert = true;
-
- return 1;
- } else {
- return 0;
- }
- }
-
- void swap(robin_hash& other) {
- using std::swap;
-
- swap(static_cast<Hash&>(*this), static_cast<Hash&>(other));
- swap(static_cast<KeyEqual&>(*this), static_cast<KeyEqual&>(other));
- swap(static_cast<GrowthPolicy&>(*this), static_cast<GrowthPolicy&>(other));
- swap(m_buckets_data, other.m_buckets_data);
- swap(m_buckets, other.m_buckets);
- swap(m_bucket_count, other.m_bucket_count);
- swap(m_nb_elements, other.m_nb_elements);
- swap(m_load_threshold, other.m_load_threshold);
- swap(m_min_load_factor, other.m_min_load_factor);
- swap(m_max_load_factor, other.m_max_load_factor);
- swap(m_grow_on_next_insert, other.m_grow_on_next_insert);
- swap(m_try_shrink_on_next_insert, other.m_try_shrink_on_next_insert);
- }
-
- /*
- * Lookup
- */
- template <class K, class U = ValueSelect,
- typename std::enable_if<has_mapped_type<U>::value>::type* = nullptr>
- typename U::value_type& at(const K& key) {
- return at(key, hash_key(key));
- }
-
- template <class K, class U = ValueSelect,
- typename std::enable_if<has_mapped_type<U>::value>::type* = nullptr>
- typename U::value_type& at(const K& key, std::size_t hash) {
- return const_cast<typename U::value_type&>(
- static_cast<const robin_hash*>(this)->at(key, hash));
- }
-
- template <class K, class U = ValueSelect,
- typename std::enable_if<has_mapped_type<U>::value>::type* = nullptr>
- const typename U::value_type& at(const K& key) const {
- return at(key, hash_key(key));
- }
-
- template <class K, class U = ValueSelect,
- typename std::enable_if<has_mapped_type<U>::value>::type* = nullptr>
- const typename U::value_type& at(const K& key, std::size_t hash) const {
- auto it = find(key, hash);
- if (it != cend()) {
- return it.value();
- } else {
- TSL_RH_THROW_OR_TERMINATE(std::out_of_range, "Couldn't find key.");
- }
- }
-
- template <class K, class U = ValueSelect,
- typename std::enable_if<has_mapped_type<U>::value>::type* = nullptr>
- typename U::value_type& operator[](K&& key) {
- return try_emplace(std::forward<K>(key)).first.value();
- }
-
- template <class K>
- size_type count(const K& key) const {
- return count(key, hash_key(key));
- }
-
- template <class K>
- size_type count(const K& key, std::size_t hash) const {
- if (find(key, hash) != cend()) {
- return 1;
- } else {
- return 0;
- }
- }
-
- template <class K>
- iterator find(const K& key) {
- return find_impl(key, hash_key(key));
- }
-
- template <class K>
- iterator find(const K& key, std::size_t hash) {
- return find_impl(key, hash);
- }
-
- template <class K>
- const_iterator find(const K& key) const {
- return find_impl(key, hash_key(key));
- }
-
- template <class K>
- const_iterator find(const K& key, std::size_t hash) const {
- return find_impl(key, hash);
- }
-
- template <class K>
- bool contains(const K& key) const {
- return contains(key, hash_key(key));
- }
-
- template <class K>
- bool contains(const K& key, std::size_t hash) const {
- return count(key, hash) != 0;
- }
-
- template <class K>
- std::pair<iterator, iterator> equal_range(const K& key) {
- return equal_range(key, hash_key(key));
- }
-
- template <class K>
- std::pair<iterator, iterator> equal_range(const K& key, std::size_t hash) {
- iterator it = find(key, hash);
- return std::make_pair(it, (it == end()) ? it : std::next(it));
- }
-
- template <class K>
- std::pair<const_iterator, const_iterator> equal_range(const K& key) const {
- return equal_range(key, hash_key(key));
- }
-
- template <class K>
- std::pair<const_iterator, const_iterator> equal_range(
- const K& key, std::size_t hash) const {
- const_iterator it = find(key, hash);
- return std::make_pair(it, (it == cend()) ? it : std::next(it));
- }
-
- /*
- * Bucket interface
- */
- size_type bucket_count() const { return m_bucket_count; }
-
- size_type max_bucket_count() const {
- return std::min(GrowthPolicy::max_bucket_count(),
- m_buckets_data.max_size());
- }
-
- /*
- * Hash policy
- */
- float load_factor() const {
- if (bucket_count() == 0) {
- return 0;
- }
-
- return float(m_nb_elements) / float(bucket_count());
- }
-
- float min_load_factor() const { return m_min_load_factor; }
-
- float max_load_factor() const { return m_max_load_factor; }
-
- void min_load_factor(float ml) {
- m_min_load_factor = clamp(ml, float(MINIMUM_MIN_LOAD_FACTOR),
- float(MAXIMUM_MIN_LOAD_FACTOR));
- }
-
- void max_load_factor(float ml) {
- m_max_load_factor = clamp(ml, float(MINIMUM_MAX_LOAD_FACTOR),
- float(MAXIMUM_MAX_LOAD_FACTOR));
- m_load_threshold = size_type(float(bucket_count()) * m_max_load_factor);
- tsl_rh_assert(bucket_count() == 0 || m_load_threshold < bucket_count());
- }
-
- void rehash(size_type count_) {
- count_ = std::max(count_,
- size_type(std::ceil(float(size()) / max_load_factor())));
- rehash_impl(count_);
- }
-
- void reserve(size_type count_) {
- rehash(size_type(std::ceil(float(count_) / max_load_factor())));
- }
-
- /*
- * Observers
- */
- hasher hash_function() const { return static_cast<const Hash&>(*this); }
-
- key_equal key_eq() const { return static_cast<const KeyEqual&>(*this); }
-
- /*
- * Other
- */
- iterator mutable_iterator(const_iterator pos) {
- return iterator(const_cast<bucket_entry*>(pos.m_bucket));
- }
-
- template <class Serializer>
- void serialize(Serializer& serializer) const {
- serialize_impl(serializer);
- }
-
- template <class Deserializer>
- void deserialize(Deserializer& deserializer, bool hash_compatible) {
- deserialize_impl(deserializer, hash_compatible);
- }
-
- private:
- template <class K>
- std::size_t hash_key(const K& key) const {
- return Hash::operator()(key);
- }
-
- template <class K1, class K2>
- bool compare_keys(const K1& key1, const K2& key2) const {
- return KeyEqual::operator()(key1, key2);
- }
-
- std::size_t bucket_for_hash(std::size_t hash) const {
- const std::size_t bucket = GrowthPolicy::bucket_for_hash(hash);
- tsl_rh_assert(bucket < m_bucket_count ||
- (bucket == 0 && m_bucket_count == 0));
-
- return bucket;
- }
-
- template <class U = GrowthPolicy,
- typename std::enable_if<is_power_of_two_policy<U>::value>::type* =
- nullptr>
- std::size_t next_bucket(std::size_t index) const noexcept {
- tsl_rh_assert(index < bucket_count());
-
- return (index + 1) & this->m_mask;
- }
-
- template <class U = GrowthPolicy,
- typename std::enable_if<!is_power_of_two_policy<U>::value>::type* =
- nullptr>
- std::size_t next_bucket(std::size_t index) const noexcept {
- tsl_rh_assert(index < bucket_count());
-
- index++;
- return (index != bucket_count()) ? index : 0;
- }
-
- template <class K>
- iterator find_impl(const K& key, std::size_t hash) {
- return mutable_iterator(
- static_cast<const robin_hash*>(this)->find(key, hash));
- }
-
- template <class K>
- const_iterator find_impl(const K& key, std::size_t hash) const {
- std::size_t ibucket = bucket_for_hash(hash);
- distance_type dist_from_ideal_bucket = 0;
-
- while (dist_from_ideal_bucket <=
- m_buckets[ibucket].dist_from_ideal_bucket()) {
- if (TSL_RH_LIKELY(
- (!USE_STORED_HASH_ON_LOOKUP ||
- m_buckets[ibucket].bucket_hash_equal(hash)) &&
- compare_keys(KeySelect()(m_buckets[ibucket].value()), key))) {
- return const_iterator(m_buckets + ibucket);
- }
-
- ibucket = next_bucket(ibucket);
- dist_from_ideal_bucket++;
- }
-
- return cend();
- }
-
- void erase_from_bucket(iterator pos) {
- pos.m_bucket->clear();
- m_nb_elements--;
-
- /**
- * Backward shift, swap the empty bucket, previous_ibucket, with the values
- * on its right, ibucket, until we cross another empty bucket or if the
- * other bucket has a distance_from_ideal_bucket == 0.
- *
- * We try to move the values closer to their ideal bucket.
- */
- std::size_t previous_ibucket =
- static_cast<std::size_t>(pos.m_bucket - m_buckets);
- std::size_t ibucket = next_bucket(previous_ibucket);
-
- while (m_buckets[ibucket].dist_from_ideal_bucket() > 0) {
- tsl_rh_assert(m_buckets[previous_ibucket].empty());
-
- const distance_type new_distance =
- distance_type(m_buckets[ibucket].dist_from_ideal_bucket() - 1);
- m_buckets[previous_ibucket].set_value_of_empty_bucket(
- new_distance, m_buckets[ibucket].truncated_hash(),
- std::move(m_buckets[ibucket].value()));
- m_buckets[ibucket].clear();
-
- previous_ibucket = ibucket;
- ibucket = next_bucket(ibucket);
- }
- }
-
- template <class K, class... Args>
- std::pair<iterator, bool> insert_impl(const K& key,
- Args&&... value_type_args) {
- const std::size_t hash = hash_key(key);
-
- std::size_t ibucket = bucket_for_hash(hash);
- distance_type dist_from_ideal_bucket = 0;
-
- while (dist_from_ideal_bucket <=
- m_buckets[ibucket].dist_from_ideal_bucket()) {
- if ((!USE_STORED_HASH_ON_LOOKUP ||
- m_buckets[ibucket].bucket_hash_equal(hash)) &&
- compare_keys(KeySelect()(m_buckets[ibucket].value()), key)) {
- return std::make_pair(iterator(m_buckets + ibucket), false);
- }
-
- ibucket = next_bucket(ibucket);
- dist_from_ideal_bucket++;
- }
-
- while (rehash_on_extreme_load(dist_from_ideal_bucket)) {
- ibucket = bucket_for_hash(hash);
- dist_from_ideal_bucket = 0;
-
- while (dist_from_ideal_bucket <=
- m_buckets[ibucket].dist_from_ideal_bucket()) {
- ibucket = next_bucket(ibucket);
- dist_from_ideal_bucket++;
- }
- }
-
- if (m_buckets[ibucket].empty()) {
- m_buckets[ibucket].set_value_of_empty_bucket(
- dist_from_ideal_bucket, bucket_entry::truncate_hash(hash),
- std::forward<Args>(value_type_args)...);
- } else {
- insert_value(ibucket, dist_from_ideal_bucket,
- bucket_entry::truncate_hash(hash),
- std::forward<Args>(value_type_args)...);
- }
-
- m_nb_elements++;
- /*
- * The value will be inserted in ibucket in any case, either because it was
- * empty or by stealing the bucket (robin hood).
- */
- return std::make_pair(iterator(m_buckets + ibucket), true);
- }
-
- template <class... Args>
- void insert_value(std::size_t ibucket, distance_type dist_from_ideal_bucket,
- truncated_hash_type hash, Args&&... value_type_args) {
- value_type value(std::forward<Args>(value_type_args)...);
- insert_value_impl(ibucket, dist_from_ideal_bucket, hash, value);
- }
-
- void insert_value(std::size_t ibucket, distance_type dist_from_ideal_bucket,
- truncated_hash_type hash, value_type&& value) {
- insert_value_impl(ibucket, dist_from_ideal_bucket, hash, value);
- }
-
- /*
- * We don't use `value_type&& value` as last argument due to a bug in MSVC
- * when `value_type` is a pointer, The compiler is not able to see the
- * difference between `std::string*` and `std::string*&&` resulting in a
- * compilation error.
- *
- * The `value` will be in a moved state at the end of the function.
- */
- void insert_value_impl(std::size_t ibucket,
- distance_type dist_from_ideal_bucket,
- truncated_hash_type hash, value_type& value) {
- tsl_rh_assert(dist_from_ideal_bucket >
- m_buckets[ibucket].dist_from_ideal_bucket());
- m_buckets[ibucket].swap_with_value_in_bucket(dist_from_ideal_bucket, hash,
- value);
- ibucket = next_bucket(ibucket);
- dist_from_ideal_bucket++;
-
- while (!m_buckets[ibucket].empty()) {
- if (dist_from_ideal_bucket >
- m_buckets[ibucket].dist_from_ideal_bucket()) {
- if (dist_from_ideal_bucket >
- bucket_entry::DIST_FROM_IDEAL_BUCKET_LIMIT) {
- /**
- * The number of probes is really high, rehash the map on the next
- * insert. Difficult to do now as rehash may throw an exception.
- */
- m_grow_on_next_insert = true;
- }
-
- m_buckets[ibucket].swap_with_value_in_bucket(dist_from_ideal_bucket,
- hash, value);
- }
-
- ibucket = next_bucket(ibucket);
- dist_from_ideal_bucket++;
- }
-
- m_buckets[ibucket].set_value_of_empty_bucket(dist_from_ideal_bucket, hash,
- std::move(value));
- }
-
- void rehash_impl(size_type count_) {
- robin_hash new_table(count_, static_cast<Hash&>(*this),
- static_cast<KeyEqual&>(*this), get_allocator(),
- m_min_load_factor, m_max_load_factor);
- tsl_rh_assert(size() <= new_table.m_load_threshold);
-
- const bool use_stored_hash =
- USE_STORED_HASH_ON_REHASH(new_table.bucket_count());
- for (auto& bucket : m_buckets_data) {
- if (bucket.empty()) {
- continue;
- }
-
- const std::size_t hash =
- use_stored_hash ? bucket.truncated_hash()
- : new_table.hash_key(KeySelect()(bucket.value()));
-
- new_table.insert_value_on_rehash(new_table.bucket_for_hash(hash), 0,
- bucket_entry::truncate_hash(hash),
- std::move(bucket.value()));
- }
-
- new_table.m_nb_elements = m_nb_elements;
- new_table.swap(*this);
- }
-
- void clear_and_shrink() noexcept {
- GrowthPolicy::clear();
- m_buckets_data.clear();
- m_buckets = static_empty_bucket_ptr();
- m_bucket_count = 0;
- m_nb_elements = 0;
- m_load_threshold = 0;
- m_grow_on_next_insert = false;
- m_try_shrink_on_next_insert = false;
- }
-
- void insert_value_on_rehash(std::size_t ibucket,
- distance_type dist_from_ideal_bucket,
- truncated_hash_type hash, value_type&& value) {
- while (true) {
- if (dist_from_ideal_bucket >
- m_buckets[ibucket].dist_from_ideal_bucket()) {
- if (m_buckets[ibucket].empty()) {
- m_buckets[ibucket].set_value_of_empty_bucket(dist_from_ideal_bucket,
- hash, std::move(value));
- return;
- } else {
- m_buckets[ibucket].swap_with_value_in_bucket(dist_from_ideal_bucket,
- hash, value);
- }
- }
-
- dist_from_ideal_bucket++;
- ibucket = next_bucket(ibucket);
- }
- }
-
- /**
- * Grow the table if m_grow_on_next_insert is true or we reached the
- * max_load_factor. Shrink the table if m_try_shrink_on_next_insert is true
- * (an erase occurred) and we're below the min_load_factor.
- *
- * Return true if the table has been rehashed.
- */
- bool rehash_on_extreme_load(distance_type curr_dist_from_ideal_bucket) {
- if (m_grow_on_next_insert ||
- curr_dist_from_ideal_bucket >
- bucket_entry::DIST_FROM_IDEAL_BUCKET_LIMIT ||
- size() >= m_load_threshold) {
- rehash_impl(GrowthPolicy::next_bucket_count());
- m_grow_on_next_insert = false;
-
- return true;
- }
-
- if (m_try_shrink_on_next_insert) {
- m_try_shrink_on_next_insert = false;
- if (m_min_load_factor != 0.0f && load_factor() < m_min_load_factor) {
- reserve(size() + 1);
-
- return true;
- }
- }
-
- return false;
- }
-
- template <class Serializer>
- void serialize_impl(Serializer& serializer) const {
- const slz_size_type version = SERIALIZATION_PROTOCOL_VERSION;
- serializer(version);
-
- // Indicate if the truncated hash of each bucket is stored. Use a
- // std::int16_t instead of a bool to avoid the need for the serializer to
- // support an extra 'bool' type.
- const std::int16_t hash_stored_for_bucket =
- static_cast<std::int16_t>(STORE_HASH);
- serializer(hash_stored_for_bucket);
-
- const slz_size_type nb_elements = m_nb_elements;
- serializer(nb_elements);
-
- const slz_size_type bucket_count = m_buckets_data.size();
- serializer(bucket_count);
-
- const float min_load_factor = m_min_load_factor;
- serializer(min_load_factor);
-
- const float max_load_factor = m_max_load_factor;
- serializer(max_load_factor);
-
- for (const bucket_entry& bucket : m_buckets_data) {
- if (bucket.empty()) {
- const std::int16_t empty_bucket =
- bucket_entry::EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET;
- serializer(empty_bucket);
- } else {
- const std::int16_t dist_from_ideal_bucket =
- bucket.dist_from_ideal_bucket();
- serializer(dist_from_ideal_bucket);
- if (STORE_HASH) {
- const std::uint32_t truncated_hash = bucket.truncated_hash();
- serializer(truncated_hash);
- }
- serializer(bucket.value());
- }
- }
- }
-
- template <class Deserializer>
- void deserialize_impl(Deserializer& deserializer, bool hash_compatible) {
- tsl_rh_assert(m_buckets_data.empty()); // Current hash table must be empty
-
- const slz_size_type version =
- deserialize_value<slz_size_type>(deserializer);
- // For now we only have one version of the serialization protocol.
- // If it doesn't match there is a problem with the file.
- if (version != SERIALIZATION_PROTOCOL_VERSION) {
- TSL_RH_THROW_OR_TERMINATE(std::runtime_error,
- "Can't deserialize the ordered_map/set. "
- "The protocol version header is invalid.");
- }
-
- const bool hash_stored_for_bucket =
- deserialize_value<std::int16_t>(deserializer) ? true : false;
- if (hash_compatible && STORE_HASH != hash_stored_for_bucket) {
- TSL_RH_THROW_OR_TERMINATE(
- std::runtime_error,
- "Can't deserialize a map with a different StoreHash "
- "than the one used during the serialization when "
- "hash compatibility is used");
- }
-
- const slz_size_type nb_elements =
- deserialize_value<slz_size_type>(deserializer);
- const slz_size_type bucket_count_ds =
- deserialize_value<slz_size_type>(deserializer);
- const float min_load_factor = deserialize_value<float>(deserializer);
- const float max_load_factor = deserialize_value<float>(deserializer);
-
- if (min_load_factor < MINIMUM_MIN_LOAD_FACTOR ||
- min_load_factor > MAXIMUM_MIN_LOAD_FACTOR) {
- TSL_RH_THROW_OR_TERMINATE(
- std::runtime_error,
- "Invalid min_load_factor. Check that the serializer "
- "and deserializer support floats correctly as they "
- "can be converted implicitly to ints.");
- }
-
- if (max_load_factor < MINIMUM_MAX_LOAD_FACTOR ||
- max_load_factor > MAXIMUM_MAX_LOAD_FACTOR) {
- TSL_RH_THROW_OR_TERMINATE(
- std::runtime_error,
- "Invalid max_load_factor. Check that the serializer "
- "and deserializer support floats correctly as they "
- "can be converted implicitly to ints.");
- }
-
- this->min_load_factor(min_load_factor);
- this->max_load_factor(max_load_factor);
-
- if (bucket_count_ds == 0) {
- tsl_rh_assert(nb_elements == 0);
- return;
- }
-
- if (!hash_compatible) {
- reserve(numeric_cast<size_type>(nb_elements,
- "Deserialized nb_elements is too big."));
- for (slz_size_type ibucket = 0; ibucket < bucket_count_ds; ibucket++) {
- const distance_type dist_from_ideal_bucket =
- deserialize_value<std::int16_t>(deserializer);
- if (dist_from_ideal_bucket !=
- bucket_entry::EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET) {
- if (hash_stored_for_bucket) {
- TSL_RH_UNUSED(deserialize_value<std::uint32_t>(deserializer));
- }
-
- insert(deserialize_value<value_type>(deserializer));
- }
- }
-
- tsl_rh_assert(nb_elements == size());
- } else {
- m_bucket_count = numeric_cast<size_type>(
- bucket_count_ds, "Deserialized bucket_count is too big.");
-
- GrowthPolicy::operator=(GrowthPolicy(m_bucket_count));
- // GrowthPolicy should not modify the bucket count we got from
- // deserialization
- if (m_bucket_count != bucket_count_ds) {
- TSL_RH_THROW_OR_TERMINATE(std::runtime_error,
- "The GrowthPolicy is not the same even "
- "though hash_compatible is true.");
- }
-
- m_nb_elements = numeric_cast<size_type>(
- nb_elements, "Deserialized nb_elements is too big.");
- m_buckets_data.resize(m_bucket_count);
- m_buckets = m_buckets_data.data();
-
- for (bucket_entry& bucket : m_buckets_data) {
- const distance_type dist_from_ideal_bucket =
- deserialize_value<std::int16_t>(deserializer);
- if (dist_from_ideal_bucket !=
- bucket_entry::EMPTY_MARKER_DIST_FROM_IDEAL_BUCKET) {
- truncated_hash_type truncated_hash = 0;
- if (hash_stored_for_bucket) {
- tsl_rh_assert(hash_stored_for_bucket);
- truncated_hash = deserialize_value<std::uint32_t>(deserializer);
- }
-
- bucket.set_value_of_empty_bucket(
- dist_from_ideal_bucket, truncated_hash,
- deserialize_value<value_type>(deserializer));
- }
- }
-
- if (!m_buckets_data.empty()) {
- m_buckets_data.back().set_as_last_bucket();
- }
- }
- }
-
- public:
- static const size_type DEFAULT_INIT_BUCKETS_SIZE = 0;
-
- static constexpr float DEFAULT_MAX_LOAD_FACTOR = 0.5f;
- static constexpr float MINIMUM_MAX_LOAD_FACTOR = 0.2f;
- static constexpr float MAXIMUM_MAX_LOAD_FACTOR = 0.95f;
-
- static constexpr float DEFAULT_MIN_LOAD_FACTOR = 0.0f;
- static constexpr float MINIMUM_MIN_LOAD_FACTOR = 0.0f;
- static constexpr float MAXIMUM_MIN_LOAD_FACTOR = 0.15f;
-
- static_assert(MINIMUM_MAX_LOAD_FACTOR < MAXIMUM_MAX_LOAD_FACTOR,
- "MINIMUM_MAX_LOAD_FACTOR should be < MAXIMUM_MAX_LOAD_FACTOR");
- static_assert(MINIMUM_MIN_LOAD_FACTOR < MAXIMUM_MIN_LOAD_FACTOR,
- "MINIMUM_MIN_LOAD_FACTOR should be < MAXIMUM_MIN_LOAD_FACTOR");
- static_assert(MAXIMUM_MIN_LOAD_FACTOR < MINIMUM_MAX_LOAD_FACTOR,
- "MAXIMUM_MIN_LOAD_FACTOR should be < MINIMUM_MAX_LOAD_FACTOR");
-
- private:
- /**
- * Protocol version currenlty used for serialization.
- */
- static const slz_size_type SERIALIZATION_PROTOCOL_VERSION = 1;
-
- /**
- * Return an always valid pointer to an static empty bucket_entry with
- * last_bucket() == true.
- */
- bucket_entry* static_empty_bucket_ptr() noexcept {
- static bucket_entry empty_bucket(true);
- tsl_rh_assert(empty_bucket.empty());
- return &empty_bucket;
- }
-
- private:
- buckets_container_type m_buckets_data;
-
- /**
- * Points to m_buckets_data.data() if !m_buckets_data.empty() otherwise points
- * to static_empty_bucket_ptr. This variable is useful to avoid the cost of
- * checking if m_buckets_data is empty when trying to find an element.
- *
- * TODO Remove m_buckets_data and only use a pointer instead of a
- * pointer+vector to save some space in the robin_hash object. Manage the
- * Allocator manually.
- */
- bucket_entry* m_buckets;
-
- /**
- * Used a lot in find, avoid the call to m_buckets_data.size() which is a bit
- * slower.
- */
- size_type m_bucket_count;
-
- size_type m_nb_elements;
-
- size_type m_load_threshold;
-
- float m_min_load_factor;
- float m_max_load_factor;
-
- bool m_grow_on_next_insert;
-
- /**
- * We can't shrink down the map on erase operations as the erase methods need
- * to return the next iterator. Shrinking the map would invalidate all the
- * iterators and we could not return the next iterator in a meaningful way, On
- * erase, we thus just indicate on erase that we should try to shrink the hash
- * table on the next insert if we go below the min_load_factor.
- */
- bool m_try_shrink_on_next_insert;
-};
-
-} // namespace detail_robin_hash
-
-} // namespace tsl
-
-#endif
diff --git a/3rdparty/robin-map/include/tsl/robin_map.h b/3rdparty/robin-map/include/tsl/robin_map.h
deleted file mode 100644
index aeb354c..0000000
--- a/3rdparty/robin-map/include/tsl/robin_map.h
+++ /dev/null
@@ -1,807 +0,0 @@
-/**
- * MIT License
- *
- * Copyright (c) 2017 Thibaut Goetghebuer-Planchon <tessil@gmx.com>
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-#ifndef TSL_ROBIN_MAP_H
-#define TSL_ROBIN_MAP_H
-
-#include <cstddef>
-#include <functional>
-#include <initializer_list>
-#include <memory>
-#include <type_traits>
-#include <utility>
-
-#include "robin_hash.h"
-
-namespace tsl {
-
-/**
- * Implementation of a hash map using open-addressing and the robin hood hashing
- * algorithm with backward shift deletion.
- *
- * For operations modifying the hash map (insert, erase, rehash, ...), the
- * strong exception guarantee is only guaranteed when the expression
- * `std::is_nothrow_swappable<std::pair<Key, T>>::value &&
- * std::is_nothrow_move_constructible<std::pair<Key, T>>::value` is true,
- * otherwise if an exception is thrown during the swap or the move, the hash map
- * may end up in a undefined state. Per the standard a `Key` or `T` with a
- * noexcept copy constructor and no move constructor also satisfies the
- * `std::is_nothrow_move_constructible<std::pair<Key, T>>::value` criterion (and
- * will thus guarantee the strong exception for the map).
- *
- * When `StoreHash` is true, 32 bits of the hash are stored alongside the
- * values. It can improve the performance during lookups if the `KeyEqual`
- * function takes time (if it engenders a cache-miss for example) as we then
- * compare the stored hashes before comparing the keys. When
- * `tsl::rh::power_of_two_growth_policy` is used as `GrowthPolicy`, it may also
- * speed-up the rehash process as we can avoid to recalculate the hash. When it
- * is detected that storing the hash will not incur any memory penalty due to
- * alignment (i.e. `sizeof(tsl::detail_robin_hash::bucket_entry<ValueType,
- * true>) == sizeof(tsl::detail_robin_hash::bucket_entry<ValueType, false>)`)
- * and `tsl::rh::power_of_two_growth_policy` is used, the hash will be stored
- * even if `StoreHash` is false so that we can speed-up the rehash (but it will
- * not be used on lookups unless `StoreHash` is true).
- *
- * `GrowthPolicy` defines how the map grows and consequently how a hash value is
- * mapped to a bucket. By default the map uses
- * `tsl::rh::power_of_two_growth_policy`. This policy keeps the number of
- * buckets to a power of two and uses a mask to map the hash to a bucket instead
- * of the slow modulo. Other growth policies are available and you may define
- * your own growth policy, check `tsl::rh::power_of_two_growth_policy` for the
- * interface.
- *
- * `std::pair<Key, T>` must be swappable.
- *
- * `Key` and `T` must be copy and/or move constructible.
- *
- * If the destructor of `Key` or `T` throws an exception, the behaviour of the
- * class is undefined.
- *
- * Iterators invalidation:
- * - clear, operator=, reserve, rehash: always invalidate the iterators.
- * - insert, emplace, emplace_hint, operator[]: if there is an effective
- * insert, invalidate the iterators.
- * - erase: always invalidate the iterators.
- */
-template <class Key, class T, class Hash = std::hash<Key>,
- class KeyEqual = std::equal_to<Key>,
- class Allocator = std::allocator<std::pair<Key, T>>,
- bool StoreHash = false,
- class GrowthPolicy = tsl::rh::power_of_two_growth_policy<2>>
-class robin_map {
- private:
- template <typename U>
- using has_is_transparent = tsl::detail_robin_hash::has_is_transparent<U>;
-
- class KeySelect {
- public:
- using key_type = Key;
-
- const key_type& operator()(
- const std::pair<Key, T>& key_value) const noexcept {
- return key_value.first;
- }
-
- key_type& operator()(std::pair<Key, T>& key_value) noexcept {
- return key_value.first;
- }
- };
-
- class ValueSelect {
- public:
- using value_type = T;
-
- const value_type& operator()(
- const std::pair<Key, T>& key_value) const noexcept {
- return key_value.second;
- }
-
- value_type& operator()(std::pair<Key, T>& key_value) noexcept {
- return key_value.second;
- }
- };
-
- using ht = detail_robin_hash::robin_hash<std::pair<Key, T>, KeySelect,
- ValueSelect, Hash, KeyEqual,
- Allocator, StoreHash, GrowthPolicy>;
-
- public:
- using key_type = typename ht::key_type;
- using mapped_type = T;
- using value_type = typename ht::value_type;
- using size_type = typename ht::size_type;
- using difference_type = typename ht::difference_type;
- using hasher = typename ht::hasher;
- using key_equal = typename ht::key_equal;
- using allocator_type = typename ht::allocator_type;
- using reference = typename ht::reference;
- using const_reference = typename ht::const_reference;
- using pointer = typename ht::pointer;
- using const_pointer = typename ht::const_pointer;
- using iterator = typename ht::iterator;
- using const_iterator = typename ht::const_iterator;
-
- public:
- /*
- * Constructors
- */
- robin_map() : robin_map(ht::DEFAULT_INIT_BUCKETS_SIZE) {}
-
- explicit robin_map(size_type bucket_count, const Hash& hash = Hash(),
- const KeyEqual& equal = KeyEqual(),
- const Allocator& alloc = Allocator())
- : m_ht(bucket_count, hash, equal, alloc) {}
-
- robin_map(size_type bucket_count, const Allocator& alloc)
- : robin_map(bucket_count, Hash(), KeyEqual(), alloc) {}
-
- robin_map(size_type bucket_count, const Hash& hash, const Allocator& alloc)
- : robin_map(bucket_count, hash, KeyEqual(), alloc) {}
-
- explicit robin_map(const Allocator& alloc)
- : robin_map(ht::DEFAULT_INIT_BUCKETS_SIZE, alloc) {}
-
- template <class InputIt>
- robin_map(InputIt first, InputIt last,
- size_type bucket_count = ht::DEFAULT_INIT_BUCKETS_SIZE,
- const Hash& hash = Hash(), const KeyEqual& equal = KeyEqual(),
- const Allocator& alloc = Allocator())
- : robin_map(bucket_count, hash, equal, alloc) {
- insert(first, last);
- }
-
- template <class InputIt>
- robin_map(InputIt first, InputIt last, size_type bucket_count,
- const Allocator& alloc)
- : robin_map(first, last, bucket_count, Hash(), KeyEqual(), alloc) {}
-
- template <class InputIt>
- robin_map(InputIt first, InputIt last, size_type bucket_count,
- const Hash& hash, const Allocator& alloc)
- : robin_map(first, last, bucket_count, hash, KeyEqual(), alloc) {}
-
- robin_map(std::initializer_list<value_type> init,
- size_type bucket_count = ht::DEFAULT_INIT_BUCKETS_SIZE,
- const Hash& hash = Hash(), const KeyEqual& equal = KeyEqual(),
- const Allocator& alloc = Allocator())
- : robin_map(init.begin(), init.end(), bucket_count, hash, equal, alloc) {}
-
- robin_map(std::initializer_list<value_type> init, size_type bucket_count,
- const Allocator& alloc)
- : robin_map(init.begin(), init.end(), bucket_count, Hash(), KeyEqual(),
- alloc) {}
-
- robin_map(std::initializer_list<value_type> init, size_type bucket_count,
- const Hash& hash, const Allocator& alloc)
- : robin_map(init.begin(), init.end(), bucket_count, hash, KeyEqual(),
- alloc) {}
-
- robin_map& operator=(std::initializer_list<value_type> ilist) {
- m_ht.clear();
-
- m_ht.reserve(ilist.size());
- m_ht.insert(ilist.begin(), ilist.end());
-
- return *this;
- }
-
- allocator_type get_allocator() const { return m_ht.get_allocator(); }
-
- /*
- * Iterators
- */
- iterator begin() noexcept { return m_ht.begin(); }
- const_iterator begin() const noexcept { return m_ht.begin(); }
- const_iterator cbegin() const noexcept { return m_ht.cbegin(); }
-
- iterator end() noexcept { return m_ht.end(); }
- const_iterator end() const noexcept { return m_ht.end(); }
- const_iterator cend() const noexcept { return m_ht.cend(); }
-
- /*
- * Capacity
- */
- bool empty() const noexcept { return m_ht.empty(); }
- size_type size() const noexcept { return m_ht.size(); }
- size_type max_size() const noexcept { return m_ht.max_size(); }
-
- /*
- * Modifiers
- */
- void clear() noexcept { m_ht.clear(); }
-
- std::pair<iterator, bool> insert(const value_type& value) {
- return m_ht.insert(value);
- }
-
- template <class P, typename std::enable_if<std::is_constructible<
- value_type, P&&>::value>::type* = nullptr>
- std::pair<iterator, bool> insert(P&& value) {
- return m_ht.emplace(std::forward<P>(value));
- }
-
- std::pair<iterator, bool> insert(value_type&& value) {
- return m_ht.insert(std::move(value));
- }
-
- iterator insert(const_iterator hint, const value_type& value) {
- return m_ht.insert_hint(hint, value);
- }
-
- template <class P, typename std::enable_if<std::is_constructible<
- value_type, P&&>::value>::type* = nullptr>
- iterator insert(const_iterator hint, P&& value) {
- return m_ht.emplace_hint(hint, std::forward<P>(value));
- }
-
- iterator insert(const_iterator hint, value_type&& value) {
- return m_ht.insert_hint(hint, std::move(value));
- }
-
- template <class InputIt>
- void insert(InputIt first, InputIt last) {
- m_ht.insert(first, last);
- }
-
- void insert(std::initializer_list<value_type> ilist) {
- m_ht.insert(ilist.begin(), ilist.end());
- }
-
- template <class M>
- std::pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj) {
- return m_ht.insert_or_assign(k, std::forward<M>(obj));
- }
-
- template <class M>
- std::pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj) {
- return m_ht.insert_or_assign(std::move(k), std::forward<M>(obj));
- }
-
- template <class M>
- iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj) {
- return m_ht.insert_or_assign(hint, k, std::forward<M>(obj));
- }
-
- template <class M>
- iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj) {
- return m_ht.insert_or_assign(hint, std::move(k), std::forward<M>(obj));
- }
-
- /**
- * Due to the way elements are stored, emplace will need to move or copy the
- * key-value once. The method is equivalent to
- * insert(value_type(std::forward<Args>(args)...));
- *
- * Mainly here for compatibility with the std::unordered_map interface.
- */
- template <class... Args>
- std::pair<iterator, bool> emplace(Args&&... args) {
- return m_ht.emplace(std::forward<Args>(args)...);
- }
-
- /**
- * Due to the way elements are stored, emplace_hint will need to move or copy
- * the key-value once. The method is equivalent to insert(hint,
- * value_type(std::forward<Args>(args)...));
- *
- * Mainly here for compatibility with the std::unordered_map interface.
- */
- template <class... Args>
- iterator emplace_hint(const_iterator hint, Args&&... args) {
- return m_ht.emplace_hint(hint, std::forward<Args>(args)...);
- }
-
- template <class... Args>
- std::pair<iterator, bool> try_emplace(const key_type& k, Args&&... args) {
- return m_ht.try_emplace(k, std::forward<Args>(args)...);
- }
-
- template <class... Args>
- std::pair<iterator, bool> try_emplace(key_type&& k, Args&&... args) {
- return m_ht.try_emplace(std::move(k), std::forward<Args>(args)...);
- }
-
- template <class... Args>
- iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args) {
- return m_ht.try_emplace_hint(hint, k, std::forward<Args>(args)...);
- }
-
- template <class... Args>
- iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args) {
- return m_ht.try_emplace_hint(hint, std::move(k),
- std::forward<Args>(args)...);
- }
-
- iterator erase(iterator pos) { return m_ht.erase(pos); }
- iterator erase(const_iterator pos) { return m_ht.erase(pos); }
- iterator erase(const_iterator first, const_iterator last) {
- return m_ht.erase(first, last);
- }
- size_type erase(const key_type& key) { return m_ht.erase(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup to the value if you already have the hash.
- */
- size_type erase(const key_type& key, std::size_t precalculated_hash) {
- return m_ht.erase(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type erase(const K& key) {
- return m_ht.erase(key);
- }
-
- /**
- * @copydoc erase(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup to the value if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type erase(const K& key, std::size_t precalculated_hash) {
- return m_ht.erase(key, precalculated_hash);
- }
-
- void swap(robin_map& other) { other.m_ht.swap(m_ht); }
-
- /*
- * Lookup
- */
- T& at(const Key& key) { return m_ht.at(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- T& at(const Key& key, std::size_t precalculated_hash) {
- return m_ht.at(key, precalculated_hash);
- }
-
- const T& at(const Key& key) const { return m_ht.at(key); }
-
- /**
- * @copydoc at(const Key& key, std::size_t precalculated_hash)
- */
- const T& at(const Key& key, std::size_t precalculated_hash) const {
- return m_ht.at(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- T& at(const K& key) {
- return m_ht.at(key);
- }
-
- /**
- * @copydoc at(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- T& at(const K& key, std::size_t precalculated_hash) {
- return m_ht.at(key, precalculated_hash);
- }
-
- /**
- * @copydoc at(const K& key)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- const T& at(const K& key) const {
- return m_ht.at(key);
- }
-
- /**
- * @copydoc at(const K& key, std::size_t precalculated_hash)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- const T& at(const K& key, std::size_t precalculated_hash) const {
- return m_ht.at(key, precalculated_hash);
- }
-
- T& operator[](const Key& key) { return m_ht[key]; }
- T& operator[](Key&& key) { return m_ht[std::move(key)]; }
-
- size_type count(const Key& key) const { return m_ht.count(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- size_type count(const Key& key, std::size_t precalculated_hash) const {
- return m_ht.count(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type count(const K& key) const {
- return m_ht.count(key);
- }
-
- /**
- * @copydoc count(const K& key) const
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type count(const K& key, std::size_t precalculated_hash) const {
- return m_ht.count(key, precalculated_hash);
- }
-
- iterator find(const Key& key) { return m_ht.find(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- iterator find(const Key& key, std::size_t precalculated_hash) {
- return m_ht.find(key, precalculated_hash);
- }
-
- const_iterator find(const Key& key) const { return m_ht.find(key); }
-
- /**
- * @copydoc find(const Key& key, std::size_t precalculated_hash)
- */
- const_iterator find(const Key& key, std::size_t precalculated_hash) const {
- return m_ht.find(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- iterator find(const K& key) {
- return m_ht.find(key);
- }
-
- /**
- * @copydoc find(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- iterator find(const K& key, std::size_t precalculated_hash) {
- return m_ht.find(key, precalculated_hash);
- }
-
- /**
- * @copydoc find(const K& key)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- const_iterator find(const K& key) const {
- return m_ht.find(key);
- }
-
- /**
- * @copydoc find(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- const_iterator find(const K& key, std::size_t precalculated_hash) const {
- return m_ht.find(key, precalculated_hash);
- }
-
- bool contains(const Key& key) const { return m_ht.contains(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- bool contains(const Key& key, std::size_t precalculated_hash) const {
- return m_ht.contains(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- bool contains(const K& key) const {
- return m_ht.contains(key);
- }
-
- /**
- * @copydoc contains(const K& key) const
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- bool contains(const K& key, std::size_t precalculated_hash) const {
- return m_ht.contains(key, precalculated_hash);
- }
-
- std::pair<iterator, iterator> equal_range(const Key& key) {
- return m_ht.equal_range(key);
- }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- std::pair<iterator, iterator> equal_range(const Key& key,
- std::size_t precalculated_hash) {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- std::pair<const_iterator, const_iterator> equal_range(const Key& key) const {
- return m_ht.equal_range(key);
- }
-
- /**
- * @copydoc equal_range(const Key& key, std::size_t precalculated_hash)
- */
- std::pair<const_iterator, const_iterator> equal_range(
- const Key& key, std::size_t precalculated_hash) const {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<iterator, iterator> equal_range(const K& key) {
- return m_ht.equal_range(key);
- }
-
- /**
- * @copydoc equal_range(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<iterator, iterator> equal_range(const K& key,
- std::size_t precalculated_hash) {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- /**
- * @copydoc equal_range(const K& key)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<const_iterator, const_iterator> equal_range(const K& key) const {
- return m_ht.equal_range(key);
- }
-
- /**
- * @copydoc equal_range(const K& key, std::size_t precalculated_hash)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<const_iterator, const_iterator> equal_range(
- const K& key, std::size_t precalculated_hash) const {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- /*
- * Bucket interface
- */
- size_type bucket_count() const { return m_ht.bucket_count(); }
- size_type max_bucket_count() const { return m_ht.max_bucket_count(); }
-
- /*
- * Hash policy
- */
- float load_factor() const { return m_ht.load_factor(); }
-
- float min_load_factor() const { return m_ht.min_load_factor(); }
- float max_load_factor() const { return m_ht.max_load_factor(); }
-
- /**
- * Set the `min_load_factor` to `ml`. When the `load_factor` of the map goes
- * below `min_load_factor` after some erase operations, the map will be
- * shrunk when an insertion occurs. The erase method itself never shrinks
- * the map.
- *
- * The default value of `min_load_factor` is 0.0f, the map never shrinks by
- * default.
- */
- void min_load_factor(float ml) { m_ht.min_load_factor(ml); }
- void max_load_factor(float ml) { m_ht.max_load_factor(ml); }
-
- void rehash(size_type count_) { m_ht.rehash(count_); }
- void reserve(size_type count_) { m_ht.reserve(count_); }
-
- /*
- * Observers
- */
- hasher hash_function() const { return m_ht.hash_function(); }
- key_equal key_eq() const { return m_ht.key_eq(); }
-
- /*
- * Other
- */
-
- /**
- * Convert a const_iterator to an iterator.
- */
- iterator mutable_iterator(const_iterator pos) {
- return m_ht.mutable_iterator(pos);
- }
-
- /**
- * Serialize the map through the `serializer` parameter.
- *
- * The `serializer` parameter must be a function object that supports the
- * following call:
- * - `template<typename U> void operator()(const U& value);` where the types
- * `std::int16_t`, `std::uint32_t`, `std::uint64_t`, `float` and
- * `std::pair<Key, T>` must be supported for U.
- *
- * The implementation leaves binary compatibility (endianness, IEEE 754 for
- * floats, ...) of the types it serializes in the hands of the `Serializer`
- * function object if compatibility is required.
- */
- template <class Serializer>
- void serialize(Serializer& serializer) const {
- m_ht.serialize(serializer);
- }
-
- /**
- * Deserialize a previously serialized map through the `deserializer`
- * parameter.
- *
- * The `deserializer` parameter must be a function object that supports the
- * following call:
- * - `template<typename U> U operator()();` where the types `std::int16_t`,
- * `std::uint32_t`, `std::uint64_t`, `float` and `std::pair<Key, T>` must be
- * supported for U.
- *
- * If the deserialized hash map type is hash compatible with the serialized
- * map, the deserialization process can be sped up by setting
- * `hash_compatible` to true. To be hash compatible, the Hash, KeyEqual and
- * GrowthPolicy must behave the same way than the ones used on the serialized
- * map and the StoreHash must have the same value. The `std::size_t` must also
- * be of the same size as the one on the platform used to serialize the map.
- * If these criteria are not met, the behaviour is undefined with
- * `hash_compatible` sets to true.
- *
- * The behaviour is undefined if the type `Key` and `T` of the `robin_map` are
- * not the same as the types used during serialization.
- *
- * The implementation leaves binary compatibility (endianness, IEEE 754 for
- * floats, size of int, ...) of the types it deserializes in the hands of the
- * `Deserializer` function object if compatibility is required.
- */
- template <class Deserializer>
- static robin_map deserialize(Deserializer& deserializer,
- bool hash_compatible = false) {
- robin_map map(0);
- map.m_ht.deserialize(deserializer, hash_compatible);
-
- return map;
- }
-
- friend bool operator==(const robin_map& lhs, const robin_map& rhs) {
- if (lhs.size() != rhs.size()) {
- return false;
- }
-
- for (const auto& element_lhs : lhs) {
- const auto it_element_rhs = rhs.find(element_lhs.first);
- if (it_element_rhs == rhs.cend() ||
- element_lhs.second != it_element_rhs->second) {
- return false;
- }
- }
-
- return true;
- }
-
- friend bool operator!=(const robin_map& lhs, const robin_map& rhs) {
- return !operator==(lhs, rhs);
- }
-
- friend void swap(robin_map& lhs, robin_map& rhs) { lhs.swap(rhs); }
-
- private:
- ht m_ht;
-};
-
-/**
- * Same as `tsl::robin_map<Key, T, Hash, KeyEqual, Allocator, StoreHash,
- * tsl::rh::prime_growth_policy>`.
- */
-template <class Key, class T, class Hash = std::hash<Key>,
- class KeyEqual = std::equal_to<Key>,
- class Allocator = std::allocator<std::pair<Key, T>>,
- bool StoreHash = false>
-using robin_pg_map = robin_map<Key, T, Hash, KeyEqual, Allocator, StoreHash,
- tsl::rh::prime_growth_policy>;
-
-} // end namespace tsl
-
-#endif
diff --git a/3rdparty/robin-map/include/tsl/robin_set.h b/3rdparty/robin-map/include/tsl/robin_set.h
deleted file mode 100644
index 5478950..0000000
--- a/3rdparty/robin-map/include/tsl/robin_set.h
+++ /dev/null
@@ -1,660 +0,0 @@
-/**
- * MIT License
- *
- * Copyright (c) 2017 Thibaut Goetghebuer-Planchon <tessil@gmx.com>
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-#ifndef TSL_ROBIN_SET_H
-#define TSL_ROBIN_SET_H
-
-#include <cstddef>
-#include <functional>
-#include <initializer_list>
-#include <memory>
-#include <type_traits>
-#include <utility>
-
-#include "robin_hash.h"
-
-namespace tsl {
-
-/**
- * Implementation of a hash set using open-addressing and the robin hood hashing
- * algorithm with backward shift deletion.
- *
- * For operations modifying the hash set (insert, erase, rehash, ...), the
- * strong exception guarantee is only guaranteed when the expression
- * `std::is_nothrow_swappable<Key>::value &&
- * std::is_nothrow_move_constructible<Key>::value` is true, otherwise if an
- * exception is thrown during the swap or the move, the hash set may end up in a
- * undefined state. Per the standard a `Key` with a noexcept copy constructor
- * and no move constructor also satisfies the
- * `std::is_nothrow_move_constructible<Key>::value` criterion (and will thus
- * guarantee the strong exception for the set).
- *
- * When `StoreHash` is true, 32 bits of the hash are stored alongside the
- * values. It can improve the performance during lookups if the `KeyEqual`
- * function takes time (or engenders a cache-miss for example) as we then
- * compare the stored hashes before comparing the keys. When
- * `tsl::rh::power_of_two_growth_policy` is used as `GrowthPolicy`, it may also
- * speed-up the rehash process as we can avoid to recalculate the hash. When it
- * is detected that storing the hash will not incur any memory penalty due to
- * alignment (i.e. `sizeof(tsl::detail_robin_hash::bucket_entry<ValueType,
- * true>) == sizeof(tsl::detail_robin_hash::bucket_entry<ValueType, false>)`)
- * and `tsl::rh::power_of_two_growth_policy` is used, the hash will be stored
- * even if `StoreHash` is false so that we can speed-up the rehash (but it will
- * not be used on lookups unless `StoreHash` is true).
- *
- * `GrowthPolicy` defines how the set grows and consequently how a hash value is
- * mapped to a bucket. By default the set uses
- * `tsl::rh::power_of_two_growth_policy`. This policy keeps the number of
- * buckets to a power of two and uses a mask to set the hash to a bucket instead
- * of the slow modulo. Other growth policies are available and you may define
- * your own growth policy, check `tsl::rh::power_of_two_growth_policy` for the
- * interface.
- *
- * `Key` must be swappable.
- *
- * `Key` must be copy and/or move constructible.
- *
- * If the destructor of `Key` throws an exception, the behaviour of the class is
- * undefined.
- *
- * Iterators invalidation:
- * - clear, operator=, reserve, rehash: always invalidate the iterators.
- * - insert, emplace, emplace_hint, operator[]: if there is an effective
- * insert, invalidate the iterators.
- * - erase: always invalidate the iterators.
- */
-template <class Key, class Hash = std::hash<Key>,
- class KeyEqual = std::equal_to<Key>,
- class Allocator = std::allocator<Key>, bool StoreHash = false,
- class GrowthPolicy = tsl::rh::power_of_two_growth_policy<2>>
-class robin_set {
- private:
- template <typename U>
- using has_is_transparent = tsl::detail_robin_hash::has_is_transparent<U>;
-
- class KeySelect {
- public:
- using key_type = Key;
-
- const key_type& operator()(const Key& key) const noexcept { return key; }
-
- key_type& operator()(Key& key) noexcept { return key; }
- };
-
- using ht = detail_robin_hash::robin_hash<Key, KeySelect, void, Hash, KeyEqual,
- Allocator, StoreHash, GrowthPolicy>;
-
- public:
- using key_type = typename ht::key_type;
- using value_type = typename ht::value_type;
- using size_type = typename ht::size_type;
- using difference_type = typename ht::difference_type;
- using hasher = typename ht::hasher;
- using key_equal = typename ht::key_equal;
- using allocator_type = typename ht::allocator_type;
- using reference = typename ht::reference;
- using const_reference = typename ht::const_reference;
- using pointer = typename ht::pointer;
- using const_pointer = typename ht::const_pointer;
- using iterator = typename ht::iterator;
- using const_iterator = typename ht::const_iterator;
-
- /*
- * Constructors
- */
- robin_set() : robin_set(ht::DEFAULT_INIT_BUCKETS_SIZE) {}
-
- explicit robin_set(size_type bucket_count, const Hash& hash = Hash(),
- const KeyEqual& equal = KeyEqual(),
- const Allocator& alloc = Allocator())
- : m_ht(bucket_count, hash, equal, alloc) {}
-
- robin_set(size_type bucket_count, const Allocator& alloc)
- : robin_set(bucket_count, Hash(), KeyEqual(), alloc) {}
-
- robin_set(size_type bucket_count, const Hash& hash, const Allocator& alloc)
- : robin_set(bucket_count, hash, KeyEqual(), alloc) {}
-
- explicit robin_set(const Allocator& alloc)
- : robin_set(ht::DEFAULT_INIT_BUCKETS_SIZE, alloc) {}
-
- template <class InputIt>
- robin_set(InputIt first, InputIt last,
- size_type bucket_count = ht::DEFAULT_INIT_BUCKETS_SIZE,
- const Hash& hash = Hash(), const KeyEqual& equal = KeyEqual(),
- const Allocator& alloc = Allocator())
- : robin_set(bucket_count, hash, equal, alloc) {
- insert(first, last);
- }
-
- template <class InputIt>
- robin_set(InputIt first, InputIt last, size_type bucket_count,
- const Allocator& alloc)
- : robin_set(first, last, bucket_count, Hash(), KeyEqual(), alloc) {}
-
- template <class InputIt>
- robin_set(InputIt first, InputIt last, size_type bucket_count,
- const Hash& hash, const Allocator& alloc)
- : robin_set(first, last, bucket_count, hash, KeyEqual(), alloc) {}
-
- robin_set(std::initializer_list<value_type> init,
- size_type bucket_count = ht::DEFAULT_INIT_BUCKETS_SIZE,
- const Hash& hash = Hash(), const KeyEqual& equal = KeyEqual(),
- const Allocator& alloc = Allocator())
- : robin_set(init.begin(), init.end(), bucket_count, hash, equal, alloc) {}
-
- robin_set(std::initializer_list<value_type> init, size_type bucket_count,
- const Allocator& alloc)
- : robin_set(init.begin(), init.end(), bucket_count, Hash(), KeyEqual(),
- alloc) {}
-
- robin_set(std::initializer_list<value_type> init, size_type bucket_count,
- const Hash& hash, const Allocator& alloc)
- : robin_set(init.begin(), init.end(), bucket_count, hash, KeyEqual(),
- alloc) {}
-
- robin_set& operator=(std::initializer_list<value_type> ilist) {
- m_ht.clear();
-
- m_ht.reserve(ilist.size());
- m_ht.insert(ilist.begin(), ilist.end());
-
- return *this;
- }
-
- allocator_type get_allocator() const { return m_ht.get_allocator(); }
-
- /*
- * Iterators
- */
- iterator begin() noexcept { return m_ht.begin(); }
- const_iterator begin() const noexcept { return m_ht.begin(); }
- const_iterator cbegin() const noexcept { return m_ht.cbegin(); }
-
- iterator end() noexcept { return m_ht.end(); }
- const_iterator end() const noexcept { return m_ht.end(); }
- const_iterator cend() const noexcept { return m_ht.cend(); }
-
- /*
- * Capacity
- */
- bool empty() const noexcept { return m_ht.empty(); }
- size_type size() const noexcept { return m_ht.size(); }
- size_type max_size() const noexcept { return m_ht.max_size(); }
-
- /*
- * Modifiers
- */
- void clear() noexcept { m_ht.clear(); }
-
- std::pair<iterator, bool> insert(const value_type& value) {
- return m_ht.insert(value);
- }
-
- std::pair<iterator, bool> insert(value_type&& value) {
- return m_ht.insert(std::move(value));
- }
-
- iterator insert(const_iterator hint, const value_type& value) {
- return m_ht.insert_hint(hint, value);
- }
-
- iterator insert(const_iterator hint, value_type&& value) {
- return m_ht.insert_hint(hint, std::move(value));
- }
-
- template <class InputIt>
- void insert(InputIt first, InputIt last) {
- m_ht.insert(first, last);
- }
-
- void insert(std::initializer_list<value_type> ilist) {
- m_ht.insert(ilist.begin(), ilist.end());
- }
-
- /**
- * Due to the way elements are stored, emplace will need to move or copy the
- * key-value once. The method is equivalent to
- * insert(value_type(std::forward<Args>(args)...));
- *
- * Mainly here for compatibility with the std::unordered_map interface.
- */
- template <class... Args>
- std::pair<iterator, bool> emplace(Args&&... args) {
- return m_ht.emplace(std::forward<Args>(args)...);
- }
-
- /**
- * Due to the way elements are stored, emplace_hint will need to move or copy
- * the key-value once. The method is equivalent to insert(hint,
- * value_type(std::forward<Args>(args)...));
- *
- * Mainly here for compatibility with the std::unordered_map interface.
- */
- template <class... Args>
- iterator emplace_hint(const_iterator hint, Args&&... args) {
- return m_ht.emplace_hint(hint, std::forward<Args>(args)...);
- }
-
- iterator erase(iterator pos) { return m_ht.erase(pos); }
- iterator erase(const_iterator pos) { return m_ht.erase(pos); }
- iterator erase(const_iterator first, const_iterator last) {
- return m_ht.erase(first, last);
- }
- size_type erase(const key_type& key) { return m_ht.erase(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup to the value if you already have the hash.
- */
- size_type erase(const key_type& key, std::size_t precalculated_hash) {
- return m_ht.erase(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type erase(const K& key) {
- return m_ht.erase(key);
- }
-
- /**
- * @copydoc erase(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup to the value if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type erase(const K& key, std::size_t precalculated_hash) {
- return m_ht.erase(key, precalculated_hash);
- }
-
- void swap(robin_set& other) { other.m_ht.swap(m_ht); }
-
- /*
- * Lookup
- */
- size_type count(const Key& key) const { return m_ht.count(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- size_type count(const Key& key, std::size_t precalculated_hash) const {
- return m_ht.count(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type count(const K& key) const {
- return m_ht.count(key);
- }
-
- /**
- * @copydoc count(const K& key) const
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- size_type count(const K& key, std::size_t precalculated_hash) const {
- return m_ht.count(key, precalculated_hash);
- }
-
- iterator find(const Key& key) { return m_ht.find(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- iterator find(const Key& key, std::size_t precalculated_hash) {
- return m_ht.find(key, precalculated_hash);
- }
-
- const_iterator find(const Key& key) const { return m_ht.find(key); }
-
- /**
- * @copydoc find(const Key& key, std::size_t precalculated_hash)
- */
- const_iterator find(const Key& key, std::size_t precalculated_hash) const {
- return m_ht.find(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- iterator find(const K& key) {
- return m_ht.find(key);
- }
-
- /**
- * @copydoc find(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- iterator find(const K& key, std::size_t precalculated_hash) {
- return m_ht.find(key, precalculated_hash);
- }
-
- /**
- * @copydoc find(const K& key)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- const_iterator find(const K& key) const {
- return m_ht.find(key);
- }
-
- /**
- * @copydoc find(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- const_iterator find(const K& key, std::size_t precalculated_hash) const {
- return m_ht.find(key, precalculated_hash);
- }
-
- bool contains(const Key& key) const { return m_ht.contains(key); }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- bool contains(const Key& key, std::size_t precalculated_hash) const {
- return m_ht.contains(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- bool contains(const K& key) const {
- return m_ht.contains(key);
- }
-
- /**
- * @copydoc contains(const K& key) const
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- bool contains(const K& key, std::size_t precalculated_hash) const {
- return m_ht.contains(key, precalculated_hash);
- }
-
- std::pair<iterator, iterator> equal_range(const Key& key) {
- return m_ht.equal_range(key);
- }
-
- /**
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- std::pair<iterator, iterator> equal_range(const Key& key,
- std::size_t precalculated_hash) {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- std::pair<const_iterator, const_iterator> equal_range(const Key& key) const {
- return m_ht.equal_range(key);
- }
-
- /**
- * @copydoc equal_range(const Key& key, std::size_t precalculated_hash)
- */
- std::pair<const_iterator, const_iterator> equal_range(
- const Key& key, std::size_t precalculated_hash) const {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- /**
- * This overload only participates in the overload resolution if the typedef
- * KeyEqual::is_transparent exists. If so, K must be hashable and comparable
- * to Key.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<iterator, iterator> equal_range(const K& key) {
- return m_ht.equal_range(key);
- }
-
- /**
- * @copydoc equal_range(const K& key)
- *
- * Use the hash value 'precalculated_hash' instead of hashing the key. The
- * hash value should be the same as hash_function()(key). Useful to speed-up
- * the lookup if you already have the hash.
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<iterator, iterator> equal_range(const K& key,
- std::size_t precalculated_hash) {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- /**
- * @copydoc equal_range(const K& key)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<const_iterator, const_iterator> equal_range(const K& key) const {
- return m_ht.equal_range(key);
- }
-
- /**
- * @copydoc equal_range(const K& key, std::size_t precalculated_hash)
- */
- template <
- class K, class KE = KeyEqual,
- typename std::enable_if<has_is_transparent<KE>::value>::type* = nullptr>
- std::pair<const_iterator, const_iterator> equal_range(
- const K& key, std::size_t precalculated_hash) const {
- return m_ht.equal_range(key, precalculated_hash);
- }
-
- /*
- * Bucket interface
- */
- size_type bucket_count() const { return m_ht.bucket_count(); }
- size_type max_bucket_count() const { return m_ht.max_bucket_count(); }
-
- /*
- * Hash policy
- */
- float load_factor() const { return m_ht.load_factor(); }
-
- float min_load_factor() const { return m_ht.min_load_factor(); }
- float max_load_factor() const { return m_ht.max_load_factor(); }
-
- /**
- * Set the `min_load_factor` to `ml`. When the `load_factor` of the set goes
- * below `min_load_factor` after some erase operations, the set will be
- * shrunk when an insertion occurs. The erase method itself never shrinks
- * the set.
- *
- * The default value of `min_load_factor` is 0.0f, the set never shrinks by
- * default.
- */
- void min_load_factor(float ml) { m_ht.min_load_factor(ml); }
- void max_load_factor(float ml) { m_ht.max_load_factor(ml); }
-
- void rehash(size_type count_) { m_ht.rehash(count_); }
- void reserve(size_type count_) { m_ht.reserve(count_); }
-
- /*
- * Observers
- */
- hasher hash_function() const { return m_ht.hash_function(); }
- key_equal key_eq() const { return m_ht.key_eq(); }
-
- /*
- * Other
- */
-
- /**
- * Convert a const_iterator to an iterator.
- */
- iterator mutable_iterator(const_iterator pos) {
- return m_ht.mutable_iterator(pos);
- }
-
- friend bool operator==(const robin_set& lhs, const robin_set& rhs) {
- if (lhs.size() != rhs.size()) {
- return false;
- }
-
- for (const auto& element_lhs : lhs) {
- const auto it_element_rhs = rhs.find(element_lhs);
- if (it_element_rhs == rhs.cend()) {
- return false;
- }
- }
-
- return true;
- }
-
- /**
- * Serialize the set through the `serializer` parameter.
- *
- * The `serializer` parameter must be a function object that supports the
- * following call:
- * - `template<typename U> void operator()(const U& value);` where the types
- * `std::int16_t`, `std::uint32_t`, `std::uint64_t`, `float` and `Key` must be
- * supported for U.
- *
- * The implementation leaves binary compatibility (endianness, IEEE 754 for
- * floats, ...) of the types it serializes in the hands of the `Serializer`
- * function object if compatibility is required.
- */
- template <class Serializer>
- void serialize(Serializer& serializer) const {
- m_ht.serialize(serializer);
- }
-
- /**
- * Deserialize a previously serialized set through the `deserializer`
- * parameter.
- *
- * The `deserializer` parameter must be a function object that supports the
- * following call:
- * - `template<typename U> U operator()();` where the types `std::int16_t`,
- * `std::uint32_t`, `std::uint64_t`, `float` and `Key` must be supported for
- * U.
- *
- * If the deserialized hash set type is hash compatible with the serialized
- * set, the deserialization process can be sped up by setting
- * `hash_compatible` to true. To be hash compatible, the Hash, KeyEqual and
- * GrowthPolicy must behave the same way than the ones used on the serialized
- * set and the StoreHash must have the same value. The `std::size_t` must also
- * be of the same size as the one on the platform used to serialize the set.
- * If these criteria are not met, the behaviour is undefined with
- * `hash_compatible` sets to true.
- *
- * The behaviour is undefined if the type `Key` of the `robin_set` is not the
- * same as the type used during serialization.
- *
- * The implementation leaves binary compatibility (endianness, IEEE 754 for
- * floats, size of int, ...) of the types it deserializes in the hands of the
- * `Deserializer` function object if compatibility is required.
- */
- template <class Deserializer>
- static robin_set deserialize(Deserializer& deserializer,
- bool hash_compatible = false) {
- robin_set set(0);
- set.m_ht.deserialize(deserializer, hash_compatible);
-
- return set;
- }
-
- friend bool operator!=(const robin_set& lhs, const robin_set& rhs) {
- return !operator==(lhs, rhs);
- }
-
- friend void swap(robin_set& lhs, robin_set& rhs) { lhs.swap(rhs); }
-
- private:
- ht m_ht;
-};
-
-/**
- * Same as `tsl::robin_set<Key, Hash, KeyEqual, Allocator, StoreHash,
- * tsl::rh::prime_growth_policy>`.
- */
-template <class Key, class Hash = std::hash<Key>,
- class KeyEqual = std::equal_to<Key>,
- class Allocator = std::allocator<Key>, bool StoreHash = false>
-using robin_pg_set = robin_set<Key, Hash, KeyEqual, Allocator, StoreHash,
- tsl::rh::prime_growth_policy>;
-
-} // end namespace tsl
-
-#endif
diff --git a/3rdparty/robin-map/tsl-robin-map.natvis b/3rdparty/robin-map/tsl-robin-map.natvis
deleted file mode 100644
index f6eb842..0000000
--- a/3rdparty/robin-map/tsl-robin-map.natvis
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<AutoVisualizer xmlns="http://schemas.microsoft.com/vstudio/debugger/natvis/2010">
- <!-- Written in VC 2017 15.7 but is expected to be compatible with VC 2015 -->
-
- <!-- Visualization that shows the index in the name column and the key-value pair in the value column -->
- <Type Name="tsl::robin_map<*>" Priority="Medium">
- <AlternativeType Name="tsl::robin_set<*>"/>
- <DisplayString>{{ size={m_ht.m_nb_elements} }}</DisplayString>
- <Expand>
- <Item Name="[bucket_count]" IncludeView="detailed">m_ht.m_buckets_data._Mypair._Myval2._Mylast - m_ht.m_buckets_data._Mypair._Myval2._Myfirst</Item>
- <Item Name="[load_factor]" Condition="m_ht.m_buckets_data._Mypair._Myval2._Myfirst != m_ht.m_buckets_data._Mypair._Myval2._Mylast" IncludeView="detailed">
- ((float)m_ht.m_nb_elements) / ((float)(m_ht.m_buckets_data._Mypair._Myval2._Mylast - m_ht.m_buckets_data._Mypair._Myval2._Myfirst))
- </Item>
- <Item Name="[load_factor]" Condition="m_ht.m_buckets_data._Mypair._Myval2._Myfirst == m_ht.m_buckets_data._Mypair._Myval2._Mylast" IncludeView="detailed">
- 0
- </Item>
- <Item Name="[max_load_factor]" IncludeView="detailed">m_ht.m_max_load_factor</Item>
- <CustomListItems>
- <Variable Name="bucket" InitialValue="m_ht.m_buckets"/>
-
- <Size>m_ht.m_nb_elements</Size>
- <Loop>
- <Item Condition="bucket->m_dist_from_ideal_bucket != -1">*bucket</Item>
- <Break Condition="bucket->m_last_bucket"/>
- <Exec>++bucket</Exec>
- </Loop>
- </CustomListItems>
- </Expand>
- </Type>
-
- <!-- Visualization that shows the key in the name column and the key-value pair in the value column -->
- <Type Name="tsl::robin_map<*>" ExcludeView="ShowElementsByIndex" Priority="MediumHigh">
- <DisplayString>{{ size={m_ht.m_nb_elements} }}</DisplayString>
- <Expand>
- <Item Name="[bucket_count]" IncludeView="detailed">m_ht.m_buckets_data._Mypair._Myval2._Mylast - m_ht.m_buckets_data._Mypair._Myval2._Myfirst</Item>
- <Item Name="[load_factor]" Condition="m_ht.m_buckets_data._Mypair._Myval2._Myfirst != m_ht.m_buckets_data._Mypair._Myval2._Mylast" IncludeView="detailed">
- ((float)m_ht.m_nb_elements) / ((float)(m_ht.m_buckets_data._Mypair._Myval2._Mylast - m_ht.m_buckets_data._Mypair._Myval2._Myfirst))
- </Item>
- <Item Name="[load_factor]" Condition="m_ht.m_buckets_data._Mypair._Myval2._Myfirst == m_ht.m_buckets_data._Mypair._Myval2._Mylast" IncludeView="detailed">
- 0
- </Item>
- <Item Name="[max_load_factor]" IncludeView="detailed">m_ht.m_max_load_factor</Item>
- <CustomListItems>
- <Variable Name="bucket" InitialValue="m_ht.m_buckets"/>
-
- <Size>m_ht.m_nb_elements</Size>
- <Loop>
- <Item Condition="bucket->m_dist_from_ideal_bucket != -1" Name="[{reinterpret_cast<std::pair<$T1,$T2>*>(&bucket->m_value)->first}]">*bucket</Item>
- <Break Condition="bucket->m_last_bucket"/>
- <Exec>++bucket</Exec>
- </Loop>
- </CustomListItems>
- </Expand>
- </Type>
-
- <Type Name="tsl::detail_robin_hash::robin_hash<*>::robin_iterator<*>">
- <DisplayString>{*m_bucket}</DisplayString>
- <Expand>
- <ExpandedItem>*m_bucket</ExpandedItem>
- </Expand>
- </Type>
-
- <Type Name="tsl::detail_robin_hash::bucket_entry<*>">
- <DisplayString Condition="m_dist_from_ideal_bucket == -1">empty</DisplayString>
- <DisplayString Condition="m_dist_from_ideal_bucket != -1">{*reinterpret_cast<$T1*>(&m_value)}</DisplayString>
- <Expand>
- <ExpandedItem Condition="m_dist_from_ideal_bucket != -1">*reinterpret_cast<$T1*>(&m_value)</ExpandedItem>
- </Expand>
- </Type>
-
- <Type Name="tsl::detail_robin_hash::bucket_entry<*>" IncludeView="MapHelper">
- <DisplayString Condition="m_dist_from_ideal_bucket == -1">empty</DisplayString>
- <DisplayString Condition="m_dist_from_ideal_bucket != -1">{reinterpret_cast<$T1*>(&m_value)->second}</DisplayString>
- <Expand>
- <ExpandedItem Condition="m_dist_from_ideal_bucket != -1">*reinterpret_cast<$T1*>(&m_value)</ExpandedItem>
- </Expand>
- </Type>
-</AutoVisualizer>
diff --git a/CMakeLists.txt b/CMakeLists.txt
index 84cc5fa..ef2b814 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -36,6 +36,7 @@ find_package(Boost 1.60.0 ${REQUIRED_IN_APPIMAGE} COMPONENTS system filesystem i
set_package_properties(Boost PROPERTIES TYPE RECOMMENDED PURPOSE "Boost container libraries can greatly improve performance (via pmr allocators)")
find_package(Threads REQUIRED)
find_package(ZLIB REQUIRED)
+find_package(tsl-robin-map REQUIRED)
if (${Boost_IOSTREAMS_FOUND})
find_package(ZSTD ${REQUIRED_IN_APPIMAGE})
--
2.49.0
