boost::icl::add_iterator< ContainerT > | Performes an addition using a container's memberfunction add, when operator= is called |
boost::icl::amount_tuple_computer< VarCount, CounteeT > | An amount_tuple_computer aggregates values (amounts) associated to tuples |
boost::icl::date_tuple_computer< VarCount, TimeT, CounteeT > | A date_tuple_computer aggregates points in time (dates) associated to tuples |
boost::icl::insert_iterator< ContainerT > | Performes an insertion using a container's memberfunction add, when operator= is called |
boost::icl::interval_base_map< SubType, DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc > | Implements a map as a map of intervals (base class) |
boost::icl::interval_base_set< SubType, DomainT, Compare, Interval, Alloc > | Implements a set as a set of intervals (base class) |
boost::icl::interval_bitset< DomainT, BitSetT, Compare, Interval, Alloc > | Large bitsets that combine interval compression and bitcompression |
boost::icl::interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc > | Implements a map as a map of intervals - on insertion overlapping intervals are split and associated values are combined |
boost::icl::interval_set< DomainT, Compare, Interval, Alloc > | Implements a set as a set of intervals - merging adjoining intervals |
boost::icl::interval_tuple_computer< VarCount, TimeT, CounteeT > | Aggregates intervals associated to tuples |
boost::icl::Law< SubType, InputTypes, OutputTypes > | An abstract class template Law |
boost::icl::LawValidater< LawT, GentorT > | A class template for test machines |
boost::icl::LawValidaterI | An interface for a test machine |
boost::icl::map< DomainT, CodomainT, Traits, Compare, Combine, Section, Alloc > | Addable, subractable and intersectable maps |
boost::icl::product_history< ItvDomTV, TypeDomTV > | Adds episodes of different types into a single history of episode_products |
boost::icl::separate_interval_set< DomainT, Compare, Interval, Alloc > | Implements a set as a set of intervals - leaving adjoining intervals separate |
boost::icl::split_interval_map< DomainT, CodomainT, Traits, Compare, Combine, Section, Interval, Alloc > | Implements a map as a map of intervals - on insertion overlapping intervals are split and associated values are combined |
boost::icl::split_interval_set< DomainT, Compare, Interval, Alloc > | Implements a set as a set of intervals - on insertion overlapping intervals are split |
boost::icl::tuple_computer_base< VarCount, CounterT > | Base class template for tuple computers aggregating values associated to tuples |