forked from bitbrain/beehave
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbeehave_composite.cpp
More file actions
70 lines (58 loc) · 3.04 KB
/
beehave_composite.cpp
File metadata and controls
70 lines (58 loc) · 3.04 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/**************************************************************************/
/* beehave_composite.cpp */
/**************************************************************************/
/* This file is part of: */
/* BEEHAVE */
/* https://bitbra.in/beehave */
/**************************************************************************/
/* Copyright (c) 2024-present Beehave Contributors. */
/* */
/* Permission is hereby granted, free of charge, to any person obtaining */
/* a copy of this software and associated documentation files (the */
/* "Software"), to deal in the Software without restriction, including */
/* without limitation the rights to use, copy, modify, merge, publish, */
/* distribute, sublicense, 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: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
/* MERCHANTABILITY, 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, 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. */
/**************************************************************************/
#include "beehave_composite.h"
using namespace godot;
BeehaveComposite::BeehaveComposite() {
}
BeehaveComposite::~BeehaveComposite() {
}
void BeehaveComposite::after_run(Ref<BeehaveContext> context) {
running_child = nullptr;
}
void BeehaveComposite::interrupt(Ref<BeehaveContext> context) {
if (running_child) {
running_child->interrupt(context);
running_child = nullptr;
}
BeehaveTreeNode::interrupt(context);
}
void BeehaveComposite::interrupt_children(Ref<BeehaveContext> context, int from_index, int to_index) {
if (from_index >= to_index) {
return;
}
TypedArray<Node> children = get_children();
for (int i = from_index; i < to_index; ++i) {
BeehaveTreeNode *child = cast_node(Object::cast_to<Node>(children[i]));
if (child == nullptr) {
// Skip all children which aren't Beehave nodes
continue;
}
child->interrupt(context);
}
}