decorator_node.cpp
Go to the documentation of this file.
00001 /* Copyright (C) 2015-2017 Michele Colledanchise - All Rights Reserved
00002  * Copyright (C) 2018-2019 Davide Faconti, Eurecat -  All Rights Reserved
00003 *
00004 *   Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"),
00005 *   to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
00006 *   and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
00007 *   The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
00008 *
00009 *   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
00010 *   FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
00011 *   WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00012 */
00013 
00014 #include "behaviortree_cpp/decorator_node.h"
00015 
00016 namespace BT
00017 {
00018 DecoratorNode::DecoratorNode(const std::string& name, const NodeConfiguration& config)
00019   : TreeNode::TreeNode(name, config), child_node_(nullptr)
00020 {
00021 }
00022 
00023 void DecoratorNode::setChild(TreeNode* child)
00024 {
00025     if (child_node_)
00026     {
00027         throw BehaviorTreeException("Decorator [", name(), "] has already a child assigned");
00028     }
00029 
00030     child_node_ = child;
00031 }
00032 
00033 void DecoratorNode::halt()
00034 {
00035     haltChild();
00036     setStatus(NodeStatus::IDLE);
00037 }
00038 
00039 const TreeNode* DecoratorNode::child() const
00040 {
00041     return child_node_;
00042 }
00043 
00044 TreeNode* DecoratorNode::child()
00045 {
00046     return child_node_;
00047 }
00048 
00049 void DecoratorNode::haltChild()
00050 {
00051     if (child_node_->status() == NodeStatus::RUNNING)
00052     {
00053         child_node_->halt();
00054     }
00055     child_node_->setStatus(NodeStatus::IDLE);
00056 }
00057 
00058 SimpleDecoratorNode::SimpleDecoratorNode(const std::string& name, TickFunctor tick_functor,
00059                                          const NodeConfiguration& config)
00060   : DecoratorNode(name, config), tick_functor_(std::move(tick_functor))
00061 {
00062 }
00063 
00064 NodeStatus SimpleDecoratorNode::tick()
00065 {
00066     return tick_functor_(child()->executeTick(), *this);
00067 }
00068 
00069 NodeStatus DecoratorNode::executeTick()
00070 {
00071     NodeStatus status = TreeNode::executeTick();
00072     NodeStatus child_status = child()->status();
00073     if( child_status == NodeStatus::SUCCESS || child_status == NodeStatus::FAILURE )
00074     {
00075         child()->setStatus(NodeStatus::IDLE);
00076     }
00077     return status;
00078 }
00079 
00080 }


behaviortree_cpp
Author(s): Michele Colledanchise, Davide Faconti
autogenerated on Sat Jun 8 2019 20:17:15