template<typename Key, typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket, bool Constant>
class mcrl2::utilities::unordered_set< Key, Hash, Equals, Allocator, ThreadSafe, Resize >::unordered_set_iterator< Bucket, Constant >
An iterator over all elements in the unordered set.
Definition at line 91 of file unordered_set.h.
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
mcrl2::utilities::unordered_set< Key, Hash, Equals, Allocator, ThreadSafe, Resize >::unordered_set_iterator< Bucket, Constant >::unordered_set_iterator |
( |
| ) |
|
|
default |
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
Construct an iterator over all keys passed in this bucket and all remaining buckets.
Definition at line 153 of file unordered_set.h.
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
Construct the begin iterator (over all elements).
Definition at line 158 of file unordered_set.h.
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
- Returns
- A reference to the bucket iterator.
Definition at line 181 of file unordered_set.h.
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
- Returns
- A reference to the before key iterator.
Definition at line 175 of file unordered_set.h.
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>
template<typename Key_ , typename T , typename Hash_ , typename KeyEqual , typename Allocator_ , bool ThreadSafe_, bool Resize_>
template<typename Key , typename Hash = std::hash<Key>, typename Equals = std::equal_to<Key>, typename Allocator = std::allocator<Key>, bool ThreadSafe = false, bool Resize = true>
template<typename Bucket , bool Constant>