@@ -33,18 +33,22 @@ int main(int argc, char* argv[])
33
33
34
34
std::unordered_map<uint16_t , std::string> names_by_uid;
35
35
std::unordered_map<uint16_t , const Serialization::TreeNode*> node_by_uid;
36
+ uint16_t max_uid = 0 ;
36
37
37
38
for (const Serialization::TreeNode* node : *(behavior_tree->nodes ()))
38
39
{
39
40
names_by_uid.insert ({node->uid (), std::string (node->instance_name ()->c_str ())});
40
41
node_by_uid.insert ({node->uid (), node});
42
+ max_uid = std::max (max_uid, node->uid ());
41
43
}
44
+ uint16_t digits_max_uid = std::to_string (max_uid).size ();
42
45
43
46
printf (" ----------------------------\n " );
44
47
45
48
std::function<void (uint16_t , int )> recursiveStep;
46
49
47
50
recursiveStep = [&](uint16_t uid, int indent) {
51
+ printf (" (%*d): " , digits_max_uid, uid);
48
52
for (int i = 0 ; i < indent; i++)
49
53
{
50
54
printf (" " );
@@ -98,7 +102,8 @@ int main(int argc, char* argv[])
98
102
const uint32_t t_sec = flatbuffers::ReadScalar<uint32_t >(&buffer[index]);
99
103
const uint32_t t_usec = flatbuffers::ReadScalar<uint32_t >(&buffer[index + 4 ]);
100
104
101
- printf (" [%d.%06d]: %s%s %s -> %s\n " , t_sec, t_usec, name.c_str (),
105
+ printf (" [%d.%06d] (%*d): %s%s %s -> %s\n " , t_sec, t_usec,
106
+ digits_max_uid, uid, name.c_str (),
102
107
&whitespaces[std::min (ws_count, name.size ())],
103
108
printStatus (flatbuffers::ReadScalar<Serialization::NodeStatus>(&buffer[index + 10 ])),
104
109
printStatus (flatbuffers::ReadScalar<Serialization::NodeStatus>(&buffer[index + 11 ])));
0 commit comments