boost::icl::tuple_computer_base< VarCount, CounterT > Class Template Reference

Base class template for tuple computers aggregating values associated to tuples. More...

Inherits boost::icl::tuple_computer_interface< VarCount >.

List of all members.

Public Types
A: Type definitions for the template class
typedef ImplMapTD::const_iterator	const_iterator
	const_iterator
typedef CounterT	counter_type
typedef ImplMapTD::data_type	data_type
	data type of the implementing container
typedef icl::map < var_tuple_type, CounterT, partial_absorber, var_tuple_order >	ImplMapTD
	Container type for the implementation.
typedef ImplMapTD::iterator	iterator
	iterator
typedef ImplMapTD::key_compare	key_compare
	Type of strict weak ordering.
typedef ImplMapTD::key_type	key_type
	key type of the implementing container
typedef var_tuple_order < var_tuple_type >	tuple_order_type
typedef ImplMapTD::value_type	value_type
	value type of the implementing container
typedef var_tuple< VarCount >	var_tuple_type
Public Member Functions
void	clear ()
	Remove all elements from the map.
bool	contains (const value_type &x) const
	Does the map contain a valuepair (tupel, counter).
bool	contains (const var_tuple_type &x) const
	Does the map contain an element for key x.
void	domain (tuple_set_type &domain) const
	Get the set of keys.
bool	empty () const
	Is the map empty?
tuple_computer_base &	operator= (const tuple_computer_base &src)
	Assignment operator.
	tuple_computer_base (const key_compare &ord)
	Construct from order.
	tuple_computer_base (const tuple_computer_base &src)
	Copy constructor.
	tuple_computer_base ()
	Default constructor for the empty map.
virtual	~tuple_computer_base ()
	Virtual destructor.
S: String representation
std::string	as_string () const
I: Interval iterators
const_iterator	begin () const
iterator	begin ()
const_iterator	end () const
iterator	end ()
H: value search
const_iterator	find (const var_tuple_type &tupel) const
iterator	find (const var_tuple_type &tupel)
G: Modificators
void	insert (const value_type &vt)
void	insert (const var_tuple_type &t, CounterT x)
F: Tester
bool	isEqual (const tuple_computer_base &x2) const
	Equality.
bool	isSubsetOf (const tuple_computer_base &super) const
	*this is subset of super
bool	operator!= (const tuple_computer_base &x2) const
	Inequality operator.
bool	operator<= (const tuple_computer_base &super) const
	*this is subset of super
bool	operator== (const tuple_computer_base &x2) const
	Equality operator.

---

Detailed Description

template<int VarCount, class CounterT>
class boost::icl::tuple_computer_base< VarCount, CounterT >

Base class template for tuple computers aggregating values associated to tuples.

On insertion of a (t1, ..., tn)->v tuple value pair, a value within the tuple computer is summed by v, if the tuple t is already contained in the tuple_computer_base.

Template parameter VarCount defines the size of the tuples.

Template parameter CounterT is the value type of the tuple_computer_base. Those are the values to aggregated.

---

Member Typedef Documentation

template<int VarCount, class CounterT>

typedef icl::map<var_tuple_type, CounterT, partial_absorber, var_tuple_order> boost::icl::tuple_computer_base< VarCount, CounterT >::ImplMapTD

Container type for the implementation.

template<int VarCount, class CounterT>

typedef ImplMapTD::iterator boost::icl::tuple_computer_base< VarCount, CounterT >::iterator

iterator

template<int VarCount, class CounterT>

typedef ImplMapTD::const_iterator boost::icl::tuple_computer_base< VarCount, CounterT >::const_iterator

const_iterator

template<int VarCount, class CounterT>

typedef ImplMapTD::value_type boost::icl::tuple_computer_base< VarCount, CounterT >::value_type

value type of the implementing container

template<int VarCount, class CounterT>

typedef ImplMapTD::key_type boost::icl::tuple_computer_base< VarCount, CounterT >::key_type

key type of the implementing container

Reimplemented in boost::icl::amount_tuple_computer< VarCount, CounteeT >.

template<int VarCount, class CounterT>

typedef ImplMapTD::data_type boost::icl::tuple_computer_base< VarCount, CounterT >::data_type

data type of the implementing container

template<int VarCount, class CounterT>

typedef ImplMapTD::key_compare boost::icl::tuple_computer_base< VarCount, CounterT >::key_compare

Type of strict weak ordering.

Reimplemented in boost::icl::amount_tuple_computer< VarCount, CounteeT >, boost::icl::date_tuple_computer< VarCount, TimeT, CounteeT >, and boost::icl::interval_tuple_computer< VarCount, TimeT, CounteeT >.

---

Constructor & Destructor Documentation

template<int VarCount, class CounterT>

boost::icl::tuple_computer_base< VarCount, CounterT >::tuple_computer_base

(

)

[inline]

Default constructor for the empty map.

template<int VarCount, class CounterT>

boost::icl::tuple_computer_base< VarCount, CounterT >::tuple_computer_base

(

const tuple_computer_base< VarCount, CounterT > &

src

)

[inline]

Copy constructor.

template<int VarCount, class CounterT>

boost::icl::tuple_computer_base< VarCount, CounterT >::tuple_computer_base

(

const key_compare &

ord

)

[inline]

Construct from order.

template<int VarCount, class CounterT>

virtual boost::icl::tuple_computer_base< VarCount, CounterT >::~tuple_computer_base

(

)

[inline, virtual]

Virtual destructor.

---

Member Function Documentation

template<int VarCount, class CounterT>

tuple_computer_base& boost::icl::tuple_computer_base< VarCount, CounterT >::operator=

(

const tuple_computer_base< VarCount, CounterT > &

src

)

[inline]

Assignment operator.

template<int VarCount, class CounterT>

void boost::icl::tuple_computer_base< VarCount, CounterT >::clear

(

)

[inline]

Remove all elements from the map.

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::empty

(

)

const [inline]

Is the map empty?

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::contains

(

const var_tuple_type &

x

)

const [inline]

Does the map contain an element for key x.

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::contains

(

const value_type &

x

)

const

Does the map contain a valuepair (tupel, counter).

template<int VarCount, class CounterT >

void boost::icl::tuple_computer_base< VarCount, CounterT >::domain

(

tuple_set_type &

domain

)

const [inline]

Get the set of keys.

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::isSubsetOf

(

const tuple_computer_base< VarCount, CounterT > &

super

)

const

*this is subset of super

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::operator<=

(

const tuple_computer_base< VarCount, CounterT > &

super

)

const

*this is subset of super

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::isEqual

(

const tuple_computer_base< VarCount, CounterT > &

x2

)

const [inline]

Equality.

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::operator==

(

const tuple_computer_base< VarCount, CounterT > &

x2

)

const [inline]

Equality operator.

template<int VarCount, class CounterT>

bool boost::icl::tuple_computer_base< VarCount, CounterT >::operator!=

(

const tuple_computer_base< VarCount, CounterT > &

x2

)

const [inline]

Inequality operator.

template<int VarCount, class CounterT>

void boost::icl::tuple_computer_base< VarCount, CounterT >::insert	(	const var_tuple_type &	t,
		CounterT	x
	)			[inline]

Insertion of a (tupel, content) pair (t,x)

template<int VarCount, class CounterT>

void boost::icl::tuple_computer_base< VarCount, CounterT >::insert

(

const value_type &

vt

)

[inline]

Insertion of a (tupel, content) pair as value_pair

template<int VarCount, class CounterT>

iterator boost::icl::tuple_computer_base< VarCount, CounterT >::find

(

const var_tuple_type &

tupel

)

[inline]

---

The documentation for this class was generated from the following file:

• boost/icl_xt/tuple_computer.hpp