53 const auto& str = leaf_node->
value();
55 leaf_node = leaf_node->
parent();
58 std::reverse(strings_chain.
begin(), strings_chain.
end() );
60 size_t array_count = 0;
63 for(
const auto& str: strings_chain)
65 const size_t S = str->size();
66 if( S == 1 && (*str)[0] ==
'#' )
68 buffer[offset++] =
'.';
72 if( str != strings_chain.front() ){
73 buffer[offset++] =
'/';
75 std::memcpy( &buffer[offset], str->data(), S );
79 buffer[offset] =
'\0';
int print_number(char *buffer, uint16_t value)
void push_back(const value_type &t)
Element of the tree. it has a single parent and N >= 0 children.
const TreeNode * parent() const
InlinedVector< uint16_t, 8 > index_array
const StringTreeNode * node_ptr
bool toStr(std::string &destination) const
Utility functions to print the entire branch.
iterator begin() noexcept