Tree node for labeling Tensptrs.
More...
#include <load.hpp>
|
std::unordered_map< std::string, PathedTens * > | children_ |
| Map of labels to branching nodes. More...
|
|
std::unordered_map< std::string, ade::TensptrT > | tens_ |
| Map of labels to tensor leaves. More...
|
|
Tree node for labeling Tensptrs.
◆ ~PathedTens()
pbm::PathedTens::~PathedTens |
( |
void |
| ) |
|
|
inline |
◆ get_labelled() [1/2]
ade::TensptrT pbm::PathedTens::get_labelled |
( |
StringsT |
path | ) |
const |
|
inline |
Return tensor associated with input path if found otherwise nullptr.
◆ get_labelled() [2/2]
ade::TensptrT pbm::PathedTens::get_labelled |
( |
StringsT::iterator |
path_begin, |
|
|
StringsT::iterator |
path_end |
|
) |
| const |
|
inline |
Return tensor associated with path between iterators begin and end if found otherwise nullptr
◆ join()
Grab all leaf and branch nodes from subtree root other Accounting for duplicate labels but not Tensptrs
◆ set_labelled() [1/2]
void pbm::PathedTens::set_labelled |
( |
StringsT |
path, |
|
|
ade::TensptrT |
tens |
|
) |
| |
|
inline |
Set input path to reference tensor.
◆ set_labelled() [2/2]
void pbm::PathedTens::set_labelled |
( |
StringsT::iterator |
path_begin, |
|
|
StringsT::iterator |
path_end, |
|
|
ade::TensptrT |
tens |
|
) |
| |
|
inline |
Set path between iterators begin and end to reference tensor.
◆ children_
std::unordered_map<std::string,PathedTens*> pbm::PathedTens::children_ |
Map of labels to branching nodes.
◆ tens_
std::unordered_map<std::string,ade::TensptrT> pbm::PathedTens::tens_ |
Map of labels to tensor leaves.
The documentation for this struct was generated from the following file: