![]() |
PandA-2024.02
|
redefinition of set to manage ordered/unordered structures More...
#include "config_HAVE_UNORDERED.hpp"#include <set>#include <unordered_set>#include "absl/container/btree_set.h"#include "absl/container/flat_hash_set.h"#include "absl/container/node_hash_set.h"#include "absl/hash/hash.h"

Go to the source code of this file.
Data Structures | |
| class | CustomUnorderedSet< T, _Hash, _Eq, _Alloc > |
| class | CustomOrderedSet< Key, Compare, Alloc > |
Macros | |
| #define | NO_ABSEIL_HASH 0 |
Typedefs | |
| template<class _Value , class _Hash = std::hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>> | |
| using | UnorderedSetStd = std::unordered_set< _Value, _Hash, _Pred, _Alloc > |
| Autoheader include. More... | |
| template<typename Key , typename Compare = std::less<Key>, typename Alloc = std::allocator<Key>> | |
| using | OrderedSetStd = std::set< Key, Compare, Alloc > |
| template<class _Value , class _Hash = typename absl::node_hash_set<_Value>::hasher, class _Pred = typename absl::node_hash_set<_Value>::key_equal, class _Alloc = std::allocator<_Value>> | |
| using | UnorderedSetStdStable = absl::node_hash_set< _Value, _Hash, _Pred, _Alloc > |
| template<typename T > | |
| using | CustomSet = CustomOrderedSet< T > |
redefinition of set to manage ordered/unordered structures
Definition in file custom_set.hpp.
| #define NO_ABSEIL_HASH 0 |
Definition at line 170 of file custom_set.hpp.
| using CustomSet = CustomOrderedSet<T> |
Definition at line 312 of file custom_set.hpp.
| using OrderedSetStd = std::set<Key, Compare, Alloc> |
Definition at line 59 of file custom_set.hpp.
| using UnorderedSetStd = std::unordered_set<_Value, _Hash, _Pred, _Alloc> |
Autoheader include.
Definition at line 56 of file custom_set.hpp.
| using UnorderedSetStdStable = absl::node_hash_set<_Value, _Hash, _Pred, _Alloc> |
Definition at line 215 of file custom_set.hpp.
1.8.13