|
ATLAS Offline Software
|
Go to the documentation of this file.
10 m_children(m_parents.
size(),std::
vector<std::size_t>()){
14 for(
auto i = 1
u;
i < nParents; ++
i){
20 for(
auto i = 0
u;
i < nChildren; ++
i){
26 for(
auto i = 0
u;
i < nParents; ++
i){
27 if (
i == 0){
continue;}
70 [](
const auto&
e) {return e == 0;});
89 for(;
i <
n; ++
i){
out <<
t.parent(
i) <<
" ";}
std::string find(const std::string &s)
return a remapped string
std::vector< std::size_t > siblings(std::size_t) const
parents
print ("==> buf:",buf)
std::vector< std::vector< std::size_t > > m_children
@ u
Enums for curvilinear frames.
std::vector< std::size_t > m_parents
std::size_t depth(std::size_t) const
bool is_leaf(size_t) const
std::size_t parent(std::size_t) const
std::vector< std::size_t > m_leaves
const std::vector< std::size_t > & firstGeneration() const
Tree(const std::vector< std::size_t > &)
std::ostream & operator<<(std::ostream &out, const Tree &t)
std::vector< std::size_t > m_firstGeneration
const std::vector< std::size_t > & leaves() const