#include <p_mutable_array_of.hh>
Inherits mln::internal::site_set_base_< S::site, mln::p_mutable_array_of< S > >.
Public Types | |
typedef p_double_piter< self_, mln_bkd_eiter(array_), typename S::bkd_piter > | bkd_piter |
Backward Site_Iterator associated type. | |
typedef S | element |
Element associated type. | |
typedef p_double_piter< self_, mln_fwd_eiter(array_), typename S::fwd_piter > | fwd_piter |
Forward Site_Iterator associated type. | |
typedef S | i_element |
Insertion element associated type. | |
typedef fwd_piter | piter |
Site_Iterator associated type. | |
typedef p_double_psite< self_, element > | psite |
Psite associated type. | |
Public Member Functions | |
void | clear () |
Clear this set. | |
bool | has (const psite &p) const |
Test if p belongs to this point set. | |
void | insert (const S &s) |
Insert a site set s . | |
bool | is_valid () const |
Test this set validity so returns always true. | |
std::size_t | memory_size () const |
Return the size of this site set in memory. | |
unsigned | nelements () const |
Give the number of elements (site sets) of this composite. | |
S & | operator[] (unsigned i) |
Return the i-th site set (mutable version). | |
const S & | operator[] (unsigned i) const |
Return the i-th site set (const version). | |
p_mutable_array_of () | |
Constructor without arguments. | |
void | reserve (unsigned n) |
Reserve memory for n elements. | |
Related Functions | |
(Note that these are not member functions.) | |
template<typename Sl, typename Sr> | |
p_set< typename Sl::site > | diff (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Set theoretic difference of lhs and rhs . | |
template<typename Sl, typename Sr> | |
p_set< typename Sl::site > | inter (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Intersection between a couple of point sets. | |
template<typename Sl, typename Sr> | |
bool | operator< (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Strict inclusion test between site sets lhs and rhs . | |
template<typename S> | |
std::ostream & | operator<< (std::ostream &ostr, const Site_Set< S > &set) |
Print a site set set into the output stream ostr . | |
template<typename Sl, typename Sr> | |
bool | operator<= (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Inclusion test between site sets lhs and rhs . | |
template<typename Sl, typename Sr> | |
bool | operator== (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Equality test between site sets lhs and rhs . | |
template<typename Sl, typename Sr> | |
p_set< typename Sl::site > | sym_diff (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Set theoretic symmetrical difference of lhs and rhs . | |
template<typename Sl, typename Sr> | |
p_set< typename Sl::site > | uni (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Union of a couple of point sets. | |
template<typename S> | |
p_set< typename S::site > | unique (const Site_Set< S > &s) |
Give the unique set of s . |
Parameter S
is the type of the contained site sets.
typedef p_double_piter<self_, mln_bkd_eiter(array_), typename S ::bkd_piter> mln::p_mutable_array_of< S >::bkd_piter |
Backward Site_Iterator associated type.
typedef S mln::p_mutable_array_of< S >::element |
Element associated type.
typedef p_double_piter<self_, mln_fwd_eiter(array_), typename S ::fwd_piter> mln::p_mutable_array_of< S >::fwd_piter |
Forward Site_Iterator associated type.
typedef S mln::p_mutable_array_of< S >::i_element |
Insertion element associated type.
typedef fwd_piter mln::p_mutable_array_of< S >::piter |
Site_Iterator associated type.
typedef p_double_psite<self_, element> mln::p_mutable_array_of< S >::psite |
Psite associated type.
mln::p_mutable_array_of< S >::p_mutable_array_of | ( | ) | [inline] |
Constructor without arguments.
void mln::p_mutable_array_of< S >::clear | ( | ) | [inline] |
Clear this set.
bool mln::p_mutable_array_of< S >::has | ( | const psite & | p | ) | const [inline] |
void mln::p_mutable_array_of< S >::insert | ( | const S & | s | ) | [inline] |
bool mln::p_mutable_array_of< S >::is_valid | ( | ) | const [inline] |
Test this set validity so returns always true.
std::size_t mln::p_mutable_array_of< S >::memory_size | ( | ) | const [inline] |
Return the size of this site set in memory.
unsigned mln::p_mutable_array_of< S >::nelements | ( | ) | const [inline] |
Give the number of elements (site sets) of this composite.
S & mln::p_mutable_array_of< S >::operator[] | ( | unsigned | i | ) | [inline] |
Return the i-th
site set (mutable version).
const S & mln::p_mutable_array_of< S >::operator[] | ( | unsigned | i | ) | const [inline] |
Return the i-th
site set (const version).
void mln::p_mutable_array_of< S >::reserve | ( | unsigned | n | ) | [inline] |
Reserve memory for n
elements.
p_set< typename Sl::site > diff | ( | const Site_Set< Sl > & | lhs, | |
const Site_Set< Sr > & | rhs | |||
) | [related, inherited] |
Set theoretic difference of lhs
and rhs
.
p_set< typename Sl::site > inter | ( | const Site_Set< Sl > & | lhs, | |
const Site_Set< Sr > & | rhs | |||
) | [related, inherited] |
Intersection between a couple of point sets.
std::ostream & operator<< | ( | std::ostream & | ostr, | |
const Site_Set< S > & | set | |||
) | [related, inherited] |
p_set< typename Sl::site > sym_diff | ( | const Site_Set< Sl > & | lhs, | |
const Site_Set< Sr > & | rhs | |||
) | [related, inherited] |
Set theoretic symmetrical difference of lhs
and rhs
.
p_set< typename Sl::site > uni | ( | const Site_Set< Sl > & | lhs, | |
const Site_Set< Sr > & | rhs | |||
) | [related, inherited] |
Union of a couple of point sets.
p_set< typename S::site > unique | ( | const Site_Set< S > & | s | ) | [related, inherited] |
Give the unique set of s
.