Class def header for a class Range. More...

#include <algorithm>
#include <functional>
#include <utility>

Classes
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. More...

class	util::Range< T >
	represents a "Range" w/ notion of ordering. A range is defined by a pair of "start" and "end" values. This is stored in std::pair attribute util::Range::_window. This attribute is protected so that the start/end cannot be changed w/o a check that start is always less than end. Note the specialization requires a template class T to have less operator implemented. More...

class	std::less< util::Range< T > * >

Namespaces
	util
	Namespace for general, non-LArSoft-specific utilities.

Detailed Description

Class def header for a class Range.

Definition in file Range.h.

Classes