bdlc::FlatHashSet< KEY, HASH, EQUAL > Class Template Reference

#include <bdlc_flathashset.h>

Public Types
typedef KEY	key_type
typedef KEY	value_type
typedef bsl::size_t	size_type
typedef bsl::ptrdiff_t	difference_type
typedef EQUAL	key_compare
typedef EQUAL	value_compare
typedef HASH	hasher
typedef value_type &	reference
typedef const value_type &	const_reference
typedef value_type *	pointer
typedef const value_type *	const_pointer
typedef ImplType::const_iterator	iterator
typedef ImplType::const_iterator	const_iterator

Public Member Functions
	FlatHashSet ()
	FlatHashSet (bslma::Allocator *basicAllocator)
	FlatHashSet (bsl::size_t capacity)
	FlatHashSet (bsl::size_t capacity, bslma::Allocator *basicAllocator)
	FlatHashSet (bsl::size_t capacity, const HASH &hash, bslma::Allocator *basicAllocator=0)
	FlatHashSet (bsl::size_t capacity, const HASH &hash, const EQUAL &equal, bslma::Allocator *basicAllocator=0)
template<class INPUT_ITERATOR >
	FlatHashSet (INPUT_ITERATOR first, INPUT_ITERATOR last, bslma::Allocator *basicAllocator=0)
template<class INPUT_ITERATOR >
	FlatHashSet (INPUT_ITERATOR first, INPUT_ITERATOR last, bsl::size_t capacity, bslma::Allocator *basicAllocator=0)
template<class INPUT_ITERATOR >
	FlatHashSet (INPUT_ITERATOR first, INPUT_ITERATOR last, bsl::size_t capacity, const HASH &hash, bslma::Allocator *basicAllocator=0)
template<class INPUT_ITERATOR >
	FlatHashSet (INPUT_ITERATOR first, INPUT_ITERATOR last, bsl::size_t capacity, const HASH &hash, const EQUAL &equal, bslma::Allocator *basicAllocator=0)
	FlatHashSet (const FlatHashSet &original, bslma::Allocator *basicAllocator=0)
	FlatHashSet (bslmf::MovableRef< FlatHashSet > original)
	FlatHashSet (bslmf::MovableRef< FlatHashSet > original, bslma::Allocator *basicAllocator)
	~FlatHashSet ()
	Destroy this object and each of its elements.
FlatHashSet &	operator= (const FlatHashSet &rhs)
FlatHashSet &	operator= (bslmf::MovableRef< FlatHashSet > rhs)
void	clear ()
template<class... ARGS>
bsl::pair< iterator, bool >	emplace (ARGS &&... args)
template<class... ARGS>
iterator	emplace_hint (const_iterator hint, ARGS &&... args)
bsl::size_t	erase (const KEY &key)
const_iterator	erase (const_iterator position)
const_iterator	erase (const_iterator first, const_iterator last)
template<class KEY_TYPE >
bsl::enable_if< bsl::is_convertible< KEY_TYPE, KEY >::value, bsl::pair< const_iterator, bool > >::type	insert (BSLS_COMPILERFEATURES_FORWARD_REF(KEY_TYPE) value)
template<class KEY_TYPE >
bsl::enable_if< bsl::is_convertible< KEY_TYPE, KEY >::value, const_iterator >::type	insert (const_iterator, BSLS_COMPILERFEATURES_FORWARD_REF(KEY_TYPE) value)
template<class INPUT_ITERATOR >
void	insert (INPUT_ITERATOR first, INPUT_ITERATOR last)
void	rehash (bsl::size_t minimumCapacity)
void	reserve (bsl::size_t numEntries)
void	reset ()
void	swap (FlatHashSet &other)
bsl::size_t	capacity () const
bool	contains (const KEY &key) const
bsl::size_t	count (const KEY &key) const
bool	empty () const
bsl::pair< const_iterator, const_iterator >	equal_range (const KEY &key) const
const_iterator	find (const KEY &key) const
HASH	hash_function () const
EQUAL	key_eq () const
float	load_factor () const
float	max_load_factor () const
bsl::size_t	size () const
	Return the number of elements in this set.
const_iterator	begin () const
const_iterator	cbegin () const
const_iterator	cend () const
const_iterator	end () const
bslma::Allocator *	allocator () const
	Return the allocator used by this flat hash set to supply memory.
bsl::ostream &	print (bsl::ostream &stream, int level=0, int spacesPerLevel=4) const
template<class... ARGS>
bsl::pair< typename FlatHashSet< KEY, HASH, EQUAL >::iterator, bool >	emplace (ARGS &&... args)
template<class... ARGS>
FlatHashSet< KEY, HASH, EQUAL >::iterator	emplace_hint (typename FlatHashSet< KEY, HASH, EQUAL >::const_iterator, ARGS &&... args)

Friends
bool	operator== (const FlatHashSet &, const FlatHashSet &)
bool	operator!= (const FlatHashSet &, const FlatHashSet &)
template<class K , class H , class E >
void	swap (FlatHashSet< K, H, E > &, FlatHashSet< K, H, E > &)

Detailed Description

template<class KEY, class HASH, class EQUAL>
class bdlc::FlatHashSet< KEY, HASH, EQUAL >

This class template implements a value-semantic container type holding an unordered set of unique values of (template parameter) type KEY. The (template parameter) type HASH is a functor providing the hash value for KEY. The (template parameter) type EQUAL is a functor providing the equality function for two KEY values. See {Requirements on KEY, HASH, and EQUAL} for more information.

See bdlc_flathashset

Member Typedef Documentation

const_iterator

template<class KEY , class HASH , class EQUAL >

typedef ImplType::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::const_iterator

const_pointer

template<class KEY , class HASH , class EQUAL >

typedef const value_type* bdlc::FlatHashSet< KEY, HASH, EQUAL >::const_pointer

const_reference

template<class KEY , class HASH , class EQUAL >

typedef const value_type& bdlc::FlatHashSet< KEY, HASH, EQUAL >::const_reference

difference_type

template<class KEY , class HASH , class EQUAL >

typedef bsl::ptrdiff_t bdlc::FlatHashSet< KEY, HASH, EQUAL >::difference_type

hasher

template<class KEY , class HASH , class EQUAL >

typedef HASH bdlc::FlatHashSet< KEY, HASH, EQUAL >::hasher

iterator

template<class KEY , class HASH , class EQUAL >

typedef ImplType::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::iterator

key_compare

template<class KEY , class HASH , class EQUAL >

typedef EQUAL bdlc::FlatHashSet< KEY, HASH, EQUAL >::key_compare

key_type

template<class KEY , class HASH , class EQUAL >

typedef KEY bdlc::FlatHashSet< KEY, HASH, EQUAL >::key_type

pointer

template<class KEY , class HASH , class EQUAL >

typedef value_type* bdlc::FlatHashSet< KEY, HASH, EQUAL >::pointer

reference

template<class KEY , class HASH , class EQUAL >

typedef value_type& bdlc::FlatHashSet< KEY, HASH, EQUAL >::reference

size_type

template<class KEY , class HASH , class EQUAL >

typedef bsl::size_t bdlc::FlatHashSet< KEY, HASH, EQUAL >::size_type

value_compare

template<class KEY , class HASH , class EQUAL >

typedef EQUAL bdlc::FlatHashSet< KEY, HASH, EQUAL >::value_compare

value_type

template<class KEY , class HASH , class EQUAL >

typedef KEY bdlc::FlatHashSet< KEY, HASH, EQUAL >::value_type

Constructor & Destructor Documentation

FlatHashSet() [1/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( )

inline

FlatHashSet() [2/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( bslma::Allocator *  basicAllocator )

inlineexplicit

FlatHashSet() [3/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( bsl::size_t  capacity )

inlineexplicit

FlatHashSet() [4/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( bsl::size_t  capacity, bslma::Allocator *  basicAllocator  )

inline

FlatHashSet() [5/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( bsl::size_t  capacity, const HASH &  hash, bslma::Allocator *  basicAllocator = 0  )

inline

FlatHashSet() [6/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( bsl::size_t  capacity, const HASH &  hash, const EQUAL &  equal, bslma::Allocator *  basicAllocator = 0  )

inline

Create an empty FlatHashSet object. Optionally specify a capacity indicating the minimum initial size of the underlying array of entries of this container. If capacity is not supplied or is 0, no memory is allocated. Optionally specify a hash functor used to generate the hash values associated with the elements in this container. If hash is not supplied, a default-constructed object of the (template parameter) type HASH is used. Optionally specify an equality functor equal used to determine whether two elements are equivalent. If equal is not supplied, a default-constructed object of the (template parameter) type EQUAL is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied or is 0, the currently installed default allocator is used.

FlatHashSet() [7/13]

template<class KEY , class HASH , class EQUAL >

template<class INPUT_ITERATOR >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( INPUT_ITERATOR  first, INPUT_ITERATOR  last, bslma::Allocator *  basicAllocator = 0  )

inline

Create a FlatHashSet object initialized by insertion of the values from the input iterator range specified by first through last (including first, excluding last). Optionally specify a capacity indicating the minimum initial size of the underlying array of entries of this container. If capacity is not supplied or is 0, no memory is allocated. Optionally specify a hash functor used to generate hash values associated with the elements in this container. If hash is not supplied, a default-constructed object of the (template parameter) type HASH is used. Optionally specify an equality functor equal used to verify that two elements are equivalent. If equal is not supplied, a default-constructed object of the (template parameter) type EQUAL is used. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not supplied or is 0, the currently installed default allocator is used. The behavior is undefined unless first and last refer to a sequence of valid values where first is at a position at or before last. Note that if a member of the input sequence is equivalent to an earlier member, the later member will not be inserted.

FlatHashSet() [8/13]

template<class KEY , class HASH , class EQUAL >

template<class INPUT_ITERATOR >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( INPUT_ITERATOR  first, INPUT_ITERATOR  last, bsl::size_t  capacity, bslma::Allocator *  basicAllocator = 0  )

inline

FlatHashSet() [9/13]

template<class KEY , class HASH , class EQUAL >

template<class INPUT_ITERATOR >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( INPUT_ITERATOR  first, INPUT_ITERATOR  last, bsl::size_t  capacity, const HASH &  hash, bslma::Allocator *  basicAllocator = 0  )

inline

FlatHashSet() [10/13]

template<class KEY , class HASH , class EQUAL >

template<class INPUT_ITERATOR >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( INPUT_ITERATOR  first, INPUT_ITERATOR  last, bsl::size_t  capacity, const HASH &  hash, const EQUAL &  equal, bslma::Allocator *  basicAllocator = 0  )

inline

FlatHashSet() [11/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( const FlatHashSet< KEY, HASH, EQUAL > &  original, bslma::Allocator *  basicAllocator = 0  )

inline

Create a FlatHashSet object having the same value, hasher, and equality comparator as the specified original object. Optionally specify a basicAllocator used to supply memory. If basicAllocator is not specified or is 0, the currently installed default allocator is used.

FlatHashSet() [12/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( bslmf::MovableRef< FlatHashSet< KEY, HASH, EQUAL > >  original )

inline

Create a FlatHashSet object having the same value, hasher, equality comparator, and allocator as the specified original object. The contents of original are moved (in constant time) to this object, original is left in a (valid) unspecified state, and no exceptions will be thrown.

FlatHashSet() [13/13]

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::FlatHashSet ( bslmf::MovableRef< FlatHashSet< KEY, HASH, EQUAL > >  original, bslma::Allocator *  basicAllocator  )

inline

Create a FlatHashSet object having the same value, hasher, and equality comparator as the specified original object, using the specified basicAllocator to supply memory. If basicAllocator is 0, the currently installed default allocator is used. The allocator of original remains unchanged. If original and the newly created object have the same allocator then the contents of original are moved (in constant time) to this object, original is left in a (valid) unspecified state, and no exceptions will be thrown; otherwise original is unchanged (and an exception may be thrown).

~FlatHashSet()

template<class KEY , class HASH , class EQUAL >

bdlc::FlatHashSet< KEY, HASH, EQUAL >::~FlatHashSet ( )

inline

Member Function Documentation

allocator()

template<class KEY , class HASH , class EQUAL >

bslma::Allocator * bdlc::FlatHashSet< KEY, HASH, EQUAL >::allocator ( ) const

inline

begin()

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL >::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::begin ( ) const

inline

Return a const_iterator to the first element in the sequence of elements maintained by this set, or the end iterator if this set is empty.

capacity()

template<class KEY , class HASH , class EQUAL >

bsl::size_t bdlc::FlatHashSet< KEY, HASH, EQUAL >::capacity ( ) const

inline

Return the number of elements this set could hold if the load factor were 1.

cbegin()

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL >::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::cbegin ( ) const

inline

Return a const_iterator to the first element in the sequence of elements maintained by this set, or the end iterator if this set is empty.

cend()

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL >::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::cend ( ) const

inline

Return a const_iterator to the past-the-end element in the sequence of KEY elements maintained by this set.

clear()

template<class KEY , class HASH , class EQUAL >

void bdlc::FlatHashSet< KEY, HASH, EQUAL >::clear ( )

inline

Remove all elements from this set. Note that this set will be empty after calling this method, but allocated memory may be retained for future use. See the capacity method.

contains()

template<class KEY , class HASH , class EQUAL >

bool bdlc::FlatHashSet< KEY, HASH, EQUAL >::contains ( const KEY &  key ) const

inline

Return true if this set contains an element having the specified key, and false otherwise.

count()

template<class KEY , class HASH , class EQUAL >

bsl::size_t bdlc::FlatHashSet< KEY, HASH, EQUAL >::count ( const KEY &  key ) const

inline

Return the number of elements in this set having the specified key. Note that since a flat hash set maintains unique keys, the returned value will be either 0 or 1.

emplace() [1/2]

template<class KEY , class HASH , class EQUAL >

template<class... ARGS>

bsl::pair< iterator, bool > bdlc::FlatHashSet< KEY, HASH, EQUAL >::emplace

(

ARGS &&...

args

)

Insert into this set a newly created value_type object, constructed by forwarding get_allocator() (if required) and the specified (variable number of) args to the corresponding constructor of value_type, if a key equivalent to such a value does not already exist in this set; otherwise, this method has no effect (other than possibly creating a temporary value_type object). Return a pair whose first member is an iterator referring to the (possibly newly created and inserted) object in this set whose value is equivalent to that of an object constructed from arguments, and whose second member is true if a new value was inserted, and false if an equivalent key was already present.

emplace() [2/2]

template<class KEY , class HASH , class EQUAL >

template<class... ARGS>

bsl::pair< typename FlatHashSet< KEY, HASH, EQUAL >::iterator, bool > bdlc::FlatHashSet< KEY, HASH, EQUAL >::emplace ( ARGS &&...  args )

inline

emplace_hint() [1/2]

template<class KEY , class HASH , class EQUAL >

template<class... ARGS>

iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::emplace_hint	(	const_iterator	hint,
		ARGS &&...	args
	)

Insert into this set a newly created value_type object, constructed by forwarding get_allocator() (if required) and the specified (variable number of) args to the corresponding constructor of value_type, if a key equivalent to such a value does not already exists in this set; otherwise, this method has no effect (other than possibly creating a temporary value_type object). Return an iterator referring to the (possibly newly created and inserted) object in this set whose value is equivalent to that of an object constructed from arguments. The average and worst case complexity of this operation is not affected by the specified hint. Note that hint is ignored (other than possibly asserting its validity in some build modes).

emplace_hint() [2/2]

template<class KEY , class HASH , class EQUAL >

template<class... ARGS>

FlatHashSet< KEY, HASH, EQUAL >::iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::emplace_hint ( typename FlatHashSet< KEY, HASH, EQUAL >::const_iterator  , ARGS &&...  args  )

inline

empty()

template<class KEY , class HASH , class EQUAL >

bool bdlc::FlatHashSet< KEY, HASH, EQUAL >::empty ( ) const

inline

Return true if this set contains no elements, and false otherwise.

end()

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL >::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::end ( ) const

inline

Return a const_iterator to the past-the-end element in the sequence of KEY elements maintained by this set.

equal_range()

template<class KEY , class HASH , class EQUAL >

bsl::pair< typename FlatHashSet< KEY, HASH, EQUAL >::const_iterator, typename FlatHashSet< KEY, HASH, EQUAL >::const_iterator > bdlc::FlatHashSet< KEY, HASH, EQUAL >::equal_range ( const KEY &  key ) const

inline

Return a pair of const_iterators defining the sequence of elements in this set having the specified key, where the first iterator is positioned at the start of the sequence and the second iterator is positioned one past the end of the sequence. If this set contains no KEY elements equivalent to key, then the two returned iterators will have the same value. Note that since a set maintains unique keys, the range will contain at most one element.

erase() [1/3]

template<class KEY , class HASH , class EQUAL >

bsl::size_t bdlc::FlatHashSet< KEY, HASH, EQUAL >::erase ( const KEY &  key )

inline

Remove from this set the element whose key is equal to the specified key, if it exists, and return 1; otherwise (there is no element having key in this set), return 0 with no other effect. This method invalidates all iterators and references to the removed element.

erase() [2/3]

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL >::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::erase ( const_iterator  first, const_iterator  last  )

inline

Remove from this set the elements starting at the specified first position up to, but not including, the specified last position, and return last. This method invalidates all iterators and references to the removed elements. The behavior is undefined unless first and last are valid iterators on this set, and the first position is at or before the last position in the iteration sequence provided by this container.

erase() [3/3]

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL >::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::erase ( const_iterator  position )

inline

Remove from this set the element at the specified position, and return a const_iterator referring to the element immediately following the removed element, or to the past-the-end position if the removed element was the last element in the sequence of elements maintained by this set. This method invalidates all iterators and references to the removed element. The behavior is undefined unless position refers to an element in this set.

find()

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL >::const_iterator bdlc::FlatHashSet< KEY, HASH, EQUAL >::find ( const KEY &  key ) const

inline

Return a const_iterator referring to the element in this set having the specified key, or end() if no such entry exists in this set.

hash_function()

template<class KEY , class HASH , class EQUAL >

HASH bdlc::FlatHashSet< KEY, HASH, EQUAL >::hash_function ( ) const

inline

Return (a copy of) the unary hash functor used by this set to generate a hash value (of type bsl::size_t) for a KEY object.

insert() [1/3]

template<class KEY , class HASH , class EQUAL >

template<class KEY_TYPE >

bsl::enable_if< bsl::is_convertible< KEY_TYPE, KEY >::value, bsl::pair< const_iterator, bool > >::type bdlc::FlatHashSet< KEY, HASH, EQUAL >::insert ( BSLS_COMPILERFEATURES_FORWARD_REF(KEY_TYPE)  value )

inline

Insert the specified value into this set if the value does not already exist in this set; otherwise, this method has no effect. Return a pair whose first member is a const_iterator referring to the (possibly newly inserted) element in this set whose value is equivalent to that of the element to be inserted, and whose second member is true if a new element was inserted, and false if an equivalent value was already present.

insert() [2/3]

template<class KEY , class HASH , class EQUAL >

template<class KEY_TYPE >

bsl::enable_if< bsl::is_convertible< KEY_TYPE, KEY >::value, const_iterator >::type bdlc::FlatHashSet< KEY, HASH, EQUAL >::insert ( const_iterator  , BSLS_COMPILERFEATURES_FORWARD_REF(KEY_TYPE)  value  )

inline

Insert the specified value into this set if the value does not already exist in this set; otherwise, this method has no effect. Return a const_iterator referring to the (possibly newly inserted) element in this set whose value is equivalent to that of the element to be inserted. The supplied const_iterator is ignored.

insert() [3/3]

template<class KEY , class HASH , class EQUAL >

template<class INPUT_ITERATOR >

void bdlc::FlatHashSet< KEY, HASH, EQUAL >::insert ( INPUT_ITERATOR  first, INPUT_ITERATOR  last  )

inline

Insert into this set the value of each element in the input iterator range specified by first through last (including first, excluding last). The behavior is undefined unless first and last refer to a sequence of valid values where first is at a position at or before last. Note that if a member of the input sequence is equivalent to an earlier member, the later member will not be inserted.

key_eq()

template<class KEY , class HASH , class EQUAL >

EQUAL bdlc::FlatHashSet< KEY, HASH, EQUAL >::key_eq ( ) const

inline

Return (a copy of) the binary key-equality functor that returns true if the value of two KEY objects are equivalent, and false otherwise.

load_factor()

template<class KEY , class HASH , class EQUAL >

float bdlc::FlatHashSet< KEY, HASH, EQUAL >::load_factor ( ) const

inline

Return the current ratio between the number of elements in this container and its capacity.

max_load_factor()

template<class KEY , class HASH , class EQUAL >

float bdlc::FlatHashSet< KEY, HASH, EQUAL >::max_load_factor ( ) const

inline

Return the maximum load factor allowed for this set. Note that if an insert operation would cause the load factor to exceed max_load_factor(), that same insert operation will increase the capacity and rehash the entries of the container (see {Load Factor and Resizing}). Also note that the value returned by max_load_factor is implementation defined and cannot be changed by the user.

operator=() [1/2]

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL > & bdlc::FlatHashSet< KEY, HASH, EQUAL >::operator= ( bslmf::MovableRef< FlatHashSet< KEY, HASH, EQUAL > >  rhs )

inline

Assign to this object the value, hasher, and equality comparator of the specified rhs object, and return a reference providing modifiable access to this object. If this object and rhs use the same allocator the contents of rhs are moved (in constant time) to this object. rhs is left in a (valid) unspecified state.

operator=() [2/2]

template<class KEY , class HASH , class EQUAL >

FlatHashSet< KEY, HASH, EQUAL > & bdlc::FlatHashSet< KEY, HASH, EQUAL >::operator= ( const FlatHashSet< KEY, HASH, EQUAL > &  rhs )

inline

Assign to this object the value, hasher, and equality functor of the specified rhs object, and return a reference providing modifiable access to this object.

print()

template<class KEY , class HASH , class EQUAL >

bsl::ostream & bdlc::FlatHashSet< KEY, HASH, EQUAL >::print	(	bsl::ostream &	stream,
		int	level = 0,
		int	spacesPerLevel = 4
	)		const

Format this object to the specified output stream at the (absolute value of) the optionally specified indentation level, and return a reference to the modifiable stream. If level is specified, optionally specify spacesPerLevel, the number of spaces per indentation level for this and all of its nested objects. If level is negative, suppress indentation of the first line. If spacesPerLevel is negative, format the entire output on one line, suppressing all but the initial indentation (as governed by level). If stream is not valid on entry, this operation has no effect.

rehash()

template<class KEY , class HASH , class EQUAL >

void bdlc::FlatHashSet< KEY, HASH, EQUAL >::rehash ( bsl::size_t  minimumCapacity )

inline

Change the capacity of this set to at least the specified minimumCapacity, and redistribute all the contained elements into a new sequence of entries according to their hash values. If 0 == minimumCapacity and 0 == size(), the set is returned to the default constructed state. After this call, load_factor() will be less than or equal to max_load_factor() and all iterators, pointers, and references to elements of this set are invalidated.

reserve()

template<class KEY , class HASH , class EQUAL >

void bdlc::FlatHashSet< KEY, HASH, EQUAL >::reserve ( bsl::size_t  numEntries )

inline

Change the capacity of this set to at least a capacity that can accommodate the specified numEntries (accounting for the load factor invariant), and redistribute all the contained elements into a new sequence of entries according to their hash values. If 0 == numEntries and 0 == size(), the set is returned to the default constructed state. After this call, load_factor() will be less than or equal to max_load_factor() and all iterators, pointers, and references to elements of this set are invalidated. Note that this method is effectively equivalent to:

   rehash(bsl::ceil(numEntries / max_load_factor()))

reset()

template<class KEY , class HASH , class EQUAL >

void bdlc::FlatHashSet< KEY, HASH, EQUAL >::reset ( )

inline

Remove all elements from this set and release all memory from this set, returning the set to the default constructed state.

size()

template<class KEY , class HASH , class EQUAL >

bsl::size_t bdlc::FlatHashSet< KEY, HASH, EQUAL >::size ( ) const

inline

swap()

template<class KEY , class HASH , class EQUAL >

void bdlc::FlatHashSet< KEY, HASH, EQUAL >::swap ( FlatHashSet< KEY, HASH, EQUAL > &  other )

inline

Exchange the value of this object as well as its hasher and equality functors with those of the specified other object. The behavior is undefined unless this object was created with the same allocator as other.

Friends And Related Symbol Documentation

operator!=

template<class KEY , class HASH , class EQUAL >

bool operator!= ( const FlatHashSet< KEY, HASH, EQUAL > &  , const FlatHashSet< KEY, HASH, EQUAL > &    )

friend

Return true if the specified lhs and rhs objects do not have the same value, and false otherwise. Two FlatHashSet objects do not have the same value if their sizes are different or one contains an element equal to no element of the other. The hash and equality functors are not involved in the comparison.

operator==

template<class KEY , class HASH , class EQUAL >

bool operator== ( const FlatHashSet< KEY, HASH, EQUAL > &  , const FlatHashSet< KEY, HASH, EQUAL > &    )

friend

Return true if the specified lhs and rhs objects have the same value, and false otherwise. Two FlatHashSet objects have the same value if their sizes are the same and each element contained in one is equal to an element of the other. The hash and equality functors are not involved in the comparison.

swap

template<class KEY , class HASH , class EQUAL >

template<class K , class H , class E >

void swap ( FlatHashSet< K, H, E > &  , FlatHashSet< K, H, E > &    )

friend

---

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

• bdlc_flathashset.h