Range::identifier_factory Class Reference

This factory is able to generate all possible identifiers, from a
fully bounded Range. More...

#include <Range.h>

Collaboration diagram for Range::identifier_factory:

Public Member Functions
	identifier_factory ()
	identifier_factory (const Range &range)
	identifier_factory (const identifier_factory &)=default
identifier_factory &	operator= (const identifier_factory &other)
identifier_factory &	operator= (identifier_factory &&other)
void	operator++ ()
const ExpandedIdentifier &	operator* () const
bool	operator== (const identifier_factory &other) const
bool	operator!= (const identifier_factory &other) const

Private Attributes
std::vector< size_type >	m_indices
ExpandedIdentifier	m_id
ExpandedIdentifier	m_min
ExpandedIdentifier	m_max
const Range *	m_range

Detailed Description

This factory is able to generate all possible identifiers, from a
fully bounded Range.

The precondition is that the Range used to parameterize the factory
must have all its fields completely bounded.

Definition at line 166 of file DetectorDescription/Identifier/Identifier/Range.h.

Constructor & Destructor Documentation

identifier_factory() [1/3]

Range::identifier_factory::identifier_factory

(

)

Definition at line 1746 of file DetectorDescription/Identifier/src/Range.cxx.

                                             : m_range (nullptr) 
{ 
} 

identifier_factory() [2/3]

Range::identifier_factory::identifier_factory

(

const Range &

range

)

Fill all running identifiers m_id : the current id m_min : the set of low bounds m_max : the set of high bounds

Definition at line 1751 of file DetectorDescription/Identifier/src/Range.cxx.

                                                               : m_range (&range) 
{ 
  for (Range::size_type i = 0; i < range.fields (); ++i) 
    { 
      element_type minimum; 
      element_type maximum; 
 
      m_indices.push_back (0); 
 
      const field& f = range[i]; 
 
      switch (f.get_mode ()) 
        { 
        case Range::field::unbounded: 
          m_id << 0; 
          m_min << 0; 
          m_max << 0; 
          break; 
        case Range::field::low_bounded: 
          minimum = f.get_minimum (); 
          m_id << minimum; 
          m_min << minimum; 
          m_max << minimum; 
          break; 
        case Range::field::high_bounded: 
          maximum = f.get_maximum (); 
          m_id << maximum; 
          m_min << maximum; 
          m_max << maximum; 
          break; 
        case Range::field::both_bounded: 
        case Range::field::enumerated: 
          minimum = f.get_minimum (); 
          maximum = f.get_maximum (); 
          m_id << minimum; 
          m_min << minimum; 
          m_max << maximum; 
          break; 
        } 
    } 
} 

identifier_factory() [3/3]

Range::identifier_factory::identifier_factory ( const identifier_factory &  )

default

Member Function Documentation

operator!=()

bool Range::identifier_factory::operator!=

(

const identifier_factory &

other

)

const

Definition at line 1920 of file DetectorDescription/Identifier/src/Range.cxx.

{ 
  if (m_id != other.m_id) return (true); 
  return (false); 
} 

operator*()

const ExpandedIdentifier & Range::identifier_factory::operator*

(

)

const

Definition at line 1907 of file DetectorDescription/Identifier/src/Range.cxx.

{ 
  return (m_id); 
} 

operator++()

void Range::identifier_factory::operator++

(

)

The local range is not exceeded. increase the value then reset the remaining fields.

The current range field was exhausted check the previous one.

Definition at line 1828 of file DetectorDescription/Identifier/src/Range.cxx.

{ 
  if (m_id.fields () == 0) return; 
 
  size_type fields = m_id.fields (); 
  size_type i = fields - 1; 
 
    // 
    // Starting from the end, we try to increment the m_id fields 
    // If at a given position it's not possible (max reached) 
    // then we move back one pos and try again. 
    // 
    //  As soon as increment is possible, then the rest of the m_id 
    // is reset to min values. 
    // 
 
  for (;;) 
    { 
      const field& f = (*m_range)[i]; 
      bool done = false; 
      element_type value = 0; 
 
      if (f.get_mode () == Range::field::enumerated) 
        { 
          Range::size_type index = m_indices[i]; 
          index++; 
          if (index < f.get_indices ()) 
            { 
              m_indices[i] = index; 
              value = f.get_value_at (index); 
              done = true; 
            } 
        } 
      else 
        { 
          value = m_id[i]; 
 
          if (value < m_max[i]) 
            { 
              ++value; 
              done = true; 
            } 
        } 
 
      if (done) 
        { 
          m_id[i] = value; 
           
          for (++i; i < fields; ++i) 
            { 
              m_indices[i] = 0; 
              m_id[i] = m_min[i]; 
            } 
           
          break; 
        } 
 
      if (i == 0)  
        { 
          m_id.clear (); 
          break; 
        } 
      
        
          --i; 
        
    } 
} 

operator=() [1/2]

Range::identifier_factory & Range::identifier_factory::operator=

(

const identifier_factory &

other

)

Definition at line 1800 of file DetectorDescription/Identifier/src/Range.cxx.

{ 
  if (&other != this) {
    m_indices = other.m_indices; 
    m_id      = other.m_id; 
    m_min     = other.m_min; 
    m_max     = other.m_max; 
    m_range   = other.m_range; 
  }
 
  return (*this); 
} 

operator=() [2/2]

Range::identifier_factory & Range::identifier_factory::operator=

(

identifier_factory &&

other

)

Definition at line 1814 of file DetectorDescription/Identifier/src/Range.cxx.

{ 
  if (&other != this) {
    m_indices = std::move(other.m_indices);
    m_id      = std::move(other.m_id);
    m_min     = std::move(other.m_min);
    m_max     = std::move(other.m_max);
    m_range   = other.m_range; 
  }
 
  return (*this); 
} 

operator==()

bool Range::identifier_factory::operator==

(

const identifier_factory &

other

)

const

Definition at line 1913 of file DetectorDescription/Identifier/src/Range.cxx.

{ 
  if (m_id == other.m_id) return (true); 
  return (false); 
} 

Member Data Documentation

m_id

ExpandedIdentifier Range::identifier_factory::m_id

private

Definition at line 184 of file DetectorDescription/Identifier/Identifier/Range.h.

m_indices

std::vector<size_type> Range::identifier_factory::m_indices

private

Definition at line 183 of file DetectorDescription/Identifier/Identifier/Range.h.

m_max

ExpandedIdentifier Range::identifier_factory::m_max

private

Definition at line 186 of file DetectorDescription/Identifier/Identifier/Range.h.

m_min

ExpandedIdentifier Range::identifier_factory::m_min

private

Definition at line 185 of file DetectorDescription/Identifier/Identifier/Range.h.

m_range

const Range* Range::identifier_factory::m_range

private

Definition at line 187 of file DetectorDescription/Identifier/Identifier/Range.h.

---

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

• DetectorDescription/Identifier/Identifier/Range.h
• DetectorDescription/Identifier/src/Range.cxx