#include <CombinatoricsOdometer.h>

Inheritance diagram for PairMeter:

Collaboration diagram for PairMeter:

Public Types
typedef typename DataVectorBase< FlexDigit >::Base	DataVector_BASE
typedef typename DataVectorBase< FlexDigit >::Base	DVL_BASE
typedef typename DataVectorBase< FlexDigit >::Base::PtrVector	PtrVector
	This is the type of the underlying `std::vector` (what `stdcont` returns).
typedef typename DataVectorBase< FlexDigit >::Base::PtrVector	BaseContainer
typedef FlexDigit *&	reference
typedef FlexDigit *const &	const_reference
typedef typename DataVectorBase< FlexDigit >::Base::size_type	size_type
typedef typename DataVectorBase< FlexDigit >::Base::difference_type	difference_type
typedef FlexDigit *	value_type
typedef typename DataVectorBase< FlexDigit >::Base::allocator_type	allocator_type
typedef FlexDigit **	pointer
typedef FlexDigit const	const_pointer
typedef const FlexDigit *	const_value_type
typedef FlexDigit	base_value_type
	The `T` value used as the template parameter.
typedef std::unique_ptr< base_value_type >	unique_type
	Type of a unique_ptr that can be used to insert elements into this container.
typedef DataModel_detail::ElementProxy< DataVector >	ElementProxy
	This type is used to proxy lvalue accesses to `DataVector` elements, in order to handle ownership.
typedef DataModel_detail::const_iterator< DataVector >	const_iterator
	Standard `const_iterator`.
typedef DataModel_detail::iterator< DataVector >	iterator
	Standard `iterator`.
typedef std::reverse_iterator< const_iterator >	const_reverse_iterator
	Standard `const_reverse_iterator`.
typedef std::reverse_iterator< iterator >	reverse_iterator
	Standard `reverse_iterator`.
typedef DataVector	base_data_vector
using	Deleter

Public Member Functions
	PairMeter (int numDigits)
virtual	~PairMeter ()
virtual bool	increment ()
std::vector< int >	getVector ()
std::pair< int, int >	getPair ()
bool	nextPair ()
bool	isUnique (bool doCheck)
bool	hasOnlySingleEntry (bool doCheck)
virtual void	push_back (FlexDigit *)
virtual void	print ()
bool	isZero ()
virtual FlexDigits &	operator++ (int)
bool	hasStarted ()
void	setStarted ()
Insertion operations.
value_type	push_back (value_type pElem)
	Add an element to the end of the collection.
size_type	push_new (size_type n, F alloc)
	Create and add a number of new elements to the end of the container.
value_type	emplace_back (value_type pElem)
	Add an element to the end of the collection.
iterator	insert (iterator position, value_type pElem)
	Add a new element to the collection.
iterator	emplace (iterator position, value_type pElem)
	Add a new element to the collection.
void	insertMove (iterator position, DataVector &other)
	Insert the contents of another `DataVector`, with auxiliary data copied via move semantics.
Constructors, destructors, assignment.
void	assign (InputIterator first, InputIterator last)
	Assign from iterators.
Size and capacity.
size_type	size () const noexcept
	Returns the number of elements in the collection.
void	resize (size_type sz)
	Resizes the collection to the specified number of elements.
void	reserve (size_type n)
	Attempt to preallocate enough memory for a specified number of elements.
Element access.
Change the vector capacity to match the current size. Note: this does not affect auxiliary data.
const FlexDigit *	operator[] (size_type n) const
	Access an element, as an rvalue.
const FlexDigit *	get (size_type n) const
	Access an element, as an rvalue.
const FlexDigit *	at (size_type n) const
	Access an element, as an rvalue.
const FlexDigit *	front () const
	Access the first element in the collection as an rvalue.
const FlexDigit *	back () const
	Access the last element in the collection as an rvalue.
Iterator creation.
const_iterator	begin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection.
const_iterator	end () const noexcept
	Return a `const_iterator` pointing past the end of the collection.
const_reverse_iterator	rbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection.
const_reverse_iterator	rend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection.
const_iterator	cbegin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection.
const_iterator	cend () const noexcept
	Return a `const_iterator` pointing past the end of the collection.
const_reverse_iterator	crbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection.
const_reverse_iterator	crend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection.
Erasure operations.
iterator	erase (iterator position)
	Remove element at a given position.
void	pop_back ()
	Remove the last element from the collection.
void	clear ()
	Erase all the elements in the collection.

Static Public Attributes
static const bool	has_virtual
	This is true for any `DataVector` class if we need to use virtual derivation to get to the base `DataVector` class.
static constexpr bool	must_own
	If true, then this type must own its contents.

Private Attributes
bool	m_onlyUnique
bool	m_onlySingleEntry
int	m_numLabels
OdoMeter *	m_pairMeter
std::map< std::string, std::set< int > >	m_digitAssoc
std::set< std::string >	m_labels
bool	m_started

Swap and sort.
void	swap (DataVector &rhs)
	Swap this collection with another.
void	sort ()
	Sort the container.
static void	iter_swap (iterator a, iterator b)
	Swap the referents of two `DataVector` iterators.

Non-standard operations.
void	swapElement (size_type index, value_type newElem, reference oldElem)
	Swap one element out of the container.
virtual const DataModel_detail::DVLInfoBase &	dvlinfo_v () const override
	Return the DV/DL info struct for this class.
const SG::AuxVectorBase &	auxbase () const
	Convert to `AuxVectorBase`.
size_type	max_size () const noexcept
	Returns the `size()` of the largest possible collection.
size_type	capacity () const noexcept
	Returns the total number of elements that the collection can hold before needing to allocate more memory.
bool	empty () const noexcept
	Returns `true` if the collection is empty.
void	shrink_to_fit ()
const PtrVector &	stdcont () const
	Return the underlying `std::vector` of the container.
SG::OwnershipPolicy	ownPolicy () const
	Return the ownership policy setting for this container.
static const DataModel_detail::DVLInfoBase &	dvlinfo ()
	Return the DV/DL info struct for this class.
static int	baseOffset (const std::type_info &ti)
	Return the offset of a base `DataVector` class.

Internal operations.
void	resortAux (iterator beg, iterator end)
	Reset indices / reorder aux data after elements have been permuted.
void	testInsert (const char *op)
	Test if we can insert; raise an exception if not.
void	testInsertOol (const char *op)
	Test if we can insert; raise an exception if not.
SG::IsMostDerivedFlag	m_isMostDerived
	This flag is true if this DV instance is the most-derived one.
typedef ROOT::Meta::Selection::DataVector< FlexDigit, DataVector_BASE >::self	self
static int	baseOffset1 (const char *p, const DataVector &dv, const std::type_info &ti)
	Helper for `baseOffset`.
static const FlexDigit *	do_cast (const typename PtrVector::value_type p)
	Helper to shorten calls to `DataModel_detail::DVLCast`.
static FlexDigit *	do_cast_nc (typename PtrVector::value_type p)
	Helper to shorten calls to `DataModel_detail::DVLCast`.
void	assignElement (typename BaseContainer::iterator pos, value_type newElem)
	Handle element assignment.
void	assignBaseElement (typename BaseContainer::iterator pos, typename BaseContainer::value_type newElem)
	Handle element assignment from a base pointer.
void	shift (size_t pos, ptrdiff_t offs)
	Shift the auxiliary elements of the container.
virtual const std::type_info &	dv_typeid () const override
	Find the most-derived `DataVector` class in the hierarchy.
void	clearMostDerived ()
	Clear `m_isMostDerived` for this instance and for all bases.
virtual void	setMostDerived () override
	Set `m_isMostDerived` for this instance and clear it for all bases.

Detailed Description

Definition at line 133 of file CombinatoricsOdometer.h.

Member Typedef Documentation

◆ allocator_type

typedef typename DataVectorBase<FlexDigit>::Base::allocator_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::allocator_type

inherited

Definition at line 817 of file DataVector.h.

◆ base_data_vector

typedef DataVector DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::base_data_vector

inherited

Definition at line 854 of file DataVector.h.

◆ base_value_type

typedef FlexDigit DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::base_value_type

inherited

The T value used as the template parameter.

Note that this is different from value_type (that's T*).

Definition at line 825 of file DataVector.h.

◆ BaseContainer

typedef typename DataVectorBase<FlexDigit>::Base::PtrVector DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::BaseContainer

inherited

Definition at line 807 of file DataVector.h.

◆ const_iterator

typedef DataModel_detail::const_iterator<DataVector> DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::const_iterator

inherited

Standard const_iterator.

Definition at line 838 of file DataVector.h.

◆ const_pointer

typedef FlexDigit* const* DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::const_pointer

inherited

Definition at line 819 of file DataVector.h.

◆ const_reference

typedef FlexDigit* const& DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::const_reference

inherited

Definition at line 813 of file DataVector.h.

◆ const_reverse_iterator

typedef std::reverse_iterator<const_iterator> DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::const_reverse_iterator

inherited

Standard const_reverse_iterator.

Definition at line 847 of file DataVector.h.

◆ const_value_type

typedef const FlexDigit* DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::const_value_type

inherited

Definition at line 821 of file DataVector.h.

◆ DataVector_BASE

typedef typename DataVectorBase<FlexDigit>::Base DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::DataVector_BASE

inherited

Definition at line 797 of file DataVector.h.

◆ Deleter

using DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::Deleter

inherited

Definition at line 857 of file DataVector.h.

◆ difference_type

typedef typename DataVectorBase<FlexDigit>::Base::difference_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::difference_type

inherited

Definition at line 815 of file DataVector.h.

◆ DVL_BASE

typedef typename DataVectorBase<FlexDigit>::Base DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::DVL_BASE

inherited

Definition at line 798 of file DataVector.h.

◆ ElementProxy

typedef DataModel_detail::ElementProxy<DataVector> DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::ElementProxy

inherited

This type is used to proxy lvalue accesses to DataVector elements, in order to handle ownership.

Definition at line 833 of file DataVector.h.

◆ iterator

typedef DataModel_detail::iterator<DataVector> DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::iterator

inherited

Standard iterator.

Note that lvalue references here will yield an ElementProxy, not a reference.

Definition at line 842 of file DataVector.h.

◆ pointer

typedef FlexDigit** DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::pointer

inherited

Definition at line 818 of file DataVector.h.

◆ PtrVector

typedef typename DataVectorBase<FlexDigit>::Base::PtrVector DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::PtrVector

inherited

This is the type of the underlying std::vector (what stdcont returns).

Definition at line 806 of file DataVector.h.

◆ reference

typedef FlexDigit*& DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::reference

inherited

Definition at line 812 of file DataVector.h.

◆ reverse_iterator

typedef std::reverse_iterator<iterator> DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::reverse_iterator

inherited

Standard reverse_iterator.

Note that lvalue references here will yield an ElementProxy, not a reference.

Definition at line 852 of file DataVector.h.

◆ self

typedef ROOT::Meta::Selection::DataVector<FlexDigit,DataVector_BASE>::self DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::self

privateinherited

Definition at line 2063 of file DataVector.h.

◆ size_type

typedef typename DataVectorBase<FlexDigit>::Base::size_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::size_type

inherited

Definition at line 814 of file DataVector.h.

◆ unique_type

typedef std::unique_ptr<base_value_type> DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::unique_type

inherited

Type of a unique_ptr that can be used to insert elements into this container.

Definition at line 829 of file DataVector.h.

◆ value_type

typedef FlexDigit* DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::value_type

inherited

Definition at line 816 of file DataVector.h.

Constructor & Destructor Documentation

◆ PairMeter()

PairMeter::PairMeter ( int numDigits )

Definition at line 321 of file CombinatoricsOdometer.cxx.

  :OdoMeter( 2, digitMax )
{ 
}

◆ ~PairMeter()

PairMeter::~PairMeter ( )

virtual

Definition at line 327 of file CombinatoricsOdometer.cxx.

328{

329}

Member Function Documentation

◆ assign()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::assign	(	InputIterator	first,
		InputIterator	last )

inherited

Assign from iterators.

Parameters

first	The start of the range to put in the container.
last	The end of the range to put in the container.

Any existing owned elements will be released. The DataVector's ownership policy determines whether it will take ownership of the new elements.

◆ assignBaseElement()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::assignBaseElement	(	typename BaseContainer::iterator	pos,
		typename BaseContainer::value_type	newElem )

privateinherited

Handle element assignment from a base pointer.

Parameters

pos	Position in the container to assign.
newElem	The new element to assign.

The old element is freed if this container owns elements. Auxiliary data are copied if appropriate.

◆ assignElement()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::assignElement	(	typename BaseContainer::iterator	pos,
		value_type	newElem )

privateinherited

Handle element assignment.

Parameters

pos	Position in the container to assign.
newElem	The new element to assign.

The old element is freed if this container owns elements. Auxiliary data are copied if appropriate.

◆ at()

const FlexDigit * DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::at ( size_type n ) const

inherited

Access an element, as an rvalue.

Parameters

n	Array index to access.

Returns: The element at n.

Will raise std::out_of_range if the index is out-of-bounds. Note that we return a const T* rather than a reference.

◆ auxbase()

const SG::AuxVectorBase & DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::auxbase ( ) const

inherited

Convert to AuxVectorBase.

Needed to get AuxVectorBase from a ConstDataVector. Present in DataVector as well for consistency. We only really need it in the base class; however, root6 fails constructing a TMethodCall for this if there is virtual derivation. A workaround is to redeclare this in the derived classes too.

◆ back()

const FlexDigit * DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::back ( ) const

inherited

Access the last element in the collection as an rvalue.

Returns: The last element in the collection.

No checking is done to ensure that the container is not empty. Note that we return a const T* rather than a reference.

◆ baseOffset()

int DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::baseOffset ( const std::type_info & ti )

staticinherited

Return the offset of a base DataVector class.

Parameters

ti	`std::type_info` of the desired class.

If ti represents a DataVector base class of this one, then return the offset of that base class. Otherwise, return -1.

This function is here due to limitations of root 6, which can't calculate these offsets correctly from the dictionary if virtual derivation is used.

◆ baseOffset1()

int DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::baseOffset1	(	const char *	p,
		const DataVector< FlexDigit > &	dv,
		const std::type_info &	ti )

staticinherited

Helper for baseOffset.

Parameters

p	Pointer to the start of the top-level object.
dv	Reference to the DataVector object.
ti	`std::type_info` of the desired class.

If ti represents a DataVector base class of this one, then return the offset of that base class. Otherwise, return -1.

◆ begin()

const_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::begin ( ) const

noexceptinherited

Return a const_iterator pointing at the beginning of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ capacity()

size_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::capacity ( ) const

noexceptinherited

Returns the total number of elements that the collection can hold before needing to allocate more memory.

◆ cbegin()

const_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::cbegin ( ) const

noexceptinherited

Return a const_iterator pointing at the beginning of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ cend()

const_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::cend ( ) const

noexceptinherited

Return a const_iterator pointing past the end of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ clear()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::clear ( )

inherited

Erase all the elements in the collection.

Erase all the elements in the collection, and reset the ownership mode.

If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this.

Parameters

ownPolicy	The new ownership policy of the container.
trackIndices	The index tracking policy.

If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this.

◆ clearMostDerived()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::clearMostDerived ( )

protectedinherited

Clear m_isMostDerived for this instance and for all bases.

Called from the constructor after setting m_isMostDerived.

◆ crbegin()

const_reverse_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::crbegin ( ) const

noexceptinherited

Return a const_reverse_iterator pointing past the end of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ crend()

const_reverse_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::crend ( ) const

noexceptinherited

Return a const_reverse_iterator pointing at the beginning of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ do_cast()

const FlexDigit * DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::do_cast ( const typename PtrVector::value_type p )

staticinherited

Helper to shorten calls to DataModel_detail::DVLCast.

Parameters

p	The value to convert.

Returns: The value as a const T*.

The conversion will be done with static_cast if possible, with dynamic_cast otherwise.

◆ do_cast_nc()

FlexDigit * DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::do_cast_nc ( typename PtrVector::value_type p )

staticinherited

Helper to shorten calls to DataModel_detail::DVLCast.

Parameters

p	The value to convert.

Returns: The value as a T*.

The conversion will be done with static_cast if possible, with dynamic_cast otherwise.

◆ dv_typeid()

virtual const std::type_info & DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::dv_typeid ( ) const

overrideprivatevirtualinherited

Find the most-derived DataVector class in the hierarchy.

Returns: The type_info for the class for which this method gets run.

This is used to generate a nice error message when the most-derived check for insertions fails. Every DataVector defines this virtual method, so when it's called, the one corresponding to the most-derived DataVector gets run.

◆ dvlinfo()

const DataModel_detail::DVLInfoBase & DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::dvlinfo ( )

staticinherited

Return the DV/DL info struct for this class.

This can be used to make sure that it's instantiated.

◆ dvlinfo_v()

virtual const DataModel_detail::DVLInfoBase & DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::dvlinfo_v ( ) const

overridevirtualinherited

Return the DV/DL info struct for this class.

This can be used to make sure that it's instantiated.

◆ emplace()

iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::emplace	(	iterator	position,
		value_type	pElem )

inherited

Add a new element to the collection.

Parameters

position	Iterator before which the element will be added.
pElem	The element to add to the collection.

Returns: An iterator that points to the inserted data.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

For DataVector, this is just the same as insert. It's included just for interface compatibility with std::vector.

◆ emplace_back()

value_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::emplace_back ( value_type pElem )

inherited

Add an element to the end of the collection.

Parameters

pElem The element to add to the collection.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

For DataVector, this is like the same as push_back, and it returns the pushed element. It's included just for interface compatibility with std::vector.

◆ empty()

bool DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::empty ( ) const

nodiscardnoexceptinherited

Returns true if the collection is empty.

◆ end()

const_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::end ( ) const

noexceptinherited

Return a const_iterator pointing past the end of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ erase()

iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::erase ( iterator position )

inherited

Remove element at a given position.

Parameters

position Iterator pointing to the element to be removed.

Returns: An iterator pointing to the next element (or end()).

If the container owns its elements, then the pointed-to element will be deleted.

◆ front()

const FlexDigit * DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::front ( ) const

inherited

Access the first element in the collection as an rvalue.

Returns: The first element in the collection.

No checking is done to ensure that the container is not empty. Note that we return a const T* rather than a reference.

◆ get()

const FlexDigit * DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::get ( size_type n ) const

inherited

Access an element, as an rvalue.

Parameters

n	Array index to access.

Returns: The element at n.

This is a synonym for operator[] const, to be used when calling from root (where we can't readily call just the const version of a method).

◆ getPair()

std::pair< int, int > OdoMeter::getPair ( )

inherited

Definition at line 307 of file CombinatoricsOdometer.cxx.

{
  if(m_pairMeter)
    {
      return std::make_pair( (*m_pairMeter)[0]->digit(), (*m_pairMeter)[1]->digit() );
    }
  else
    {
      return std::make_pair( 0,0 );
    }
}

◆ getVector()

std::vector< int > OdoMeter::getVector ( )

inherited

Definition at line 276 of file CombinatoricsOdometer.cxx.

{
  std::vector<int> digitsVector;
  for (const FlexDigit* digit : *this)
    {
      digitsVector.push_back(digit->digit());
    }
  return digitsVector;
}

◆ hasOnlySingleEntry()

bool OdoMeter::hasOnlySingleEntry ( bool doCheck )

inherited

Definition at line 218 of file CombinatoricsOdometer.cxx.

{
  if(!doCheck)
    {
      return true;
    }
  for (const std::string& label : m_labels)
    {
      std::set<int> digitsForLabel;
      for (int digit : m_digitAssoc[label])
        {
          digitsForLabel.insert((*this)[digit]->digit()); 
        }
      if (digitsForLabel.size()!=m_digitAssoc[label].size())
        {
          return false;
        }
    }
  return true;
}

◆ hasStarted()

bool FlexDigits::hasStarted ( )

inlineinherited

Definition at line 107 of file CombinatoricsOdometer.h.

107{ return m_started; }

FlexDigits::m_started

bool m_started

Definition CombinatoricsOdometer.h:104

◆ increment()

bool PairMeter::increment ( )

virtual

Reimplemented from OdoMeter.

Definition at line 332 of file CombinatoricsOdometer.cxx.

{
  if(this->hasStarted() && this->isZero())
    { 
      return false;
    }
  else if(!this->hasStarted())
    {
      this->setStarted() ;
    }
  (*this)++;
  bool found = true;
  if(!isUnique(true))
    {
      found=false;
    }
  if(!hasOnlySingleEntry(true))
    {
      found=false;
    }
  if(!found)
    {
      return this->increment();
    }
  else
    {
      return true;
    }
}

◆ insert()

iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::insert	(	iterator	position,
		value_type	pElem )

inherited

Add a new element to the collection.

Parameters

position	Iterator before which the element will be added.
pElem	The element to add to the collection.

Returns: An iterator that points to the inserted data.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ insertMove()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::insertMove	(	iterator	position,
		DataVector< FlexDigit > &	other )

inherited

Insert the contents of another DataVector, with auxiliary data copied via move semantics.

Parameters

position	Iterator before which the new elements will be added.
other	The vector to add.

The ownership mode of this vector must be the same as other; otherwise, an exception will be thrown.

If both vectors are view vectors, then this is the same as insert (position, other.begin(), other.end()) .

Otherwise, the elements from other will be inserted into this vector. This vector will take ownership of the elements, and the ownership mode of other will be changed to VIEW_ELEMENTS. Auxiliary data for these elements will be transferred, using move semantics if possible. (Thus, the auxiliary store for other may be modified and must not be locked.) Finally, the auxiliary store pointer for other will be cleared (but the store itself will not be deleted since it's not owned by the vector).

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ isUnique()

bool OdoMeter::isUnique ( bool doCheck )

inherited

Definition at line 191 of file CombinatoricsOdometer.cxx.

{
  if(!doCheck)
    {
      return true;
    }
  for (const std::string& label : m_labels)
    {
      int leftDigit = -1;
      for (int digit : m_digitAssoc[label])
        {
          if(leftDigit <= (*this)[digit]->digit())
            {
              leftDigit=(*this)[digit]->digit();  
            }
          else
            {
              return false;
            }
        }
    } 
  return true;
}

◆ isZero()

bool FlexDigits::isZero ( )

inherited

Definition at line 122 of file CombinatoricsOdometer.cxx.

{
  bool isZero=true;
  for (const FlexDigit* digit : *this)
    {
      isZero = isZero && !digit->digit();
    } 
  return isZero;
}

◆ iter_swap()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::iter_swap	(	iterator	a,
		iterator	b )

staticinherited

Swap the referents of two DataVector iterators.

Parameters

a	The first iterator for the swap.
b	The second iterator for the swap.

◆ max_size()

size_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::max_size ( ) const

noexceptinherited

Returns the size() of the largest possible collection.

◆ nextPair()

bool OdoMeter::nextPair ( )

inherited

Definition at line 288 of file CombinatoricsOdometer.cxx.

{
  if(m_pairMeter)
    {
      if( m_pairMeter->increment())
        {
          return true; 
        }
      else
        {
          delete m_pairMeter;
          m_pairMeter = NULL;
        }
    }
  return false;
}

◆ operator++()

FlexDigits & FlexDigits::operator++ ( int )

virtualinherited

Definition at line 134 of file CombinatoricsOdometer.cxx.

{
  if( this->size() )
    {
      (*(this->back()))++;
    }
  return *this; 
}

◆ operator[]()

const FlexDigit * DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::operator[] ( size_type n ) const

inherited

Access an element, as an rvalue.

Parameters

n	Array index to access.

Returns: The element at n.

No bounds checking is done. Note that we return a const T* rather than a reference.

◆ ownPolicy()

SG::OwnershipPolicy DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::ownPolicy ( ) const

inherited

Return the ownership policy setting for this container.

◆ pop_back()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::pop_back ( )

inherited

Remove the last element from the collection.

If the container owns its elements, then the removed element will be deleted.

◆ print()

void FlexDigits::print ( )

virtualinherited

Definition at line 110 of file CombinatoricsOdometer.cxx.

{
  std::cout<<"current State of digits: ";
  for (const FlexDigit* digit : *this)
    {
      std::cout<<"|"<<digit->digit()<<"|";
    }
  std::cout<<std::endl;
}

◆ push_back() [1/2]

value_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::push_back ( value_type pElem )

inherited

Add an element to the end of the collection.

Parameters

pElem The element to add to the collection.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

Returns the pushed pointer.

◆ push_back() [2/2]

void FlexDigits::push_back ( FlexDigit * aDigit )

virtualinherited

Definition at line 84 of file CombinatoricsOdometer.cxx.

{
  if(this->size())
    {
      aDigit->setNext(this->back());
    }
  this->DataVector<FlexDigit>::push_back(aDigit);
}

◆ push_new()

size_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::push_new	(	size_type	n,
		F	alloc )

inherited

Create and add a number of new elements to the end of the container.

Parameters

n	The number of new elements to add.
alloc	Functional to call to allocate a new element to push. Should be callable like `T* = alloc();` For example: dv.push_new (n, [](){ return new Foo; }); Foo Definition FooBar.h:9 It may also be useful to allocate from a `DataPool`.

Note: this method may only be called using the most derived DataVector in the hierarchy.

Returns the original size of the vector.

◆ rbegin()

const_reverse_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::rbegin ( ) const

noexceptinherited

Return a const_reverse_iterator pointing past the end of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ rend()

const_reverse_iterator DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::rend ( ) const

noexceptinherited

Return a const_reverse_iterator pointing at the beginning of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ reserve()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::reserve ( size_type n )

inherited

Attempt to preallocate enough memory for a specified number of elements.

Parameters

n	Number of elements required.

◆ resize()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::resize ( size_type sz )

inherited

Resizes the collection to the specified number of elements.

Parameters

sz	The new size of the collection.

Note that this function differs from the standard in that it does not allow specifying the value of any inserted elements. They will always be 0.

If the container is shrunk, elements will be deleted as with erase().

◆ resortAux()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::resortAux	(	iterator	beg,
		iterator	end )

inherited

Reset indices / reorder aux data after elements have been permuted.

Parameters

beg	Start of the range of elements to process.
end	End of the range of elements to process.

Call this after some operation that has permuted the elements in the container (such as sort). The index information in the elements will be used to permute all auxiliary data in the same way. Finally, all the indices will be reset in the correct order.

◆ setMostDerived()

virtual void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::setMostDerived ( )

overrideprotectedvirtualinherited

Set m_isMostDerived for this instance and clear it for all bases.

Called from testInsert if the test fails. The flag may not have been set if this container was made via copy construction, so set it appropriately now so we can test again.

◆ setStarted()

void FlexDigits::setStarted ( )

inlineinherited

Definition at line 108 of file CombinatoricsOdometer.h.

108{ m_started = true; }

◆ shift()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::shift	(	size_t	pos,
		ptrdiff_t	offs )

privateinherited

Shift the auxiliary elements of the container.

Parameters

pos	The starting index for the shift.
offs	The (signed) amount of the shift.

The elements in the container should have already been shifted; this operation will then adjust the element indices and also shift the elements in the vectors for all aux data items. offs may be either positive or negative.

If offs is positive, then the container is growing. The container size should be increased by offs, the element at pos moved to pos + offs, and similarly for following elements. The elements between pos and pos + offs should be default-initialized.

If offs is negative, then the container is shrinking. The element at pos should be moved to pos + offs, and similarly for following elements. The container should then be shrunk by -offs elements (running destructors as appropriate).

◆ shrink_to_fit()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::shrink_to_fit ( )

inherited

◆ size()

size_type DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::size ( ) const

noexceptinherited

Returns the number of elements in the collection.

Could in principle be inherited from the base class, but redeclared in the derived class to avoid root6 bugs.

◆ sort()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::sort ( )

inherited

Sort the container.

This just sorts by pointer value, so it's probably not very useful.

◆ stdcont()

const PtrVector & DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::stdcont ( ) const

inherited

Return the underlying std::vector of the container.

Returns: Reference to the std::vector actually holding the collection.

Note that DataVector<T>::stdcont does not necessarily return a std::vector<T*> if DataVector inheritance is being used.

◆ swap()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::swap ( DataVector< FlexDigit > & rhs )

inherited

Swap this collection with another.

Parameters

rhs	The collection with which to swap.

Ownership is swapped along with the collection content.

Note: this method may only be called using the most-derived DataVector in the hierarchy. The rhs must also be referenced using the most-derived DataVector.

◆ swapElement()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::swapElement	(	size_type	index,
		value_type	newElem,
		reference	oldElem )

inherited

Swap one element out of the container.

Parameters

index	Index of the element in the container to swap.
newElem	New element to put in the container. May be 0.
oldElem	Reference to receive the element removed from the container.

Reference oldElem is initialized with element index of the collection (no bounds checking). Then element index is set to newElem. If the collection owns its elements, then it will take ownership of newElem and release (without deleting) the element returned through oldElem.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ testInsert()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::testInsert ( const char * op )

inherited

Test if we can insert; raise an exception if not.

Parameters

op	Description of the attempted operation.

In order to maintain type-safety, we can only allow insertions using the most-derived instance of DataVector. This checks this by testing the m_isMostDerived, which is set by the constructors to true only for the most-derived instance. If the test fails, we call to potentially out-of-line code to continue.

◆ testInsertOol()

void DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::testInsertOol ( const char * op )

inherited

Test if we can insert; raise an exception if not.

Parameters

op	Description of the attempted operation.

This continues the test of testInsert. There is one case where m_isMostDerived may not be set correctly. If this container was made via copy construction, then all the m_isMostDerived flags will be false. So we call setMostDerived to set the flags correctly and test again. If the test fails again, then we raise an exception.

Member Data Documentation

◆ has_virtual

const bool DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::has_virtual

staticinherited

This is true for any DataVector class if we need to use virtual derivation to get to the base DataVector class.

Definition at line 802 of file DataVector.h.

◆ m_digitAssoc

std::map<std::string, std::set<int> > OdoMeter::m_digitAssoc

privateinherited

Definition at line 128 of file CombinatoricsOdometer.h.

◆ m_isMostDerived

SG::IsMostDerivedFlag DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::m_isMostDerived

privateinherited

This flag is true if this DV instance is the most-derived one.

We set this to true in the top-level constructor; the constructor then calls clearMostDerived on the base classes.

Definition at line 2059 of file DataVector.h.

◆ m_labels

std::set<std::string> OdoMeter::m_labels

privateinherited

Definition at line 129 of file CombinatoricsOdometer.h.

◆ m_numLabels

int OdoMeter::m_numLabels

privateinherited

Definition at line 126 of file CombinatoricsOdometer.h.

◆ m_onlySingleEntry

bool OdoMeter::m_onlySingleEntry

privateinherited

Definition at line 125 of file CombinatoricsOdometer.h.

◆ m_onlyUnique

bool OdoMeter::m_onlyUnique

privateinherited

Definition at line 124 of file CombinatoricsOdometer.h.

◆ m_pairMeter

OdoMeter* OdoMeter::m_pairMeter

privateinherited

Definition at line 127 of file CombinatoricsOdometer.h.

◆ m_started

bool FlexDigits::m_started

privateinherited

Definition at line 104 of file CombinatoricsOdometer.h.

◆ must_own

bool DataVector< FlexDigit, typename DataVectorBase<FlexDigit>::Base >::must_own

staticconstexprinherited

If true, then this type must own its contents.

Definition at line 860 of file DataVector.h.

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

Public Types

Public Member Functions

Static Public Attributes

Private Attributes

Swap and sort.

Non-standard operations.

Internal operations.

Detailed Description

Member Typedef Documentation

◆ allocator_type

◆ base_data_vector

◆ base_value_type

◆ BaseContainer

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ const_value_type

◆ DataVector_BASE

◆ Deleter

◆ difference_type

◆ DVL_BASE

◆ ElementProxy

◆ iterator

◆ pointer

◆ PtrVector

◆ reference

◆ reverse_iterator

◆ self

◆ size_type

◆ unique_type

◆ value_type

Constructor & Destructor Documentation

◆ PairMeter()

◆ ~PairMeter()

Member Function Documentation

◆ assign()

◆ assignBaseElement()

◆ assignElement()

◆ at()

◆ auxbase()

◆ back()

◆ baseOffset()

◆ baseOffset1()

◆ begin()

◆ capacity()

◆ cbegin()

◆ cend()

◆ clear()

◆ clearMostDerived()

◆ crbegin()

◆ crend()

◆ do_cast()

◆ do_cast_nc()

◆ dv_typeid()

◆ dvlinfo()

◆ dvlinfo_v()

◆ emplace()

◆ emplace_back()

◆ empty()

◆ end()

◆ erase()

◆ front()

◆ get()

◆ getPair()

◆ getVector()

◆ hasOnlySingleEntry()

◆ hasStarted()

◆ increment()

◆ insert()

◆ insertMove()

◆ isUnique()

◆ isZero()

◆ iter_swap()

◆ max_size()

◆ nextPair()

◆ operator++()

◆ operator[]()

◆ ownPolicy()

◆ pop_back()