13#include <unordered_set>
20 template<
typename Key,
typename Compare = std::less<>,
typename RawAllocator = DefaultAllocator>
21 using Set = std::set<Key, Compare, ScopedAllocatorAdaptor<StdAllocator<Key, RawAllocator>>>;
29 template<
typename Key,
typename Hash = std::hash<Key>,
typename KeyEqual = std::equal_to<>,
typename RawAllocator = DefaultAllocator>
30 using HashSet = std::unordered_set<Key, Hash, KeyEqual, ScopedAllocatorAdaptor<StdAllocator<Key, RawAllocator>>>;
33 template<
typename Key,
typename Hash = std::hash<Key>,
typename KeyEqual = std::equal_to<>>
Definition Application.hpp:19
HashSet< Key, Hash, KeyEqual, TemporaryAllocator > TemporaryHashSet
A special HashSet that uses a fast temporary allocator.
Definition Set.hpp:34
Set< Key, Compare, TemporaryAllocator > TemporarySet
A special Set that uses a fast temporary allocator.
Definition Set.hpp:24
std::unordered_set< Key, Hash, KeyEqual, ScopedAllocatorAdaptor< StdAllocator< Key, RawAllocator > > > HashSet
HashSet is an associative container that contains a set of unique objects of type Key.
Definition Set.hpp:30
std::set< Key, Compare, ScopedAllocatorAdaptor< StdAllocator< Key, RawAllocator > > > Set
Set is an associative container that contains a sorted set of unique objects of type Key.
Definition Set.hpp:21