stringtree_leaf.cpp
Go to the documentation of this file.
1 /*********************************************************************
2 * Software License Agreement (BSD License)
3 *
4 * Copyright 2016-2017 Davide Faconti
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
17 * * Neither the name of Willow Garage, Inc. nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
29 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
31 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32 * POSSIBILITY OF SUCH DAMAGE.
33 * *******************************************************************/
34 
37 
38 namespace RosIntrospection{
39 
40 
41 
42 int StringTreeLeaf::toStr(char* buffer) const
43 {
44  const StringTreeNode* leaf_node = this->node_ptr;
45  if( !leaf_node ){
46  return -1;
47  }
48 
49  boost::container::static_vector<const std::string*, 16> strings_chain;
50 
51  while(leaf_node)
52  {
53  const auto& str = leaf_node->value();
54  strings_chain.push_back( &str );
55  leaf_node = leaf_node->parent();
56  };
57 
58  std::reverse(strings_chain.begin(), strings_chain.end() );
59 
60  size_t array_count = 0;
61  size_t offset = 0;
62 
63  for( const auto& str: strings_chain)
64  {
65  const size_t S = str->size();
66  if( S == 1 && (*str)[0] == '#' )
67  {
68  buffer[offset++] = '.';
69  offset += print_number(&buffer[offset], this->index_array[ array_count++ ] );
70  }
71  else{
72  if( str != strings_chain.front() ){
73  buffer[offset++] = '/';
74  }
75  std::memcpy( &buffer[offset], str->data(), S );
76  offset += S;
77  }
78  }
79  buffer[offset] = '\0';
80  return offset;
81 }
82 
83 
84 void CreateStringFromTreeLeaf(const StringTreeLeaf& leaf, bool skip_root, std::string& out)
85 {
86  const StringTreeNode* leaf_node = leaf.node_ptr;
87  if( !leaf_node ){
88  out.clear();
89  return ;
90  }
91 
92  boost::container::static_vector<const std::string*, 16> strings_chain;
93 
94  size_t total_size = 0;
95 
96  while(leaf_node)
97  {
98  const auto& str = leaf_node->value();
99  leaf_node = leaf_node->parent();
100  if( !( leaf_node == nullptr && skip_root) )
101  {
102  strings_chain.emplace_back( &str );
103  const size_t S = str.size();
104  if( S == 1 && str[0] == '#' )
105  {
106  total_size += 5; // super conservative
107  }
108  else{
109  total_size += S+1;
110  }
111  }
112  };
113 
114  out.resize(total_size);
115  char* buffer = &out[0];
116 
117  std::reverse(strings_chain.begin(), strings_chain.end() );
118 
119  size_t array_count = 0;
120  size_t offset = 0;
121 
122  for( const auto& str: strings_chain)
123  {
124  const size_t S = str->size();
125  if( S == 1 && (*str)[0] == '#' )
126  {
127  buffer[offset++] = '.';
128  offset += print_number(&buffer[offset], leaf.index_array[ array_count++ ] );
129  }
130  else{
131  if( str != strings_chain.front() ){
132  buffer[offset++] = '/';
133  }
134  std::memcpy( &buffer[offset], str->data(), S );
135  offset += S;
136  }
137  }
138  out.resize(offset);
139 }
140 
141 }
int print_number(char *buffer, uint16_t value)
The StringTreeLeaf is, as the name suggests, a leaf (terminal node) of a StringTree. It provides the pointer to the node and a list of numbers that represent the index that corresponds to the placeholder "#".
Element of the tree. it has a single parent and N >= 0 children.
Definition: tree.hpp:54
const TreeNode * parent() const
Definition: tree.hpp:63
void CreateStringFromTreeLeaf(const StringTreeLeaf &leaf, bool skip_root, std::string &out)
boost::container::static_vector< uint16_t, 8 > index_array
const T & value() const
Definition: tree.hpp:65
const StringTreeNode * node_ptr
bool toStr(std::string &destination) const
Utility functions to print the entire branch.


ros_type_introspection
Author(s): Davide Faconti
autogenerated on Sun Sep 6 2020 03:19:54