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 int StringTreeLeaf::toStr(char* buffer) const
41 {
42  const StringTreeNode* leaf_node = this->node_ptr;
43  if (!leaf_node)
44  {
45  return -1;
46  }
47 
48  boost::container::static_vector<const std::string*, 16> strings_chain;
49 
50  while (leaf_node)
51  {
52  const auto& str = leaf_node->value();
53  strings_chain.push_back(&str);
54  leaf_node = leaf_node->parent();
55  };
56 
57  std::reverse(strings_chain.begin(), strings_chain.end());
58 
59  size_t array_count = 0;
60  size_t offset = 0;
61 
62  for (const auto& str : strings_chain)
63  {
64  const size_t S = str->size();
65  if (S == 1 && (*str)[0] == '#')
66  {
67  buffer[offset++] = '.';
68  offset += print_number(&buffer[offset], this->index_array[array_count++]);
69  }
70  else
71  {
72  if (str != strings_chain.front())
73  {
74  buffer[offset++] = '/';
75  }
76  std::memcpy(&buffer[offset], str->data(), S);
77  offset += S;
78  }
79  }
80  buffer[offset] = '\0';
81  return offset;
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  {
89  out.clear();
90  return;
91  }
92 
93  boost::container::static_vector<const std::string*, 16> strings_chain;
94 
95  size_t total_size = 0;
96 
97  while (leaf_node)
98  {
99  const auto& str = leaf_node->value();
100  leaf_node = leaf_node->parent();
101  if (!(leaf_node == nullptr && skip_root))
102  {
103  strings_chain.emplace_back(&str);
104  const size_t S = str.size();
105  if (S == 1 && str[0] == '#')
106  {
107  total_size += 5; // super conservative
108  }
109  else
110  {
111  total_size += S + 1;
112  }
113  }
114  };
115 
116  out.resize(total_size);
117  char* buffer = &out[0];
118 
119  std::reverse(strings_chain.begin(), strings_chain.end());
120 
121  size_t array_count = 0;
122  size_t offset = 0;
123 
124  for (const auto& str : strings_chain)
125  {
126  const size_t S = str->size();
127  if (S == 1 && (*str)[0] == '#')
128  {
129  buffer[offset++] = '.';
130  offset += print_number(&buffer[offset], leaf.index_array[array_count++]);
131  }
132  else
133  {
134  if (str != strings_chain.front())
135  {
136  buffer[offset++] = '/';
137  }
138  std::memcpy(&buffer[offset], str->data(), S);
139  offset += S;
140  }
141  }
142  out.resize(offset);
143 }
144 
145 } // namespace RosIntrospection
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.
#define S(x)
void CreateStringFromTreeLeaf(const StringTreeLeaf &leaf, bool skip_root, std::string &out)
boost::container::static_vector< uint16_t, 8 > index_array
const StringTreeNode * node_ptr
bool toStr(std::string &destination) const
Utility functions to print the entire branch.


plotjuggler_ros
Author(s): Davide Faconti
autogenerated on Fri Jun 23 2023 02:28:04