#include <StrawStatusContainer.h>
Definition at line 61 of file StrawStatusContainer.h.
◆ const_value_type
◆ DaughterContainer
◆ FlatContainer
fill vector with all entries in the container. needed to dump to Peter's flat file format
Definition at line 346 of file NestedContainer.h.
◆ trait_type
◆ value_type
◆ clear() [1/2]
◆ clear() [2/2]
clear only entries specified
Definition at line 246 of file NestedContainer.h.
249 unsigned int thisindex =
id.index(NestingLevel+1) ;
◆ crunch()
reduce the footprint as much as possible by removing the extra space allocated by the vectors
Definition at line 292 of file NestedContainer.h.
295 NestedContainerDaughterAccessor<Daughter,T,Trait>::crunch(*
it) ;
299 size_t firstvaliddaughter(0);
300 bool allequal(
true) ;
301 for(
size_t idau=0; idau<
m_daughters.size() && allequal; ++idau) {
302 allequal = NestedContainerDaughterAccessor<Daughter,T,Trait>::empty(
m_daughters[idau]) ;
306 if( firstvaliddaughter==0 ) firstvaliddaughter = idau ;
308 allequal = NestedContainerDaughterAccessor<Daughter,T,Trait>::isequal(
m_daughters[idau],
m_daughters[firstvaliddaughter]) ;
◆ daughters()
◆ footprint()
return the memory allocated by the container and its daughters
Definition at line 282 of file NestedContainer.h.
285 total += NestedContainerDaughterAccessor<Daughter,T,Trait>::footprint(*
it) ;
◆ get() [1/3]
◆ get() [2/3]
get a value.
return the default value if no valid entry for id exists.
Definition at line 205 of file NestedContainer.h.
206 if( NestingLevel <
id.
level() ) {
207 unsigned int thisindex =
id.index(NestingLevel+1) ;
211 if( Trait::isvalid(rc) )
return rc ;
◆ get() [3/3]
Definition at line 217 of file NestedContainer.h.
219 if( NestingLevel <
id.
level() ) {
220 unsigned int thisindex =
id.index(NestingLevel+1) ;
223 if( Trait::isvalid(rc) )
return rc ;
226 resolvelevel = NestingLevel ;
◆ getall()
Definition at line 347 of file NestedContainer.h.
349 for(
unsigned int idau = 0; idau<
m_daughters.size(); ++idau) {
352 NestedContainerDaughterAccessor<Daughter,T,Trait>::getall(
m_daughters[idau], dauentries) ;
354 for(
unsigned int j=0; j< dauentries.size(); ++j )
355 dauentries[j].
first.index(NestingLevel+1) = idau ;
357 entries.insert(
entries.end(),dauentries.begin(),dauentries.end()) ;
362 entries.push_back( std::pair<ExpandedIdentifier, const T*>(
id,&
m_default)) ;
◆ numObjects()
return the total number of valid calibration objects
Definition at line 260 of file NestedContainer.h.
265 rc += NestedContainerDaughterAccessor<Daughter,T,Trait>::numObjects(*
it) ;
◆ operator==() [1/2]
bool TRTCond::NestedContainerBase< NestingLevel, NestedContainer< NestingLevel+1, StrawStatus, DeadStrawTrait > , StrawStatus , DeadStrawTrait >::operator== |
( |
const NestedContainerBase< NestingLevel, NestedContainer< NestingLevel+1, StrawStatus, DeadStrawTrait >, StrawStatus, DeadStrawTrait > & |
rhs | ) |
const |
|
inlineinherited |
◆ operator==() [2/2]
◆ print()
Definition at line 334 of file NestedContainer.h.
337 std::cout <<
"level = " <<
id.name(NestingLevel) <<
" (" << NestingLevel <<
")" << std::endl ;
340 std::cout <<
"daughter " <<
i << std::endl ;
◆ printindent()
◆ set() [1/2]
set a value.
using 'level' in id we can specify if we want to set the default value.
Definition at line 191 of file NestedContainer.h.
192 if( NestingLevel ==
id.
level() ) {
196 unsigned int thisindex =
id.index(NestingLevel+1) ;
199 m_daughters.resize( thisindex+1, NestedContainerDaughterAccessor<Daughter,T,Trait>::initialvalue() ) ;
◆ set() [2/2]
◆ setStatus()
◆ m_daughters
◆ m_default
The documentation for this class was generated from the following file:
constexpr std::enable_if_t< is_bitmask_v< E >, E & > set(E &lhs, E rhs)
Convenience function to set bits in a class enum bitmask.