pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > Class Template Reference

#include <robin_set.h>

Public Types
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

Public Member Functions
	robin_set ()
	robin_set (size_type bucket_count, const Hash &hash=Hash(), const KeyEqual &equal=KeyEqual(), const Allocator &alloc=Allocator())
	robin_set (size_type bucket_count, const Allocator &alloc)
	robin_set (size_type bucket_count, const Hash &hash, const Allocator &alloc)
	robin_set (const Allocator &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())
template<class InputIt >
	robin_set (InputIt first, InputIt last, size_type bucket_count, const Allocator &alloc)
template<class InputIt >
	robin_set (InputIt first, InputIt last, size_type bucket_count, const Hash &hash, const Allocator &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 (std::initializer_list< value_type > init, size_type bucket_count, const Allocator &alloc)
	robin_set (std::initializer_list< value_type > init, size_type bucket_count, const Hash &hash, const Allocator &alloc)
robin_set &	operator= (std::initializer_list< value_type > ilist)
allocator_type	get_allocator () const
iterator	begin () noexcept
const_iterator	begin () const noexcept
const_iterator	cbegin () const noexcept
iterator	end () noexcept
const_iterator	end () const noexcept
const_iterator	cend () const noexcept
bool	empty () const noexcept
size_type	size () const noexcept
size_type	max_size () const noexcept
void	clear () noexcept
std::pair< iterator, bool >	insert (const value_type &value)
std::pair< iterator, bool >	insert (value_type &&value)
iterator	insert (const_iterator hint, const value_type &value)
iterator	insert (const_iterator hint, value_type &&value)
template<class InputIt >
void	insert (InputIt first, InputIt last)
void	insert (std::initializer_list< value_type > ilist)
template<class... Args>
std::pair< iterator, bool >	emplace (Args &&...args)
template<class... Args>
iterator	emplace_hint (const_iterator hint, Args &&...args)
iterator	erase (iterator pos)
iterator	erase (const_iterator pos)
iterator	erase (const_iterator first, const_iterator last)
size_type	erase (const key_type &key)
size_type	erase (const key_type &key, std::size_t precalculated_hash)
template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>
size_type	erase (const K &key)
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)
void	swap (robin_set &other)
size_type	count (const Key &key) const
size_type	count (const Key &key, std::size_t precalculated_hash) const
template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>
size_type	count (const K &key) const
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
iterator	find (const Key &key)
iterator	find (const Key &key, std::size_t precalculated_hash)
const_iterator	find (const Key &key) const
const_iterator	find (const Key &key, std::size_t precalculated_hash) const
template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>
iterator	find (const K &key)
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)
template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>
const_iterator	find (const K &key) const
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
bool	contains (const Key &key) const
bool	contains (const Key &key, std::size_t precalculated_hash) const
template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>
bool	contains (const K &key) const
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
std::pair< iterator, iterator >	equal_range (const Key &key)
std::pair< iterator, iterator >	equal_range (const Key &key, std::size_t precalculated_hash)
std::pair< const_iterator, const_iterator >	equal_range (const Key &key) const
std::pair< const_iterator, const_iterator >	equal_range (const Key &key, std::size_t precalculated_hash) const
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)
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)
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
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
size_type	bucket_count () const
size_type	max_bucket_count () const
float	load_factor () const
float	min_load_factor () const
float	max_load_factor () const
void	min_load_factor (float ml)
void	max_load_factor (float ml)
void	rehash (size_type count_)
void	reserve (size_type count_)
hasher	hash_function () const
key_equal	key_eq () const
iterator	mutable_iterator (const_iterator pos)
template<class Serializer >
void	serialize (Serializer &serializer) const

Static Public Member Functions
template<class Deserializer >
static robin_set	deserialize (Deserializer &deserializer, bool hash_compatible=false)

Friends
bool	operator== (const robin_set &lhs, const robin_set &rhs)
bool	operator!= (const robin_set &lhs, const robin_set &rhs)
void	swap (robin_set &lhs, robin_set &rhs)

Detailed Description

template<class Key, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>
class pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >

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 pxr_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(pxr_tsl::detail_robin_hash::bucket_entry<ValueType, true>) == sizeof(pxr_tsl::detail_robin_hash::bucket_entry<ValueType, false>)) and pxr_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 pxr_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 pxr_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.

Definition at line 95 of file robin_set.h.

Member Typedef Documentation

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::allocator_type = typename ht::allocator_type

Definition at line 119 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::const_iterator = typename ht::const_iterator

Definition at line 125 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::const_pointer = typename ht::const_pointer

Definition at line 123 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::const_reference = typename ht::const_reference

Definition at line 121 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::difference_type = typename ht::difference_type

Definition at line 116 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::hasher = typename ht::hasher

Definition at line 117 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::iterator = typename ht::iterator

Definition at line 124 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::key_equal = typename ht::key_equal

Definition at line 118 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::key_type = typename ht::key_type

Definition at line 113 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::pointer = typename ht::pointer

Definition at line 122 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::reference = typename ht::reference

Definition at line 120 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::size_type = typename ht::size_type

Definition at line 115 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

using pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::value_type = typename ht::value_type

Definition at line 114 of file robin_set.h.

Constructor & Destructor Documentation

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( )

inline

Definition at line 130 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( size_type  bucket_count, const Hash &  hash = Hash(), const KeyEqual &  equal = KeyEqual(), const Allocator &  alloc = Allocator()  )

inlineexplicit

Definition at line 132 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( size_type  bucket_count, const Allocator &  alloc  )

inline

Definition at line 137 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( size_type  bucket_count, const Hash &  hash, const Allocator &  alloc  )

inline

Definition at line 140 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( const Allocator &  alloc )

inlineexplicit

Definition at line 143 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class InputIt >

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::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()  )

inline

Definition at line 147 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class InputIt >

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( InputIt  first, InputIt  last, size_type  bucket_count, const Allocator &  alloc  )

inline

Definition at line 156 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class InputIt >

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( InputIt  first, InputIt  last, size_type  bucket_count, const Hash &  hash, const Allocator &  alloc  )

inline

Definition at line 161 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::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()  )

inline

Definition at line 165 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( std::initializer_list< value_type >  init, size_type  bucket_count, const Allocator &  alloc  )

inline

Definition at line 171 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::robin_set ( std::initializer_list< value_type >  init, size_type  bucket_count, const Hash &  hash, const Allocator &  alloc  )

inline

Definition at line 176 of file robin_set.h.

Member Function Documentation

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::begin ( void  )

inlinenoexcept

Definition at line 195 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::begin ( void  ) const

inlinenoexcept

Definition at line 196 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::bucket_count ( ) const

inline

Definition at line 532 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::cbegin ( ) const

inlinenoexcept

Definition at line 197 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::cend ( ) const

inlinenoexcept

Definition at line 201 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::clear ( void  )

inlinenoexcept

Definition at line 213 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

bool pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::contains ( const Key &  key ) const

inline

Definition at line 418 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

bool pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::contains ( const Key &  key, std::size_t  precalculated_hash  ) const

inline

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.

Definition at line 425 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

bool pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::contains ( const K &  key ) const

inline

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.

Definition at line 437 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

bool pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::contains ( const K &  key, std::size_t  precalculated_hash  ) const

inline

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.

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.

Definition at line 451 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::count ( const Key &  key ) const

inline

Definition at line 311 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::count ( const Key &  key, std::size_t  precalculated_hash  ) const

inline

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.

Definition at line 318 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::count ( const K &  key ) const

inline

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.

Definition at line 330 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::count ( const K &  key, std::size_t  precalculated_hash  ) const

inline

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.

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.

Definition at line 344 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class Deserializer >

static robin_set pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::deserialize ( Deserializer &  deserializer, bool  hash_compatible = false  )

inlinestatic

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.

Definition at line 635 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class... Args>

std::pair<iterator, bool> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::emplace ( Args &&...  args )

inline

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.

Definition at line 248 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class... Args>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::emplace_hint ( const_iterator  hint, Args &&...  args  )

inline

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.

Definition at line 260 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

bool pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::empty ( void  ) const

inlinenoexcept

Definition at line 206 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::end ( void  )

inlinenoexcept

Definition at line 199 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::end ( void  ) const

inlinenoexcept

Definition at line 200 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

std::pair<iterator, iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const Key &  key )

inline

Definition at line 455 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

std::pair<iterator, iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const Key &  key, std::size_t  precalculated_hash  )

inline

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.

Definition at line 464 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

std::pair<const_iterator, const_iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const Key &  key ) const

inline

Definition at line 469 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

std::pair<const_iterator, const_iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const Key &  key, std::size_t  precalculated_hash  ) const

inline

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.

Definition at line 476 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

std::pair<iterator, iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const K &  key )

inline

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.

Definition at line 489 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

std::pair<iterator, iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const K &  key, std::size_t  precalculated_hash  )

inline

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.

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.

Definition at line 503 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

std::pair<const_iterator, const_iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const K &  key ) const

inline

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.

Definition at line 514 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

std::pair<const_iterator, const_iterator> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::equal_range ( const K &  key, std::size_t  precalculated_hash  ) const

inline

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.

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.

Definition at line 524 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::erase ( iterator  pos )

inline

Definition at line 264 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::erase ( const_iterator  pos )

inline

Definition at line 265 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::erase ( const_iterator  first, const_iterator  last  )

inline

Definition at line 266 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::erase ( const key_type &  key )

inline

Definition at line 269 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::erase ( const key_type &  key, std::size_t  precalculated_hash  )

inline

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.

Definition at line 276 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::erase ( const K &  key )

inline

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.

Definition at line 288 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::erase ( const K &  key, std::size_t  precalculated_hash  )

inline

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.

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.

Definition at line 302 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const Key &  key )

inline

Definition at line 348 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const Key &  key, std::size_t  precalculated_hash  )

inline

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.

Definition at line 355 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const Key &  key ) const

inline

Definition at line 359 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const Key &  key, std::size_t  precalculated_hash  ) const

inline

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.

Definition at line 364 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const K &  key )

inline

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.

Definition at line 376 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const K &  key, std::size_t  precalculated_hash  )

inline

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.

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.

Definition at line 390 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const K &  key ) const

inline

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.

Definition at line 400 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class K , class KE = KeyEqual, typename std::enable_if< has_is_transparent< KE >::value >::type * = nullptr>

const_iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::find ( const K &  key, std::size_t  precalculated_hash  ) const

inline

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.

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.

Definition at line 414 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

allocator_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::get_allocator ( ) const

inline

Definition at line 190 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

hasher pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::hash_function ( ) const

inline

Definition at line 561 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

std::pair<iterator, bool> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::insert ( const value_type &  value )

inline

Definition at line 215 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

std::pair<iterator, bool> pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::insert ( value_type &&  value )

inline

Definition at line 219 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::insert ( const_iterator  hint, const value_type &  value  )

inline

Definition at line 223 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::insert ( const_iterator  hint, value_type &&  value  )

inline

Definition at line 227 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class InputIt >

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::insert ( InputIt  first, InputIt  last  )

inline

Definition at line 232 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::insert ( std::initializer_list< value_type >  ilist )

inline

Definition at line 236 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

key_equal pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::key_eq ( ) const

inline

Definition at line 562 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

float pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::load_factor ( ) const

inline

Definition at line 538 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::max_bucket_count ( ) const

inline

Definition at line 533 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

float pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::max_load_factor ( ) const

inline

Definition at line 541 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::max_load_factor ( float  ml )

inline

Definition at line 553 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::max_size ( void  ) const

inlinenoexcept

Definition at line 208 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

float pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::min_load_factor ( ) const

inline

Definition at line 540 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::min_load_factor ( float  ml )

inline

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.

Definition at line 552 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

iterator pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::mutable_iterator ( const_iterator  pos )

inline

Convert a const_iterator to an iterator.

Definition at line 571 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

robin_set& pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::operator= ( std::initializer_list< value_type >  ilist )

inline

Definition at line 181 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::rehash ( size_type  count_ )

inline

Definition at line 555 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::reserve ( size_type  count_ )

inline

Definition at line 556 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

template<class Serializer >

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::serialize ( Serializer &  serializer ) const

inline

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.

Definition at line 604 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

size_type pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::size ( void  ) const

inlinenoexcept

Definition at line 207 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void pxr_tsl::robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy >::swap ( robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > &  other )

inline

Definition at line 306 of file robin_set.h.

Friends And Related Function Documentation

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

bool operator!= ( const robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > &  lhs, const robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > &  rhs  )

friend

Definition at line 643 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

bool operator== ( const robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > &  lhs, const robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > &  rhs  )

friend

Definition at line 575 of file robin_set.h.

template<class Key , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key>, bool StoreHash = false, class GrowthPolicy = pxr_tsl::rh::power_of_two_growth_policy<2>>

void swap ( robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > &  lhs, robin_set< Key, Hash, KeyEqual, Allocator, StoreHash, GrowthPolicy > &  rhs  )

friend

Definition at line 647 of file robin_set.h.

---

The documentation for this class was generated from the following file:

• pxr/base/tf/pxrTslRobinMap/robin_set.h