forked from Nivekk/KOS
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUtils.cs
More file actions
332 lines (270 loc) · 10.4 KB
/
Utils.cs
File metadata and controls
332 lines (270 loc) · 10.4 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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Reflection;
using System.Text;
using System.Text.RegularExpressions;
using UnityEngine;
namespace kOS
{
public enum kOSKeys
{
LEFT = 37, UP = 38, RIGHT = 39, DOWN = 40,
DEL = 46,
F1 = 112, F2 = 113, F3 = 114, F4 = 115, F5 = 116, F6 = 117, F7 = 118, F8 = 119, F9 = 120, F10 = 121, F11 = 122, F12 = 123,
PGUP = 33, PGDN = 34, END = 35, HOME = 36, DELETE = 44, INSERT = 45,
BREAK = 19
}
public static class Utils
{
public static List<String> Split(String input, char delimiter, bool ignoreString)
{
input = input.Trim();
List<String> retList = new List<string>();
char[] inputChars = input.ToCharArray();
int start = 0;
for (int i = 0; i < input.Length; i++)
{
if (ignoreString && inputChars[i] == '"')
{
// Skip over strings
i = FindEndOfString(input, i + 1);
}
else if (inputChars[i] == delimiter)
{
retList.Add(input.Substring(start, i - start));
start = i + 1;
}
}
if (start < input.Length - 1)
{
retList.Add(input.Substring(start));
}
return retList;
}
// Find the next unescaped double quote
public static int FindEndOfString(String text, int start)
{
char[] input = text.ToCharArray();
for (int i = start; i < input.Count(); i++)
{
if (input[i] == '"' && (i == 0 || input[i - 1] != '\\'))
{
return i;
}
}
return -1;
}
public static double Clamp(double input, double low, double high)
{
return (input > high ? high : (input < low ? low : input));
}
public static int BraceMatch(String text, int start)
{
char[] input = text.ToCharArray();
int braceLevel = 0;
for (int i = start; i < input.Count(); i++)
{
if (input[i] == '{')
{
braceLevel++;
}
else if (input[i] == '}')
{
braceLevel--;
if (braceLevel == 0) return i;
}
else if (input[i] == '"')
{
i = FindEndOfString(text, i + 1);
if (i == -1) return -1;
}
}
return -1;
}
public static bool Balance(ref string str, ref int i, char closeChar)
{
i++;
while (i < str.Length)
{
char c = str[i];
if (c == closeChar) return true;
else if (c == '"')
{
i = FindEndOfString(str, i + 1);
if (i == -1) return false;
}
else if (c == '(' && !Balance(ref str, ref i, ')')) return false;
else if (c == '[' && !Balance(ref str, ref i, ']')) return false;
else if (c == ')' || c == ']')
{
// If this wasn't detected by c == closeChar, then we have a closing delmiter without opening one
return false;
}
i++;
}
return closeChar == (char)0;
}
public static bool DelimterMatch(string str)
{
int i = -1;
return Balance(ref str, ref i, (char)0);
}
public static double ProspectForResource(String resourceName, List<Part> engines)
{
List<Part> visited = new List<Part>();
double total = 0;
foreach (var part in engines)
{
total += ProspectForResource(resourceName, part, ref visited);
}
return total;
}
public static double ProspectForResource(String resourceName, Part engine)
{
List<Part> visited = new List<Part>();
return ProspectForResource(resourceName, engine, ref visited);
}
public static double ProspectForResource(String resourceName, Part part, ref List<Part> visited)
{
double ret = 0;
if (visited.Contains(part))
{
return 0;
}
visited.Add(part);
foreach (PartResource resource in part.Resources)
{
if (resource.resourceName.ToLower() == resourceName.ToLower())
{
ret += resource.amount;
}
}
foreach (AttachNode attachNode in part.attachNodes)
{
if (attachNode.attachedPart != null //if there is a part attached here
&& attachNode.nodeType == AttachNode.NodeType.Stack //and the attached part is stacked (rather than surface mounted)
&& (attachNode.attachedPart.fuelCrossFeed //and the attached part allows fuel flow
)
&& !(part.NoCrossFeedNodeKey.Length > 0 //and this part does not forbid fuel flow
&& attachNode.id.Contains(part.NoCrossFeedNodeKey))) // through this particular node
{
ret += ProspectForResource(resourceName, attachNode.attachedPart, ref visited);
}
}
return ret;
}
public static string[] ProcessParams(string input)
{
String buffer = "";
List<String> output = new List<string>();
for (var i = 0; i < input.Length; i++)
{
char c = input[i];
if (c == '\"')
{
var prevI = i;
i = Utils.FindEndOfString(input, i + 1);
buffer += input.Substring(prevI, i - prevI + 1);
}
else
{
if (c == ',')
{
output.Add(buffer.Trim());
buffer = "";
}
else
{
buffer += c;
}
}
}
if (buffer.Trim().Length > 0) output.Add(buffer.Trim());
return output.ToArray();
}
public static String BuildRegex(String kegex)
{
if (kegex.StartsWith("^")) return kegex; // Input is already in regex format
return "^" + BuildInnerRegex(kegex) + "$";
}
public static int NewLineCount(String input)
{
int retVal = 0;
foreach (char c in input)
{
if (c == '\n') retVal++;
}
return retVal;
}
public static String BuildInnerRegex(String kegex)
{
String output = "";
for (int i=0; i<kegex.Length; i++)
{
String c = kegex.Substring(i, 1);
switch (c)
{
case " ":
// 1 or more whitespace
output += "\\s+";
break;
case "_":
// 0 or more whitespace
output += "\\s*";
break;
case "#":
// Numeric
output += "([\\-0-9.]+)";
break;
case "*":
// Anything
output += "([\\s\\S]+)";
break;
case "~":
// Anything but braces or quotes
output += "([^{}\"]+)";
break;
case "[":
int choiceEnd = kegex.IndexOf(']', i);
var choices = kegex.Substring(i + 1, choiceEnd - i - 1).Split(',');
output += "([\\s ]+" + string.Join("|[\\s ]+", choices) + ")";
i = choiceEnd;
break;
case "%":
// Alphanumeric with underscores, first character must be alpha
output += "([a-zA-Z][a-zA-Z0-9_]*?)";
break;
case "&":
// Alphanumeric file name with underscores and dashes, first character must be alpha
output += "([a-zA-Z0-9_\\-]*?)";
break;
case "^":
// Volume identifer, numeric or variable-legal
output += "([a-zA-Z0-9_\\-]*?|[0-9]+)";
break;
case "(":
// Parameter declaration that accepts a sub-expression (which does not itself contain a function)
// example: SIN_(1) denotes a function that has one parameter
var endIndexBracket = kegex.IndexOf(')', i);
if (endIndexBracket == -1) throw new FormatException("Round bracket not closed in '" + kegex + "'");
int paramcount = Int32.Parse(kegex.Substring(i + 1, endIndexBracket - i - 1));
output += @"\(" + string.Join(",", Enumerable.Repeat("([ :@A-Za-z0-9\\.\\-\\+\\*/\"]+)", paramcount).ToArray()) + @"\)";
i = endIndexBracket;
break;
case "{":
var endIndexBrace = kegex.IndexOf('}', i);
if (endIndexBrace == -1) throw new FormatException("Curly brace not closed in '" + kegex + "'");
output += "({[\\s\\S]*})";
i = endIndexBrace;
break;
default:
output += c;
break;
}
}
return output;
}
}
}