#include "behaviortree_cpp/controls/parallel_node.h"#include "behaviortree_cpp/controls/parallel_all_node.h"#include "behaviortree_cpp/controls/reactive_sequence.h"#include "behaviortree_cpp/controls/reactive_fallback.h"#include "behaviortree_cpp/controls/fallback_node.h"#include "behaviortree_cpp/controls/sequence_node.h"#include "behaviortree_cpp/controls/sequence_with_memory_node.h"#include "behaviortree_cpp/controls/switch_node.h"#include "behaviortree_cpp/controls/if_then_else_node.h"#include "behaviortree_cpp/controls/while_do_else_node.h"#include "behaviortree_cpp/action_node.h"#include "behaviortree_cpp/condition_node.h"#include "behaviortree_cpp/decorators/inverter_node.h"#include "behaviortree_cpp/decorators/retry_node.h"#include "behaviortree_cpp/decorators/repeat_node.h"#include "behaviortree_cpp/decorators/run_once_node.h"#include "behaviortree_cpp/decorators/subtree_node.h"#include "behaviortree_cpp/decorators/loop_node.h"#include "behaviortree_cpp/decorators/updated_decorator.h"#include "behaviortree_cpp/actions/always_success_node.h"#include "behaviortree_cpp/actions/always_failure_node.h"#include "behaviortree_cpp/actions/script_condition.h"#include "behaviortree_cpp/actions/script_node.h"#include "behaviortree_cpp/actions/set_blackboard_node.h"#include "behaviortree_cpp/actions/test_node.h"#include "behaviortree_cpp/actions/sleep_node.h"#include "behaviortree_cpp/actions/unset_blackboard_node.h"#include "behaviortree_cpp/actions/updated_action.h"#include "behaviortree_cpp/decorators/force_success_node.h"#include "behaviortree_cpp/decorators/force_failure_node.h"#include "behaviortree_cpp/decorators/keep_running_until_failure_node.h"#include "behaviortree_cpp/decorators/script_precondition.h"#include "behaviortree_cpp/decorators/timeout_node.h"#include "behaviortree_cpp/decorators/delay_node.h"#include <iostream>

Go to the source code of this file.
Namespaces | |
| BT | |
Typedefs | |
| using | BT::SerializedTreeStatus = std::vector< std::pair< uint16_t, uint8_t > > |
Functions | |
| void | BT::applyRecursiveVisitor (const TreeNode *root_node, const std::function< void(const TreeNode *)> &visitor) |
| void | BT::applyRecursiveVisitor (TreeNode *root_node, const std::function< void(TreeNode *)> &visitor) |
| void | BT::buildSerializedStatusSnapshot (const TreeNode *root_node, SerializedTreeStatus &serialized_buffer) |
| buildSerializedStatusSnapshot can be used to create a buffer that can be stored (or sent to a client application) to know the status of all the nodes of a tree. It is not "human readable". More... | |
| template<typename T > | |
| NodeType | BT::getType () |
| int | BT::LibraryVersionNumber () |
| const char * | BT::LibraryVersionString () |
| void | BT::printTreeRecursively (const TreeNode *root_node, std::ostream &stream=std::cout) |