ATLAS Offline Software
Loading...
Searching...
No Matches
TrigConf::L1BunchGroupSet Class Referencefinal

L1 board configuration. More...

#include <L1BunchGroupSet.h>

Inheritance diagram for TrigConf::L1BunchGroupSet:
Collaboration diagram for TrigConf::L1BunchGroupSet:

Public Types

typedef uint16_t bgPattern_t
 type for bunchgroup pattern bitset
using ptree = boost::property_tree::ptree

Public Member Functions

 L1BunchGroupSet ()
 Constructor.
 L1BunchGroupSet (const L1BunchGroupSet &)=default
L1BunchGroupSetoperator= (const L1BunchGroupSet &)=delete
 L1BunchGroupSet (L1BunchGroupSet &&)=delete
 L1BunchGroupSet (const ptree &data)
 Constructor initialized with configuration data.
virtual ~L1BunchGroupSet ()
 Destructor.
virtual std::string className () const override
 A string that is the name of the class.
unsigned int bgsk () const
 setter and getter for the bunch group key
void setBGSK (unsigned int bgsk)
const std::shared_ptr< L1BunchGroup > & getBunchGroup (const std::string &name) const
 Accessor to the bunchgroup by name.
const std::shared_ptr< L1BunchGroup > & getBunchGroup (size_t id) const
 Accessor to the bunchgroup by ID.
constexpr std::size_t maxNBunchGroups () const
 Maximum number of bunchgroups.
std::size_t size () const
 Accessor to the number of defined bunchgroups.
std::size_t sizeNonEmpty () const
 Accessor to the number of non-empty bunchgroups.
bgPattern_t bgPattern (size_t bcid) const
 Return word with bit-pattern of fired bunchgroups for given bcid.
void printSummary (bool detailed=false) const
 print a more or less detailed summary
virtual void clear () override
 Clearing the configuration data.
void setData (const ptree &data)
 Setting the configuration data.
void setData (ptree &&data)
void setName (const std::string &n)
 Setting the configuration element name.
virtual const std::string & name () const final
const ptreedata () const
 Access to the underlying data, if needed.
bool isValue () const
 Check for attribute.
std::string getValue () const
 Access to simple content.
template<class T>
getValue () const
template<class T>
std::optional< T > getValue_optional () const
 access to content of the note Will return false if the value could not be converted into T
bool hasAttribute (const std::string &key) const
 Check for attribute.
bool isNull (const std::string &key) const
 Check if an attribute is null.
bool hasChild (const std::string &path) const
 Check if child exists.
std::string operator[] (const std::string &key) const
 Access to simple attribute.
template<class T>
getAttribute (const std::string &key, bool ignoreIfMissing=false, const T &def=T()) const
 Access to simple attribute.
const std::string & getAttribute (const std::string &key, bool ignoreIfMissing=false, const std::string &def="") const
template<class T>
std::optional< T > getAttribute_optional (const std::string &key) const
std::vector< DataStructuregetList (const std::string &pathToChild, bool ignoreIfMissing=false) const
 Access to array structure.
std::optional< std::vector< DataStructure > > getList_optional (const std::string &pathToChild) const
DataStructure getObject (const std::string &pathToChild, bool ignoreIfMissing=false) const
 Access to configuration object.
std::optional< TrigConf::DataStructuregetObject_optional (const std::string &pathToChild) const
std::vector< std::string > getKeys () const
 Access to the keys of an DataStructure which presents a dictionary.
 operator bool () const
 Access to initialized state.
bool isValid () const
bool isInitialized () const
bool empty () const
 Check if children exist.
void printRaw (std::ostream &os=std::cout) const
virtual void print (std::ostream &os=std::cout) const
bool ownsData () const

Static Public Member Functions

static void printElement (const std::string &key, const ptree &data, uint level=0, std::ostream &os=std::cout)
 Static function to print a ptree object.

Protected Attributes

bool m_initialized { false }
 if initialized, the underlying ptree is has been assigned to (can be empty)
std::shared_ptr< ptreem_dataSPtr { nullptr }
const ptreem_dataPtr { nullptr }
std::string m_name {""}

Private Member Functions

virtual void update () override
 Update the internal members.
void load ()

Private Attributes

unsigned int m_bgsk {0}
 the bunch group key
std::map< std::string, size_t > m_bunchGroupsByName
 maps bgrp name (BGRP0, BGRP1,...) to bunchgroup
std::vector< std::shared_ptr< L1BunchGroup > > m_bunchGroups
 vector of size 16 (L1BunchGroup::s_maxBunchGroups

Static Private Attributes

static const size_t s_maxBunchGroups { 16 }
 Hardware limit for number of bunch group.

Detailed Description

L1 board configuration.

Definition at line 71 of file L1BunchGroupSet.h.

Member Typedef Documentation

◆ bgPattern_t

type for bunchgroup pattern bitset

Definition at line 75 of file L1BunchGroupSet.h.

◆ ptree

using TrigConf::DataStructure::ptree = boost::property_tree::ptree
inherited

Definition at line 40 of file DataStructure.h.

Constructor & Destructor Documentation

◆ L1BunchGroupSet() [1/4]

TrigConf::L1BunchGroupSet::L1BunchGroupSet ( )

Constructor.

Definition at line 79 of file L1BunchGroupSet.cxx.

80{
81}

◆ L1BunchGroupSet() [2/4]

TrigConf::L1BunchGroupSet::L1BunchGroupSet ( const L1BunchGroupSet & )
default

◆ L1BunchGroupSet() [3/4]

TrigConf::L1BunchGroupSet::L1BunchGroupSet ( L1BunchGroupSet && )
delete

◆ L1BunchGroupSet() [4/4]

TrigConf::L1BunchGroupSet::L1BunchGroupSet ( const ptree & data)

Constructor initialized with configuration data.

Parameters
dataThe data containing the L1 menu

Definition at line 83 of file L1BunchGroupSet.cxx.

85{
86 load();
87}
const ptree & data() const
Access to the underlying data, if needed.
DataStructure()
Default constructor, leading to an uninitialized configuration object.

◆ ~L1BunchGroupSet()

TrigConf::L1BunchGroupSet::~L1BunchGroupSet ( )
virtual

Destructor.

Definition at line 89 of file L1BunchGroupSet.cxx.

90{}

Member Function Documentation

◆ bgPattern()

TrigConf::L1BunchGroupSet::bgPattern_t TrigConf::L1BunchGroupSet::bgPattern ( size_t bcid) const

Return word with bit-pattern of fired bunchgroups for given bcid.

Definition at line 138 of file L1BunchGroupSet.cxx.

138 {
139 // sanity check that we have enough bits in bgPattern_t for all bunchgroups
140 static_assert(sizeof(bgPattern_t)*8 >= s_maxBunchGroups);
141
142 bgPattern_t p{0};
143 for (size_t i = 0; i < s_maxBunchGroups; ++i) {
144 if (m_bunchGroups[i] && m_bunchGroups[i]->contains(bcid)) p += (1 << i);
145 }
146 return p;
147}
std::vector< std::shared_ptr< L1BunchGroup > > m_bunchGroups
vector of size 16 (L1BunchGroup::s_maxBunchGroups
static const size_t s_maxBunchGroups
Hardware limit for number of bunch group.
uint16_t bgPattern_t
type for bunchgroup pattern bitset
bool contains(const std::string &s, const std::string &regx)
does a string contain the substring
Definition hcg.cxx:114

◆ bgsk()

unsigned int TrigConf::L1BunchGroupSet::bgsk ( ) const
inline

setter and getter for the bunch group key

Definition at line 95 of file L1BunchGroupSet.h.

95{ return m_bgsk; }
unsigned int m_bgsk
the bunch group key

◆ className()

virtual std::string TrigConf::L1BunchGroupSet::className ( ) const
inlineoverridevirtual

A string that is the name of the class.

Reimplemented from TrigConf::DataStructure.

Definition at line 92 of file L1BunchGroupSet.h.

92{ return "L1BunchGroupSet"; }

◆ clear()

void TrigConf::L1BunchGroupSet::clear ( )
overridevirtual

Clearing the configuration data.

Reimplemented from TrigConf::DataStructure.

Definition at line 110 of file L1BunchGroupSet.cxx.

111{
112 m_bgsk = 0;
113 m_bunchGroupsByName.clear();
114 m_bunchGroups.clear();
115}
std::map< std::string, size_t > m_bunchGroupsByName
maps bgrp name (BGRP0, BGRP1,...) to bunchgroup

◆ data()

const ptree & TrigConf::DataStructure::data ( ) const
inlineinherited

Access to the underlying data, if needed.

Definition at line 83 of file DataStructure.h.

83 {
84 if( ! isInitialized() ) {
85 throw std::runtime_error("Trying to access data of uninitialized object of type " + className());
86 }
87 // Don't use ?: operator here: it confuses cppcheck.
88 if (ownsData()) {
89 return *m_dataSPtr.get();
90 }
91 return *m_dataPtr;
92 }
std::shared_ptr< ptree > m_dataSPtr
virtual std::string className() const
A string that is the name of the class.

◆ empty()

bool TrigConf::DataStructure::empty ( ) const
inlineinherited

Check if children exist.

Definition at line 219 of file DataStructure.h.

219{ return data().empty(); }

◆ getAttribute() [1/2]

const std::string & TrigConf::DataStructure::getAttribute ( const std::string & key,
bool ignoreIfMissing = false,
const std::string & def = "" ) const
inherited

Definition at line 135 of file DataStructure.cxx.

136{
137 const auto & obj = data().get_child_optional(key);
138 if( !obj ) {
139 if( ignoreIfMissing ) {
140 return def;
141 } else {
142 throw std::runtime_error(className() + "#" + name() + ": structure '" + key + "' does not exist" );
143 }
144 }
145 // check if the key points to a plain string value
146 if ( !obj.get().empty() ) {
147 if ( obj.get().front().first.empty() ) {
148 throw std::runtime_error(className() + "#" + name() + ": structure '" + key + "' is not a simple attribute but a list [], it needs to be accessed via getList(\"" + key + "\") -> vector<DataStructure>");
149 } else {
150 throw std::runtime_error(className() + "#" + name() + ": structure '" + key + "' is not a simple attribute but an object {}, it needs to be accessed via getObject(\"" + key + "\") -> DataStructure");
151 }
152 }
153 return obj.get().data();
154}
virtual const std::string & name() const final

◆ getAttribute() [2/2]

template<class T>
T TrigConf::DataStructure::getAttribute ( const std::string & key,
bool ignoreIfMissing = false,
const T & def = T() ) const
inlineinherited

Access to simple attribute.

Parameters
keyThe path to the attribute name, relative to the current one in form "path.to.child"
ignoreIfMissingControls the behavior in case of missing configuration child

Definition at line 152 of file DataStructure.h.

152 {
153 const auto & obj = data().get_child_optional(key);
154 if( !obj ) {
155 if( ignoreIfMissing ) {
156 return def;
157 } else {
158 throw std::runtime_error(className() + "#" + name() + ": structure '" + key + "' does not exist" );
159 }
160 }
161 return obj.get().get_value<T>();
162 }
unsigned long long T

◆ getAttribute_optional()

template<class T>
std::optional< T > TrigConf::DataStructure::getAttribute_optional ( const std::string & key) const
inlineinherited

Definition at line 165 of file DataStructure.h.

165 {
166 const auto & obj = data().get_child_optional(key);
167 if( ! obj ) {
168 return std::nullopt;
169 }
170 auto v = obj.get().get_value_optional<T>();
171 return v ? std::optional(std::move(*v)) : std::nullopt;
172 }

◆ getBunchGroup() [1/2]

const std::shared_ptr< TrigConf::L1BunchGroup > & TrigConf::L1BunchGroupSet::getBunchGroup ( const std::string & name) const

Accessor to the bunchgroup by name.

Parameters
name- name as used in the L1Menu (BGRP0, BGRP1, ..., BGRP15)

Definition at line 118 of file L1BunchGroupSet.cxx.

118 {
120}

◆ getBunchGroup() [2/2]

const std::shared_ptr< TrigConf::L1BunchGroup > & TrigConf::L1BunchGroupSet::getBunchGroup ( size_t id) const

Accessor to the bunchgroup by ID.

Definition at line 123 of file L1BunchGroupSet.cxx.

◆ getKeys()

std::vector< std::string > TrigConf::DataStructure::getKeys ( ) const
inherited

Access to the keys of an DataStructure which presents a dictionary.

In case the DataStructure is a list or a simple attribute, an empty vector is returned

Definition at line 249 of file DataStructure.cxx.

250{
251 std::vector<std::string> keys;
252 if ( ! data().empty() &&
253 ! data().front().first.empty() )
254 {
255 keys.reserve(data().size());
256 for( auto & entry : data() ) {
257 keys.push_back(entry.first);
258 }
259 }
260 return keys;
261}
bool empty() const
Check if children exist.
bool first
Definition DeMoScan.py:534

◆ getList()

std::vector< TrigConf::DataStructure > TrigConf::DataStructure::getList ( const std::string & pathToChild,
bool ignoreIfMissing = false ) const
inherited

Access to array structure.

Parameters
pathToChildThe path to the configuration child, relative to the current one in form "path.to.child"
ignoreIfMissingControls the behavior in case of missing configuration child

In case the child is missing and ignoreIfMissing is set to true, and empty vector will be returned. Otherwise a runtime exception will be thrown.

Definition at line 157 of file DataStructure.cxx.

158{
159 std::vector<TrigConf::DataStructure> childList;
160 const auto & list = data().get_child_optional(pathToChild);
161 if( ! list ) {
162 if ( ignoreIfMissing ) {
163 return childList;
164 } else {
165 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' does not exist.");
166 }
167 }
168
169 // check if the pathToChild points to a list
170
171 // this check is not complete, because boost::ptree can not
172 // distinguish between and empty list and an empty string. In both cases
173 // the value is empty and there are no children
174
175 if ( list.get().empty() ) {
176 if ( list.get().get_value<std::string>() != "" ) {
177 // if the value is not empty, then it is for sure an attribute ("key" : "value")
178 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' is not a list [] but a simple attribute, it needs to be accessed via [\"" + pathToChild + "\"] -> string");
179 }
180 // else: if the value is empty, we can not say for sure and will not
181 // give this debugging hint (an empty list will be returned
182 } else if ( ! list.get().front().first.empty() ) {
183 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' is not a list [] but an object {}, it needs to be accessed via getObject(\"" + pathToChild + "\") -> DataStructure");
184 }
185
186 childList.reserve(list.get().size());
187
188 for( auto & childData : list.get() )
189 childList.emplace_back( childData.second );
190
191 return childList;
192}
list(name, path='/')
Definition histSizes.py:38

◆ getList_optional()

std::optional< std::vector< TrigConf::DataStructure > > TrigConf::DataStructure::getList_optional ( const std::string & pathToChild) const
inherited

Definition at line 196 of file DataStructure.cxx.

197{
198 if(data().find(pathToChild) == data().not_found()) {
199 return std::nullopt;
200 }
201 return std::optional<std::vector<TrigConf::DataStructure> >(getList(pathToChild));
202}
std::vector< DataStructure > getList(const std::string &pathToChild, bool ignoreIfMissing=false) const
Access to array structure.
std::string find(const std::string &s)
return a remapped string
Definition hcg.cxx:138

◆ getObject()

TrigConf::DataStructure TrigConf::DataStructure::getObject ( const std::string & pathToChild,
bool ignoreIfMissing = false ) const
inherited

Access to configuration object.

Parameters
pathToChildThe path to the configuration child, relative to the current one
ignoreIfMissingControls the behavior in case of missing configuration child

In case the child is missing and ignoreIfMissing is set to true, an uninitialized DataStructure will be returned. Otherwise a runtime exception will be thrown.

*bool ignoreIfMissing = true;
*if( const DataStructure & child = ds.getObject("path.to.child", ignoreIfMissing) ) {
cout << child["key"] << endl;
}

Definition at line 206 of file DataStructure.cxx.

207{
208 const auto & obj = data().get_child_optional(pathToChild);
209 if( ! obj ) {
210 if ( ignoreIfMissing ) {
211 return DataStructure();
212 } else {
213 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' does not exist.");
214 }
215 }
216 // check if the pathToChild is an attribute
217 if( obj.get().get_value<std::string>() != "" ) {
218 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' is not an object {} but a simple attribute, it needs to be accessed via [\"" + pathToChild + "\"] -> string");
219 }
220 // check if the pathToChild points to a list
221 if ( obj.get().front().first.empty() ) {
222 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' is not an object {} but a list [], it needs to be accessed via getList(\"" + pathToChild + "\") -> vector<DataStructure>");
223 }
224 return { obj.get() };
225}

◆ getObject_optional()

std::optional< TrigConf::DataStructure > TrigConf::DataStructure::getObject_optional ( const std::string & pathToChild) const
inherited

Definition at line 229 of file DataStructure.cxx.

230{
231
232 if(const auto & obj = data().get_child_optional(pathToChild)) {
233 // check if the pathToChild is an attribute
234 if( obj.get().get_value<std::string>() != "" ) {
235 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' is not an object {} but a simple attribute, it needs to be accessed via [\"" + pathToChild + "\"] -> string");
236 }
237 // check if the pathToChild points to a list
238 if ( obj.get().front().first.empty() ) {
239 throw std::runtime_error(className() + "#" + name() + ": structure '" + pathToChild + "' is not an object {} but a list [], it needs to be accessed via getList(\"" + pathToChild + "\") -> vector<DataStructure>");
240 }
241 return std::optional<TrigConf::DataStructure>(obj.get());
242 }
243 return std::nullopt;
244}

◆ getValue() [1/2]

std::string TrigConf::DataStructure::getValue ( ) const
inherited

Access to simple content.

Returns
string that is the content of the structure

For instance when the json structure contains an array of values (ptree only works with strings) which one retrieved via getList, then the values in the vector<DataStructure> can be accessed using getValue

Definition at line 80 of file DataStructure.cxx.

80 {
81 return data().get_value<std::string>();
82}

◆ getValue() [2/2]

template<class T>
T TrigConf::DataStructure::getValue ( ) const
inlineinherited

Definition at line 108 of file DataStructure.h.

108 {
109 return data().get_value<T>();
110 }

◆ getValue_optional()

template<class T>
std::optional< T > TrigConf::DataStructure::getValue_optional ( ) const
inlineinherited

access to content of the note Will return false if the value could not be converted into T

Definition at line 116 of file DataStructure.h.

116 {
117 auto v = data().get_value_optional<T>();
118 return v ? std::optional<T>(std::move(*v)) : std::nullopt;
119 }

◆ hasAttribute()

bool TrigConf::DataStructure::hasAttribute ( const std::string & key) const
inherited

Check for attribute.

Parameters
keyThe path to the attribute name, relative to the current one in form "path.to.child"
Returns
true if path key exists and is an attribute

Definition at line 85 of file DataStructure.cxx.

85 {
86 const auto & child = data().get_child_optional( key );
87 if( ! bool(child) ) // key does not exist
88 return false;
89 return child.get().empty(); // if empty then it is an attribute, otherwise a child note
90}

◆ hasChild()

bool TrigConf::DataStructure::hasChild ( const std::string & path) const
inherited

Check if child exists.

Parameters
pathThe path to the child, relative to the current one in form "path.to.child"
Returns
true if path exists

Definition at line 113 of file DataStructure.cxx.

113 {
114 const auto & child = data().get_child_optional( path );
115 return bool(child);
116}
setBGCode setTAP setLVL2ErrorBits bool

◆ isInitialized()

bool TrigConf::DataStructure::isInitialized ( ) const
inlineinherited

Definition at line 216 of file DataStructure.h.

216{ return m_initialized; }
bool m_initialized
if initialized, the underlying ptree is has been assigned to (can be empty)

◆ isNull()

bool TrigConf::DataStructure::isNull ( const std::string & key) const
inherited

Check if an attribute is null.

Parameters
keyThe path to the attribute name, relative to the current one in form "path.to.child"
Returns
true if path key exists and is null

If the attribute doesn't exist, the function returns false. To check if an attribute exists and is null, use it together with hasAttribute.

Definition at line 93 of file DataStructure.cxx.

93 {
94 auto child = data().get_child_optional( key );
95 if( ! child ) {
96 return false;
97 }
98 return child->get_value<std::string>() == "null";
99}

◆ isValid()

bool TrigConf::DataStructure::isValid ( ) const
inlineinherited

Definition at line 215 of file DataStructure.h.

215{ return m_initialized; }

◆ isValue()

bool TrigConf::DataStructure::isValue ( ) const
inherited

Check for attribute.

Returns
true if the structure is just a value

Definition at line 74 of file DataStructure.cxx.

74 {
75 return data().empty(); // just a key->value pair, no children
76}

◆ load()

void TrigConf::L1BunchGroupSet::load ( )
private

Definition at line 93 of file L1BunchGroupSet.cxx.

94{
95 if(! isInitialized() || empty() ) {
96 return;
97 }
98 m_name = getAttribute("name", true, m_name);
99 m_bunchGroups.resize(s_maxBunchGroups, std::shared_ptr<L1BunchGroup>(nullptr));
100 for( auto & bg : data().get_child("bunchGroups") ) {
101 auto bg_sptr = std::make_shared<L1BunchGroup>(bg.second);
102 m_bunchGroupsByName.emplace( std::piecewise_construct,
103 std::forward_as_tuple(bg.first),
104 std::forward_as_tuple(bg_sptr->id()) );
105 m_bunchGroups[bg_sptr->id()] = bg_sptr;
106 }
107}
T getAttribute(const std::string &key, bool ignoreIfMissing=false, const T &def=T()) const
Access to simple attribute.

◆ maxNBunchGroups()

std::size_t TrigConf::L1BunchGroupSet::maxNBunchGroups ( ) const
inlineconstexpr

Maximum number of bunchgroups.

Definition at line 107 of file L1BunchGroupSet.h.

◆ name()

const std::string & TrigConf::DataStructure::name ( ) const
finalvirtualinherited

Definition at line 108 of file DataStructure.cxx.

108 {
109 return m_name;
110}

◆ operator bool()

TrigConf::DataStructure::operator bool ( ) const
inlineexplicitinherited

Access to initialized state.

Definition at line 214 of file DataStructure.h.

214{ return m_initialized; }

◆ operator=()

L1BunchGroupSet & TrigConf::L1BunchGroupSet::operator= ( const L1BunchGroupSet & )
delete

◆ operator[]()

std::string TrigConf::DataStructure::operator[] ( const std::string & key) const
inherited

Access to simple attribute.

Parameters
keyThe path to the attribute name, relative to the current one in form "path.to.child"

Definition at line 120 of file DataStructure.cxx.

121{
122 const auto & obj = data().get_child(key);
123 // check if the key points to a plain string value
124 if ( !obj.empty() ) {
125 if ( obj.front().first.empty() ) {
126 throw std::runtime_error(className() + "#" + name() + ": structure '" + key + "' is not a simple attribute but a list [], it needs to be accessed via getList(\"" + key + "\") -> vector<DataStructure>");
127 } else {
128 throw std::runtime_error(className() + "#" + name() + ": structure '" + key + "' is not a simple attribute but an object {}, it needs to be accessed via getObject(\"" + key + "\") -> DataStructure");
129 }
130 }
131 return obj.data();
132}

◆ ownsData()

bool TrigConf::DataStructure::ownsData ( ) const
inlineinherited

Definition at line 242 of file DataStructure.h.

242 {
243 return (bool)m_dataSPtr;
244 }

◆ print()

void TrigConf::DataStructure::print ( std::ostream & os = std::cout) const
virtualinherited

Reimplemented in TrigConf::L1Threshold_EM, and TrigConf::L1TopoAlgorithm.

Definition at line 271 of file DataStructure.cxx.

272{
273 printElement("", data(), 0, os);
274 os << std::endl;
275}
static void printElement(const std::string &key, const ptree &data, uint level=0, std::ostream &os=std::cout)
Static function to print a ptree object.

◆ printElement()

void TrigConf::DataStructure::printElement ( const std::string & key,
const ptree & data,
uint level = 0,
std::ostream & os = std::cout )
staticinherited

Static function to print a ptree object.

Parameters
keyThe key of this data as found in the parent structure
dataThe ptree to print
levelThe substruture level used to indent the output
osThe output stream

Definition at line 278 of file DataStructure.cxx.

279{
280 constexpr char del = '"';
281
282 const std::string value = data.get_value<std::string>();
283
284 if( data.empty() ) { // no children, so just a key->value pair
285 uint n(4*level); while(n--) os << " ";
286 os << del << key << del << ": " << del << value << del;
287 return;
288 }
289
290
291 bool isArray ( data.begin()->first.empty() ); // dictionaries have keys, arrays don't
292 { uint n(4*level); while(n--) os << " "; }
293 if ( ! key.empty() )
294 os << del << key << del << ": ";
295 os << (isArray ? "[" : "{") << std::endl;
296
297 size_t childCounter = data.size();
298 for( const boost::property_tree::ptree::value_type & x : data ) {
299 printElement(x.first, x.second, level + 1, os);
300 if( --childCounter ) os << ",";
301 os << std::endl;
302 }
303 { uint n(4*level); while(n--) os << " "; }
304 os << (isArray ? "]" : "}");
305
306}
unsigned int uint
#define x

◆ printRaw()

void TrigConf::DataStructure::printRaw ( std::ostream & os = std::cout) const
inherited

Definition at line 264 of file DataStructure.cxx.

265{
266 boost::property_tree::json_parser::write_json( os, data() );
267}

◆ printSummary()

void TrigConf::L1BunchGroupSet::printSummary ( bool detailed = false) const

print a more or less detailed summary

Definition at line 150 of file L1BunchGroupSet.cxx.

150 {
151 std::cout << "Name '" << name() << "'" << std::endl;
152 std::cout << "Number of non-empty bunchgroups: " << sizeNonEmpty() << std::endl;
153 if(detailed) {
154 for( const auto & bg : m_bunchGroups ) {
155 if (bg) {
156 std::cout << " " << bg->name() << " (id " << bg->id() << ") has " << bg->size() << " bunches" << std::endl;
157 }
158 }
159 } else {
160 const auto & paired = getBunchGroup(1);
161 if (paired) {
162 std::cout << "Bunchgroup " << paired->name() << " has " << paired->size() << " bunches" << std::endl;
163 }
164 }
165}
const std::shared_ptr< L1BunchGroup > & getBunchGroup(const std::string &name) const
Accessor to the bunchgroup by name.
std::size_t sizeNonEmpty() const
Accessor to the number of non-empty bunchgroups.

◆ setBGSK()

void TrigConf::L1BunchGroupSet::setBGSK ( unsigned int bgsk)
inline

Definition at line 96 of file L1BunchGroupSet.h.

96{ m_bgsk = bgsk; }
unsigned int bgsk() const
setter and getter for the bunch group key

◆ setData() [1/2]

void TrigConf::DataStructure::setData ( const ptree & data)
inherited

Setting the configuration data.

Definition at line 39 of file DataStructure.cxx.

40{
41 clear();
42 m_initialized = true;
43 m_dataSPtr.reset();
44 m_dataPtr = &data;
45 update();
46}
virtual void clear()
Clearing the configuration data.
virtual void update()
Update the internal data after modification of the data object.

◆ setData() [2/2]

void TrigConf::DataStructure::setData ( ptree && data)
inherited

Definition at line 50 of file DataStructure.cxx.

51{
52 clear();
53 m_initialized = true;
54 m_dataSPtr = std::make_shared<ptree>(std::move(data));
55 m_dataPtr = nullptr;
56 update();
57}

◆ setName()

void TrigConf::DataStructure::setName ( const std::string & n)
inherited

Setting the configuration element name.

Definition at line 59 of file DataStructure.cxx.

59 {
60 m_name = n;
61}

◆ size()

std::size_t TrigConf::L1BunchGroupSet::size ( ) const

Accessor to the number of defined bunchgroups.

Definition at line 128 of file L1BunchGroupSet.cxx.

128 {
129 return std::count_if(m_bunchGroups.begin(), m_bunchGroups.end(), [](const auto &bg){return bg!=nullptr;});
130}

◆ sizeNonEmpty()

std::size_t TrigConf::L1BunchGroupSet::sizeNonEmpty ( ) const

Accessor to the number of non-empty bunchgroups.

Definition at line 133 of file L1BunchGroupSet.cxx.

133 {
134 return std::count_if(m_bunchGroups.begin(), m_bunchGroups.end(), [](const auto &bg){return bg->size()!=0;});
135}

◆ update()

virtual void TrigConf::L1BunchGroupSet::update ( )
inlineoverrideprivatevirtual

Update the internal members.

Reimplemented from TrigConf::DataStructure.

Definition at line 127 of file L1BunchGroupSet.h.

127{ load(); };

Member Data Documentation

◆ m_bgsk

unsigned int TrigConf::L1BunchGroupSet::m_bgsk {0}
private

the bunch group key

Definition at line 134 of file L1BunchGroupSet.h.

134{0};

◆ m_bunchGroups

std::vector<std::shared_ptr<L1BunchGroup> > TrigConf::L1BunchGroupSet::m_bunchGroups
private

vector of size 16 (L1BunchGroup::s_maxBunchGroups

Definition at line 140 of file L1BunchGroupSet.h.

◆ m_bunchGroupsByName

std::map<std::string, size_t> TrigConf::L1BunchGroupSet::m_bunchGroupsByName
private

maps bgrp name (BGRP0, BGRP1,...) to bunchgroup

Definition at line 137 of file L1BunchGroupSet.h.

◆ m_dataPtr

const ptree* TrigConf::DataStructure::m_dataPtr { nullptr }
protectedinherited

Definition at line 257 of file DataStructure.h.

257{ nullptr }; // used when not owning the tree

◆ m_dataSPtr

std::shared_ptr<ptree> TrigConf::DataStructure::m_dataSPtr { nullptr }
protectedinherited

Definition at line 256 of file DataStructure.h.

256{ nullptr }; // used when owning the tree

◆ m_initialized

bool TrigConf::DataStructure::m_initialized { false }
protectedinherited

if initialized, the underlying ptree is has been assigned to (can be empty)

Definition at line 254 of file DataStructure.h.

254{ false };

◆ m_name

std::string TrigConf::DataStructure::m_name {""}
protectedinherited

Definition at line 259 of file DataStructure.h.

259{""}; // most objects are named

◆ s_maxBunchGroups

const size_t TrigConf::L1BunchGroupSet::s_maxBunchGroups { 16 }
staticprivate

Hardware limit for number of bunch group.

Definition at line 131 of file L1BunchGroupSet.h.

131{ 16 };

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