Hpl1::Std::set< T, CompFn > Class Template Reference

Public Types
using	iterator = typename TreeT::BasicIterator
using	const_iterator = typename TreeT::ConstIterator

Public Member Functions
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
void	clear ()
bool	empty ()
size_t	size ()
iterator	find (const T &item)
Common::Pair< iterator, bool >	insert (const T &item)
void	erase (iterator item)
void	erase (iterator first, iterator last)
size_t	erase (const T &item)
size_t	count (const T &item) const

Member Function Documentation

find()

template<class T, class CompFn = Common::Less<T>>

iterator Hpl1::Std::set< T, CompFn >::find ( const T &  item )

inline

Locate an item in the set

insert()

template<class T, class CompFn = Common::Less<T>>

Common::Pair<iterator, bool> Hpl1::Std::set< T, CompFn >::insert ( const T &  item )

inline

Insert an element at the sorted position.

count()

template<class T, class CompFn = Common::Less<T>>

size_t Hpl1::Std::set< T, CompFn >::count ( const T &  item ) const

inline

Returns the number of keys that match the specified key

---

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

• engines/hpl1/std/set.h