00001 /* Copyright (C) 2015-2018 Michele Colledanchise - All Rights Reserved 00002 * Copyright (C) 2018 Davide Faconti - 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/control_node.h" 00015 00016 namespace BT 00017 { 00018 ControlNode::ControlNode(const std::string& name, const NodeParameters& parameters) 00019 : TreeNode::TreeNode(name, parameters) 00020 { 00021 // TODO(...) In case it is desired to set to idle remove the ReturnStatus 00022 // type in order to set the member variable 00023 // ReturnStatus const NodeStatus child_status = NodeStatus::IDLE; // commented out as unused 00024 } 00025 00026 void ControlNode::addChild(TreeNode* child) 00027 { 00028 // Checking if the child is not already present 00029 // for (auto node : children_nodes_) 00030 // { 00031 // if (node == child) 00032 // { 00033 // throw BehaviorTreeException("'" + child->name() + "' is already a '" + name() + "' child."); 00034 // } 00035 // } 00036 00037 children_nodes_.push_back(child); 00038 } 00039 00040 unsigned int ControlNode::childrenCount() const 00041 { 00042 return children_nodes_.size(); 00043 } 00044 00045 void ControlNode::halt() 00046 { 00047 haltChildren(0); 00048 setStatus(NodeStatus::IDLE); 00049 } 00050 00051 const std::vector<TreeNode*>& ControlNode::children() const 00052 { 00053 return children_nodes_; 00054 } 00055 00056 void ControlNode::haltChildren(int i) 00057 { 00058 for (unsigned int j = i; j < children_nodes_.size(); j++) 00059 { 00060 auto child = children_nodes_[j]; 00061 if (child->status() == NodeStatus::RUNNING) 00062 { 00063 child->halt(); 00064 } 00065 child->setStatus(NodeStatus::IDLE); 00066 } 00067 } 00068 }