-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNodeFinder.cs
More file actions
168 lines (139 loc) · 4.06 KB
/
NodeFinder.cs
File metadata and controls
168 lines (139 loc) · 4.06 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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
using Godot;
using Godot.Collections;
using System;
public class NodeFinder
{
///<Summary>
///Retrieves a child that is a direct leaf of the search node with the designated type.
///</Summary>
public static T GetDirectNodeInChildren<T>(Node nodeToSearch)where T:Node
{
Array<Node> children = new Array<Node>(nodeToSearch.GetChildren());
Node foundNode = null;
foreach(Node n in children)
{
if(n.GetType() == typeof(T))
{
foundNode = n;
}
if(foundNode != null)
{
break;
}
}
if(foundNode != null)
{
return (T) Convert.ChangeType(foundNode,typeof(T));
}
else{
return null;
}
}
///<Summary>
///Retrieves a child that is a direct leaf of the search node with the child name and type.
///</Summary>
public static T GetDirectNodeInChildren<T>(Node nodeToSearch,string childName)where T:Node
{
Array<Node> children = new Array<Node>(nodeToSearch.GetChildren());
Node foundNode = null;
foreach(Node n in children)
{
if(n.GetType() == typeof(T))
{
foundNode = n;
}
if(foundNode != null)
{
break;
}
}
if(foundNode != null)
{
return (T) Convert.ChangeType(foundNode,typeof(T));
}
else{
return null;
}
}
///<Summary>
///Retrieves a child node of the sent type within ALL child nodes.
///</Summary>
public static T GetNodeInChildren<T>(Node nodeToSearch) where T:Node
{
Array<Node> children = new Array<Node>(nodeToSearch.GetChildren());
int incorrectTypeFound = 0;
Node foundNode = null;
foreach(Node n in children)
{
if(n.GetType() == typeof(T))
{
foundNode = n;
}
else
{
incorrectTypeFound ++;
}
if(foundNode != null)
break;
else
{
foundNode = GetNodeInChildren<T>(n);
}
}
if(foundNode != null)
{
return (T) Convert.ChangeType(foundNode,typeof(T));
}
return null;
}
///<Summary>
///Returns a child node of a specific type and name within ALL child nodes.
///</Summary>
public static T GetNodeInChildren<T>(Node nodeToSearch, string ChildName) where T: Node
{
Array<Node> children = new Array<Node>(nodeToSearch.GetChildren());
int incorrectTypeFound = 0;
Node foundNode = null;
foreach(Node n in children)
{
if(n.Name == ChildName )
{
if(n.GetType() == typeof(T))
{
GD.Print("Found : Returning " + n.Name);
foundNode = n;
}
else
{
incorrectTypeFound ++;
}
}
if(foundNode != null)
break;
else{
foundNode = GetNodeInChildren<T>(n,ChildName);
}
}
if(foundNode != null)
{
return (T) Convert.ChangeType(foundNode,typeof(T));
}
return null;
}
///<Summary>
///Retrieves all nodes of the sent type within the sent node to search.null
///</Summary>
public static Array<T> GetNodesInChildren<T>(Node nodeToSearch) where T : Node
{
Array<Node> children = new Array<Node>(nodeToSearch.GetChildren());
Array<T> foundChildren = new Array<T>();
foreach(Node n in children)
{
if(n.GetType() == typeof(T))
{
foundChildren.Add((T)Convert.ChangeType(n,typeof(T)));
}
}
return foundChildren;
}
}