/*-----------------------------------------------------------------------------+ Copyright (c) 2007-2010: Joachim Faulhaber Copyright (c) 1999-2006: Cortex Software GmbH, Kantstrasse 57, Berlin +------------------------------------------------------------------------------+ Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENCE.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +-----------------------------------------------------------------------------*/ #ifndef BOOST_ICL_INTERVAL_SET_HPP_JOFA_990223 #define BOOST_ICL_INTERVAL_SET_HPP_JOFA_990223 #include #include #include namespace boost{namespace icl { /** \brief Implements a set as a set of intervals - merging adjoining intervals */ template < typename DomainT, ICL_COMPARE Compare = ICL_COMPARE_INSTANCE(ICL_COMPARE_DEFAULT, DomainT), ICL_INTERVAL(ICL_COMPARE) Interval = ICL_INTERVAL_INSTANCE(ICL_INTERVAL_DEFAULT, DomainT, Compare), ICL_ALLOC Alloc = std::allocator > class interval_set: public interval_base_set, DomainT,Compare,Interval,Alloc> { public: typedef interval_set type; /// The base_type of this class typedef interval_base_set base_type; typedef type overloadable_type; typedef type joint_type; typedef type key_object_type; /// The domain type of the set typedef DomainT domain_type; /// The codomaintype is the same as domain_type typedef DomainT codomain_type; /// The element type of the set typedef DomainT element_type; /// The interval type of the set typedef ICL_INTERVAL_TYPE(Interval,DomainT,Compare) interval_type; /// The segment type of the set typedef interval_type segment_type; /// Comparison functor for domain values typedef ICL_COMPARE_DOMAIN(Compare,DomainT) domain_compare; /// Comparison functor for intervals typedef exclusive_less_than interval_compare; /// Comparison functor for keys typedef exclusive_less_than key_compare; /// The allocator type of the set typedef Alloc allocator_type; /// allocator type of the corresponding element set typedef Alloc domain_allocator_type; /// The corresponding atomized type representing this interval container of elements typedef typename base_type::atomized_type atomized_type; /// Container type for the implementation typedef typename base_type::ImplSetT ImplSetT; /// key type of the implementing container typedef typename ImplSetT::key_type key_type; /// data type of the implementing container typedef typename ImplSetT::value_type data_type; /// value type of the implementing container typedef typename ImplSetT::value_type value_type; /// iterator for iteration over intervals typedef typename ImplSetT::iterator iterator; /// const_iterator for iteration over intervals typedef typename ImplSetT::const_iterator const_iterator; enum { fineness = 1 }; public: //========================================================================== //= Construct, copy, destruct //========================================================================== /// Default constructor for the empty object interval_set(): base_type() {} /// Copy constructor interval_set(const interval_set& src): base_type(src) {} /// Copy constructor for base_type template explicit interval_set (const interval_base_set& src) { this->assign(src); } /// Constructor for a single element explicit interval_set(const domain_type& value): base_type() { this->add(interval_type(value)); } /// Constructor for a single interval explicit interval_set(const interval_type& itv): base_type() { this->add(itv); } /// Assignment from a base interval_set. template void assign(const interval_base_set& src) { typedef interval_base_set base_set_type; this->clear(); // Has to be implemented via add. there might be touching borders to be joined iterator prior_ = this->_set.end(); ICL_const_FORALL(typename base_set_type, it_, src) prior_ = this->add(prior_, *it_); } /// Assignment operator for base type template interval_set& operator = (const interval_base_set& src) { this->assign(src); return *this; } # ifndef BOOST_ICL_NO_CXX11_RVALUE_REFERENCES //========================================================================== //= Move semantics //========================================================================== /// Move constructor interval_set(interval_set&& src) : base_type(boost::move(src)) {} /// Move assignment operator interval_set& operator = (interval_set src) { base_type::operator=(boost::move(src)); return *this; } //========================================================================== # else /// Assignment operator interval_set& operator = (const interval_set& src) { base_type::operator=(src); return *this; } # endif // BOOST_ICL_NO_CXX11_RVALUE_REFERENCES private: // Private functions that shall be accessible by the baseclass: friend class interval_base_set , DomainT,Compare,Interval,Alloc>; iterator handle_inserted(iterator it_) { return segmental::join_neighbours(*this, it_); } iterator add_over(const interval_type& addend, iterator last_) { iterator joined_ = segmental::join_under(*this, addend, last_); return segmental::join_neighbours(*this, joined_); } iterator add_over(const interval_type& addend) { iterator joined_ = segmental::join_under(*this, addend); return segmental::join_neighbours(*this, joined_); } } ; //----------------------------------------------------------------------------- // type traits //----------------------------------------------------------------------------- template struct is_set > { typedef is_set > type; BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_interval_container > { typedef is_interval_container > type; BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_interval_joiner > { typedef is_interval_joiner > type; BOOST_STATIC_CONSTANT(bool, value = true); }; //----------------------------------------------------------------------------- // type representation //----------------------------------------------------------------------------- template struct type_to_string > { static std::string apply() { return "itv_set<"+ type_to_string::apply() +">"; } }; }} // namespace icl boost #endif