$extrastylesheet
#include <mln/util/set.hh>
Public Member Functions | |
set () | |
void | clear () |
const T | first_element () const |
bool | has (const T &elt) const |
set< T > & | insert (const T &elt) |
template<typename U > | |
set< T > & | insert (const set< U > &other) |
bool | is_empty () const |
bool | is_frozen_ () const |
const T | last_element () const |
std::size_t | memory_size () const |
unsigned | nelements () const |
const T & | operator[] (unsigned i) const |
set< T > & | remove (const T &elt) |
const std::vector< T > & | std_vector () const |
Public Types | |
typedef set_bkd_iter< T > | bkd_eiter |
typedef Object< void > | category |
typedef fwd_eiter | eiter |
typedef T | element |
typedef mln::util::set< T > | exact_t |
typedef set_fwd_iter< T > | fwd_eiter |
An "efficient" mathematical set class.
This set class is designed to store a mathematical set and to present it to the user as a linear array (std::vector).
Elements are stored by copy. Implementation is lazy.
The set has two states: frozen or not. There is an automatic switch of state when the user modifies its contents (insert, remove, or clear) or access to its contents (op[i]).
The parameter T
is the element type, which shall not be const-qualified.
The unicity (and the order) of set elements is handled by the mln::util::ord mechanism.
Definition at line 81 of file util/set.hh.
mln::util::set< T >::set | ( | ) |
Constructor without arguments.
void mln::util::set< T >::clear | ( | ) |
Empty the set.
All elements contained in the set are destroyed so the set is emptied.
const T mln::util::set< T >::first_element | ( | ) | const |
Return the first element of the set.
bool mln::util::set< T >::has | ( | const T & | elt | ) | const |
Test if the object elt
belongs to the set.
[in] | elt | A possible element of the set. |
elt
is in the set. set<T>& mln::util::set< T >::insert | ( | const T & | elt | ) |
Insert an element elt
into the set.
[in] | elt | The element to be inserted. |
If elt
is already in the set, this method is a no-op.
set<T>& mln::util::set< T >::insert | ( | const set< U > & | other | ) |
Insert the elements of other
into the set.
[in] | other | The set containing the elements to be inserted. |
bool mln::util::set< T >::is_empty | ( | ) | const |
Test if the set is empty.
bool mln::util::set< T >::is_frozen_ | ( | ) | const |
Test if the set is frozen.
const T mln::util::set< T >::last_element | ( | ) | const |
Return the last element of the set.
std::size_t mln::util::set< T >::memory_size | ( | ) | const |
Return the size of this set in memory.
unsigned mln::util::set< T >::nelements | ( | ) | const |
Return the number of elements of the set.
const T& mln::util::set< T >::operator[] | ( | unsigned | i | ) | const |
Return the i-th element of the set.
[in] | i | Index of the element to retrieve. |
The element is returned by reference and is constant.
set<T>& mln::util::set< T >::remove | ( | const T & | elt | ) |
Remove an element elt
into the set.
[in] | elt | The element to be inserted. |
If elt
is already in the set, this method is a no-op.
const std::vector<T>& mln::util::set< T >::std_vector | ( | ) | const |
Give access to the set elements.
The complexity of this method is O(1).
typedef set_bkd_iter<T> mln::util::set< T >::bkd_eiter |
Backward iterator associated type.
Definition at line 93 of file util/set.hh.
|
inherited |
typedef fwd_eiter mln::util::set< T >::eiter |
Iterator associated type.
Definition at line 96 of file util/set.hh.
typedef T mln::util::set< T >::element |
Element associated type.
Definition at line 86 of file util/set.hh.
|
inherited |
typedef set_fwd_iter<T> mln::util::set< T >::fwd_eiter |
Forward iterator associated type.
Definition at line 90 of file util/set.hh.