RLib  5.7
RLib - an opensource, lightweight and multi-platform framework for cpp programming
System::Collections::Generic::HashSet< K, hasher, allocator, kdisposer > Class Template Reference
Inheritance diagram for System::Collections::Generic::HashSet< K, hasher, allocator, kdisposer >:
System::Collections::Generic::HashMap< K, intptr_t, hasher, allocator, kdisposer >

Classes

struct  Iterator
 

Public Member Functions

bool Contains (const K &element) const
 Returns true if the set contains the specified element. More...
 
void Add (const K &element)
 Adds the specified element to the set. More...
 
bool Remove (const K &element)
 Removes the specified element from the set. More...
 
Iterator begin () const
 Returns an iterator to the first element of the container. If the container is empty or nothing, the returned iterator will be equal to end() More...
 
Iterator end () const
 Returns an iterator to the element following the last element of the container. This element acts as a placeholder; attempting to access it results in undefined behavior. More...
 

Member Function Documentation

template<typename K , class hasher = IHash<K, __int64>, class allocator = IO::IAllocator, typename kdisposer = IDisposable<K>>
void System::Collections::Generic::HashSet< K, hasher, allocator, kdisposer >::Add ( const K &  element)
inline

Adds the specified element to the set.

template<typename K , class hasher = IHash<K, __int64>, class allocator = IO::IAllocator, typename kdisposer = IDisposable<K>>
Iterator System::Collections::Generic::HashSet< K, hasher, allocator, kdisposer >::begin ( ) const
inline

Returns an iterator to the first element of the container. If the container is empty or nothing, the returned iterator will be equal to end()

template<typename K , class hasher = IHash<K, __int64>, class allocator = IO::IAllocator, typename kdisposer = IDisposable<K>>
bool System::Collections::Generic::HashSet< K, hasher, allocator, kdisposer >::Contains ( const K &  element) const
inline

Returns true if the set contains the specified element.

template<typename K , class hasher = IHash<K, __int64>, class allocator = IO::IAllocator, typename kdisposer = IDisposable<K>>
Iterator System::Collections::Generic::HashSet< K, hasher, allocator, kdisposer >::end ( ) const
inline

Returns an iterator to the element following the last element of the container. This element acts as a placeholder; attempting to access it results in undefined behavior.

template<typename K , class hasher = IHash<K, __int64>, class allocator = IO::IAllocator, typename kdisposer = IDisposable<K>>
bool System::Collections::Generic::HashSet< K, hasher, allocator, kdisposer >::Remove ( const K &  element)
inline

Removes the specified element from the set.


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