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/controls/fallback_node.h" 00015 00016 namespace BT 00017 { 00018 FallbackNode::FallbackNode(const std::string& name) 00019 : ControlNode::ControlNode(name, NodeParameters()) 00020 { 00021 setRegistrationName("Fallback"); 00022 } 00023 00024 NodeStatus FallbackNode::tick() 00025 { 00026 // gets the number of children. The number could change if, at runtime, one edits the tree. 00027 const unsigned children_count = children_nodes_.size(); 00028 00029 // Routing the ticks according to the fallback node's logic: 00030 00031 setStatus(NodeStatus::RUNNING); 00032 00033 for (unsigned index = 0; index < children_count; index++) 00034 { 00035 TreeNode* child_node = children_nodes_[index]; 00036 const NodeStatus child_status = child_node->executeTick(); 00037 00038 switch (child_status) 00039 { 00040 case NodeStatus::RUNNING: 00041 { 00042 return child_status; 00043 } 00044 case NodeStatus::SUCCESS: 00045 { 00046 haltChildren(0); 00047 return child_status; 00048 } 00049 case NodeStatus::FAILURE: 00050 { 00051 // continue; 00052 } 00053 break; 00054 00055 case NodeStatus::IDLE: 00056 { 00057 throw std::runtime_error("This is not supposed to happen"); 00058 } 00059 } // end switch 00060 } // end for loop 00061 00062 haltChildren(0); 00063 return NodeStatus::FAILURE; 00064 } 00065 }