sequence_star_node.cpp
Go to the documentation of this file.
1 /* Copyright (C) 2015-2018 Michele Colledanchise - All Rights Reserved
2  * Copyright (C) 2018-2020 Davide Faconti, Eurecat - All Rights Reserved
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"),
5 * to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
6 * 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:
7 * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
8 *
9 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
10 * 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,
11 * 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.
12 */
13 
15 
16 namespace BT
17 {
18 
19 SequenceStarNode::SequenceStarNode(const std::string& name)
20  : ControlNode::ControlNode(name, {} )
22 {
23  setRegistrationID("SequenceStar");
24 }
25 
27 {
28  const size_t children_count = children_nodes_.size();
29 
31 
32  while (current_child_idx_ < children_count)
33  {
34  TreeNode* current_child_node = children_nodes_[current_child_idx_];
35  const NodeStatus child_status = current_child_node->executeTick();
36 
37  switch (child_status)
38  {
40  {
41  return child_status;
42  }
44  {
45  // DO NOT reset current_child_idx_ on failure
46  for(size_t i=current_child_idx_; i < childrenCount(); i++)
47  {
48  haltChild(i);
49  }
50 
51  return child_status;
52  }
54  {
56  }
57  break;
58 
59  case NodeStatus::IDLE:
60  {
61  throw LogicError("A child node must never return IDLE");
62  }
63  } // end switch
64  } // end while loop
65 
66  // The entire while loop completed. This means that all the children returned SUCCESS.
67  if (current_child_idx_ == children_count)
68  {
69  haltChildren();
71  }
72  return NodeStatus::SUCCESS;
73 }
74 
76 {
79 }
80 
81 }
size_t childrenCount() const
std::vector< TreeNode * > children_nodes_
Definition: control_node.h:25
virtual void halt() override
SequenceStarNode(const std::string &name)
Abstract base class for Behavior Tree Nodes.
Definition: tree_node.h:53
virtual void halt() override
void setRegistrationID(StringView ID)
Definition: tree_node.h:163
virtual BT::NodeStatus tick() override
Method to be implemented by the user.
void haltChild(size_t i)
NodeStatus
Definition: basic_types.h:35
virtual BT::NodeStatus executeTick()
The method that should be used to invoke tick() and setStatus();.
Definition: tree_node.cpp:33
void setStatus(NodeStatus new_status)
Definition: tree_node.cpp:40


behaviotree_cpp_v3
Author(s): Michele Colledanchise, Davide Faconti
autogenerated on Tue May 4 2021 02:56:25