#include <Tree.h>
Definition at line 18 of file Tree.h.
◆ Tree()
| Tree::Tree |
( |
const std::vector< std::size_t > & | parents | ) |
|
Definition at line 8 of file Tree.cxx.
8 :
12
13
14 for(
auto i = 1u;
i < nParents; ++
i){
16 }
17
19
20 for(
auto i = 0u;
i < nChildren; ++
i){
23 }
24 }
25
26 for(
auto i = 0u;
i < nParents; ++
i){
27 if (i == 0){continue;}
28
30 }
31}
static const Attributes_t empty
std::vector< std::size_t > m_parents
std::vector< std::size_t > m_firstGeneration
std::vector< std::vector< std::size_t > > m_children
std::vector< std::size_t > m_leaves
parents
print ("==> buf:",buf)
◆ cbegin()
◆ cend()
◆ depth()
| std::size_t Tree::depth |
( |
std::size_t | n | ) |
const |
Definition at line 75 of file Tree.cxx.
75 {
77 while (n != 0){
80 }
82}
std::size_t depth(std::size_t) const
@ u
Enums for curvilinear frames.
◆ firstGeneration()
| const std::vector< std::size_t > & Tree::firstGeneration |
( |
| ) |
const |
◆ is_leaf()
| bool Tree::is_leaf |
( |
size_t | | ) |
const |
◆ is_simple()
| bool Tree::is_simple |
( |
| ) |
const |
Definition at line 64 of file Tree.cxx.
64 {
66 return false;
67 } else {
70 [](const auto& e) {return e == 0;});
71 }
72}
◆ leaves()
| const std::vector< std::size_t > & Tree::leaves |
( |
| ) |
const |
◆ parent()
| std::size_t Tree::parent |
( |
std::size_t | k | ) |
const |
◆ siblings()
| std::vector< std::size_t > Tree::siblings |
( |
std::size_t | k | ) |
const |
Definition at line 39 of file Tree.cxx.
39 {
41}
std::size_t parent(std::size_t) const
◆ size()
| std::size_t Tree::size |
( |
| ) |
const |
◆ m_children
| std::vector<std::vector<std::size_t> > Tree::m_children |
|
private |
◆ m_firstGeneration
| std::vector<std::size_t> Tree::m_firstGeneration |
|
private |
◆ m_leaves
| std::vector<std::size_t> Tree::m_leaves |
|
private |
◆ m_parents
| std::vector<std::size_t> Tree::m_parents |
|
private |
The documentation for this class was generated from the following files: