Site set in which sites are grouped by their associated value. More...
#include <p_vaccess.hh>
Public Types | |
typedef p_double_piter< self_, typename vset::bkd_viter, typename S::bkd_piter > | bkd_piter |
Backward Site_Iterator associated type. | |
typedef Site_Set< void > | category |
typedef S::element | element |
Element associated type. | |
typedef p_vaccess< V, S > | exact_t |
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 subject< S::site >::ret | site |
Site associated type. | |
typedef vset | t_eligible_values_set |
typedef V | value |
Value associated type. | |
typedef mln::value::set< V > | vset |
Value_Set associated type. | |
Public Member Functions | |
void | clear () |
bool | has (const psite &p) const |
Test if p belongs to this site set. | |
bool | has (const V &v, const typename S::psite &p) const |
Test if the couple (value v , psite p ) belongs to this site set. | |
void | insert (const i_element &v_e) |
Insert a pair v_e (value v, element e). | |
void | insert (const V &v, const element &e) |
Insert e at value v . | |
bool | is_empty () const |
Test if the site set is empty. | |
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 (const V &vset) | |
p_vaccess () | |
Constructor. | |
const mln::value::set< V > & | set_1_ () const |
const S & | set_2_ (const V &v) const |
const mln::value::set< V > & | values () const |
Give the set of values. | |
Protected Member Functions | |
void | update_nsites_ (const T &) |
Protected Attributes | |
std::vector< S > | ps_ |
mln::value::set< V > | vs_ |
Private Types | |
typedef p_vaccess< V, S > | self_ |
Site set in which sites are grouped by their associated value.
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 Site_Set<void> mln::Site_Set< p_vaccess< V, S > >::category [inherited] |
Reimplemented from mln::Object< p_vaccess< V, S > >.
typedef S ::element mln::p_vaccess< V, S >::element |
Element associated type.
typedef p_vaccess< V, S > mln::Object< p_vaccess< V, S > >::exact_t [inherited] |
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 p_vaccess<V,S> mln::p_vaccess< V, S >::self_ [private] |
typedef subject<S::site >::ret mln::internal::site_set_base_< S::site , p_vaccess< V, S > >::site [inherited] |
Site associated type.
typedef vset mln::p_vaccess< V, S >::t_eligible_values_set |
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.
mln::p_vaccess< V, S >::p_vaccess | ( | const V & | vset | ) | [inline] |
void mln::p_vaccess< V, S >::clear | ( | ) | [inline] |
bool mln::p_vaccess< V, S >::has | ( | const V & | v, | |
const typename S::psite & | p | |||
) | const [inline] |
Test if the couple (value v
, psite p
) belongs to this site set.
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 i_element & | v_e | ) | [inline] |
Insert a pair v_e
(value v, element e).
void mln::p_vaccess< V, S >::insert | ( | const V & | v, | |
const element & | e | |||
) | [inline] |
bool mln::internal::site_set_base_< S::site , p_vaccess< V, S > >::is_empty | ( | ) | const [inherited] |
Test if the site set is empty.
This final method dispatches to is_empty_ whose default implementation relies on the 'nsites' method.
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] |
Return the site set at value v
.
const mln::value::set< V > & mln::p_vaccess< V, S >::set_1_ | ( | ) | const [inline] |
const S & mln::p_vaccess< V, S >::set_2_ | ( | const V & | v | ) | const [inline] |
void mln::internal::site_set_impl__nsites< mln_trait_site_set_nsites(S) , S >::update_nsites_ | ( | const T & | ) | [protected, inherited] |
Referenced by mln::p_vaccess< V, S >::insert(), and mln::p_set_of< S >::insert().
const mln::value::set< V > & mln::p_vaccess< V, S >::values | ( | ) | const [inline] |
Give the set of values.
std::vector<S> mln::p_vaccess< V, S >::ps_ [protected] |
mln::value::set<V> mln::p_vaccess< V, S >::vs_ [protected] |