mln::p_key< K, P > Class Template Reference
[Queue based]

Priority queue class. More...

#include <p_key.hh>

Inherits mln::internal::site_set_base_< P, mln::p_key< K, P > >.

List of all members.

Public Types

typedef p_double_piter< self_,
mln_bkd_eiter(util::set< K >
), typename p_set
::bkd_piter > bkd_piter

Backward Site_Iterator associated type.

typedef P element

Element associated type.

typedef p_double_piter< self_,
mln_fwd_eiter(util::set< K >
), typename p_set
::fwd_piter > fwd_piter

Forward Site_Iterator associated type.

typedef std::pair< K, P > i_element

Insertion element associated type.

typedef fwd_piter piter

Site_Iterator associated type.

typedef p_double_psite< self_,
p_set > psite

Psite associated type.

typedef P r_element

Removal element associated type.

Public Member Functions

void change_key (const K &k, const K &new_k)

Change the key k into a new value new_k.

template<typename F>

void change_keys (const Function_v2v< F > &f)

Change the keys by applying the function f.

void clear ()

Clear this site set.

bool exists_key (const K &key) const

Test if the priority exists.

bool has (const P &p) const

Test is the psite p belongs to this site set.

bool has (const psite &) const

Test is the psite p belongs to this site set.

void insert (const K &k, const P &p)

Insert a pair (key k, site p).

void insert (const i_element &k_p)

Insert a pair k_p (key k, site p).

bool is_valid () const

Test this set validity so returns always true.

const K & key (const P &p) const

Give the key associated with site p.

const util::set< K > & keys () const

Give the set of keys.

std::size_t memory_size () const

Return the size of this site set in memory.

unsigned nsites () const

Give the number of sites.

const p_set & operator() (const K &key) const

Give the queue with the priority priority.

p_key ()

Constructor.

void remove (const P &p)

Remove a site p.

void remove_key (const K &k)

Remove all sites with key k.

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.

Detailed Description