#include <p_vaccess.hh>
Inherits mln::internal::site_set_base_< S::site, mln::p_vaccess< V, S > >, and site_set_impl< S >.
Public Types | |
typedef p_double_piter< self_, typename vset::bkd_viter, typename S::bkd_piter > | bkd_piter |
Backward Site_Iterator associated type. | |
typedef S::element | element |
Element associated type. | |
typedef p_double_piter< self_, typename vset::fwd_viter, typename S::fwd_piter > | fwd_piter |
Forward Site_Iterator associated type. | |
typedef std::pair< V, element > | i_element |
Insertion element associated type. | |
typedef fwd_piter | piter |
Site_Iterator associated type. | |
typedef S | pset |
Inner site set associated type. | |
typedef p_double_psite< self_, S > | psite |
Psite associated type. | |
typedef V | value |
Value associated type. | |
typedef mln::value::set< V > | vset |
Value_Set associated type. | |
Public Member Functions | |
bool | has (const V &v, const typename S::psite &p) const |
Test if the couple (value v , psite p ) belongs to this site set. | |
bool | has (const psite &p) const |
Test if p belongs to this site set. | |
void | insert (const V &v, const element &e) |
Insert e at value v . | |
void | insert (const i_element &v_e) |
Insert a pair v_e (value v, element e). | |
bool | is_valid () const |
Test if this site set is valid. | |
std::size_t | memory_size () const |
Return the size of this site set in memory. | |
const S & | operator() (const V &v) const |
Return the site set at value v . | |
p_vaccess () | |
Constructor. | |
const mln::value::set< V > & | values () const |
Give the set of values. | |
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 . |
typedef p_double_piter<self_, typename vset ::bkd_viter, typename S ::bkd_piter> mln::p_vaccess< V, S >::bkd_piter |
Backward Site_Iterator associated type.
typedef S ::element mln::p_vaccess< V, S >::element |
Element associated type.
typedef p_double_piter<self_, typename vset ::fwd_viter, typename S ::fwd_piter> mln::p_vaccess< V, S >::fwd_piter |
Forward Site_Iterator associated type.
typedef std::pair<V, element> mln::p_vaccess< V, S >::i_element |
Insertion element associated type.
typedef fwd_piter mln::p_vaccess< V, S >::piter |
Site_Iterator associated type.
typedef S mln::p_vaccess< V, S >::pset |
Inner site set associated type.
typedef p_double_psite<self_, S> mln::p_vaccess< V, S >::psite |
Psite associated type.
typedef V mln::p_vaccess< V, S >::value |
Value associated type.
typedef mln::value::set<V> mln::p_vaccess< V, S >::vset |
Value_Set associated type.
mln::p_vaccess< V, S >::p_vaccess | ( | ) | [inline] |
Constructor.
bool mln::p_vaccess< V, S >::has | ( | const V & | v, | |
const typename S::psite & | p | |||
) | const [inline] |
bool mln::p_vaccess< V, S >::has | ( | const psite & | p | ) | const [inline] |
Test if p
belongs to this site set.
void mln::p_vaccess< V, S >::insert | ( | const V & | v, | |
const element & | e | |||
) | [inline] |
Insert e
at value v
.
void mln::p_vaccess< V, S >::insert | ( | const i_element & | v_e | ) | [inline] |
Insert a pair v_e
(value v, element e).
bool mln::p_vaccess< V, S >::is_valid | ( | ) | const [inline] |
Test if this site set is valid.
std::size_t mln::p_vaccess< V, S >::memory_size | ( | ) | const [inline] |
Return the size of this site set in memory.
const S & mln::p_vaccess< V, S >::operator() | ( | const V & | v | ) | const [inline] |
const mln::value::set< V > & mln::p_vaccess< V, S >::values | ( | ) | const [inline] |
Give the set of values.
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
.