std::set of util::Range, which does not allow any overlap in contained element. std::set<Range> w/ modified insert/emplace function. Original std::set does not allow
modification of element. I assume what we're interested in is "find if the range already \n exists, and merge if it exists". The insert function does that by recursively looking up
overlapping elements w.r.t. input argument of insert function.
More...

#include <Range.h>

Inheritance diagram for util::UniqueRangeSet< T >:

Public Member Functions
	UniqueRangeSet ()
	default ctor More...

	~UniqueRangeSet ()
	default dtor More...

void	Merge (const UniqueRangeSet< T > &in)
	Merge two UniqueRangeSet<T> More...

const T &	Start () const
	Very first "start" of all contained range. More...

const T &	End () const
	Very last "end" of all contained range. More...

UniqueRangeSet< T >	Exclusive (const T start, const T end) const

size_t	emplace (const T &start, const T &end)
	Modified emplace that merges overlapping range. Return = # merged range. More...

size_t	insert (const Range< T > &a)
	Modified insert that merges overlapping range. Return = # merged range. More...

Detailed Description

template<class T>
class util::UniqueRangeSet< T >

std::set of util::Range, which does not allow any overlap in contained element. std::set<Range> w/ modified insert/emplace function. Original std::set does not allow
modification of element. I assume what we're interested in is "find if the range already \n exists, and merge if it exists". The insert function does that by recursively looking up
overlapping elements w.r.t. input argument of insert function.

One important function worth noting is util::UniqueRangeSet::Exclusive which takes two
input arguments, "start" and "end", and returns util::UniqueRangeSet of all exclusive
regions between "start" and "end". By definition, merging this return with the original
instance will result in 1 huge util::Range.

Definition at line 23 of file Range.h.

Constructor & Destructor Documentation

template<class T >

util::UniqueRangeSet< T >::UniqueRangeSet ( )

inline

default ctor

Definition at line 39 of file UniqueRangeSet.h.

39 {}

template<class T >

util::UniqueRangeSet< T >::~UniqueRangeSet ( )

inline

default dtor

Definition at line 41 of file UniqueRangeSet.h.

41 {}

Member Function Documentation

template<class T >

size_t util::UniqueRangeSet< T >::emplace	(	const T &	start,
		const T &	end
	)

inline

Modified emplace that merges overlapping range. Return = # merged range.

Definition at line 94 of file UniqueRangeSet.h.

                                                 {
 
       auto res = std::set<util::Range<T> >::emplace(start,end);
       if(res.second) return 0;
 
       auto& iter = res.first;
       auto tmp_a = Range<T>(start,end);
       size_t ctr=0;
       while(iter != this->end()) {
         tmp_a.Merge((*iter));
         this->erase(iter);
         iter = this->find(tmp_a);
         ++ctr;
       }
       this->insert(tmp_a);
       return ctr;
     }

template<class T >

const T& util::UniqueRangeSet< T >::End ( void ) const

inline

Very last "end" of all contained range.

Definition at line 55 of file UniqueRangeSet.h.

     {
       if(!(this->size())) throw std::runtime_error("Nothing in the set!");
       return (*(this->rbegin()))._window.second;
     }

template<class T >

UniqueRangeSet<T> util::UniqueRangeSet< T >::Exclusive	(	const T	start,
		const T	end
	)		const

inline

It takes two input arguments, "start" and "end", and returns util::UniqueRangeSet
of all exclusive regions between "start" and "end". By definition, merging this
return with the original instance will result in 1 huge util::Range.

Definition at line 66 of file UniqueRangeSet.h.

     {
       UniqueRangeSet<T> res;
 
       auto start_iter = std::lower_bound(this->begin(),this->end(),start);
       auto end_iter   = std::lower_bound(this->begin(),this->end(),end);
 
       // Anything to add to the head?
       if(start < (*start_iter)._window.first) res.emplace(start,(*start_iter)._window.first);
 
       auto iter = start_iter;
       T  tmp_end=end;
       while(iter != this->end()) {
         if(iter != start_iter)
           res.emplace(tmp_end,(*iter)._window.first);
         tmp_end   = (*iter)._window.second;
         if(iter == end_iter) break;
         ++iter;
       }
 
       // Anything to add to the tail?
       if(tmp_end < end)
         res.emplace(tmp_end,end);
 
       return res;
     }

template<class T >

size_t util::UniqueRangeSet< T >::insert ( const Range< T > & a )

inline

Modified insert that merges overlapping range. Return = # merged range.

Definition at line 113 of file UniqueRangeSet.h.

114 {return emplace(a._window.first,a._window.second);}

util::UniqueRangeSet::emplace

size_t emplace(const T &start, const T &end)

Modified emplace that merges overlapping range. Return = # merged range.

Definition: UniqueRangeSet.h:94

template<class T >

void util::UniqueRangeSet< T >::Merge ( const UniqueRangeSet< T > & in )

inline

Merge two UniqueRangeSet<T>

Definition at line 44 of file UniqueRangeSet.h.

45 { for(auto const& r : in) emplace(r._window.first,r._window.second); }

util::UniqueRangeSet::emplace

size_t emplace(const T &start, const T &end)

Modified emplace that merges overlapping range. Return = # merged range.

Definition: UniqueRangeSet.h:94

plot_model.r

r

Definition: plot_model.py:57

template<class T >

const T& util::UniqueRangeSet< T >::Start ( ) const

inline

Very first "start" of all contained range.

Definition at line 48 of file UniqueRangeSet.h.

     {
       if(!(this->size())) throw std::runtime_error("Nothing in the set!");
       return (*(this->begin()))._window.first;
     }

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

lardata/lardata/Utilities/Range.h
lardata/lardata/Utilities/UniqueRangeSet.h

Public Member Functions

Detailed Description

template<class T> class util::UniqueRangeSet< T >

Constructor & Destructor Documentation

Member Function Documentation

template<class T>
class util::UniqueRangeSet< T >