-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathUdonXML.cs
771 lines (685 loc) · 21.9 KB
/
UdonXML.cs
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
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
/*
* The MIT License (MIT)
*
* Copyright (c) 2020 Foorack
*
* 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 NON-INFRINGEMENT. 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.
*/
/*
* UdonXML
*
* Version log:
* 0.1.0: 2020-04-11; Initial version, parsing capability.
* 0.1.1: 2020-04-12; Added support for !DOCTYPE, thereby allowing HTML to be parsed.
* 0.1.2: 2020-04-12; Many parsing issues fixed. Now possible to export XML data.
* 0.1.3: 2020-04-12; Added ability to change values and create/delete attributes and child nodes.
* 0.2.0: 2020-04-18; Better handle HTML input, especially regarding comments and certain self-closing HTML tags.
*
*/
#define NO_DEBUG
// Remove NO_ to enable debug
using UnityEngine;
using UdonSharp;
// ReSharper disable MemberCanBePrivate.Global
// ReSharper disable UnusedMember.Global
// ReSharper disable MemberCanBeMadeStatic.Global
// ReSharper disable SuggestBaseTypeForParameter
// ReSharper disable once InconsistentNaming
// ReSharper disable once CheckNamespace
public class UdonXML : UdonSharpBehaviour
{
/**
* Data is stored internally in the following format:
*
* object[]{
* 0: "nodeName",
* 1: object[ // attributes
* tagNames,
* tagValue
* ],
* 2: object[ //children
* // self...
* ]
* 3: "value"
* }
*/
private object[] GenerateEmptyStruct()
{
var emptyStruct = new object[4];
emptyStruct[0] = ""; // nodeName
var attr = new object[2];
attr[0] = new string[0];
attr[1] = new string[0];
emptyStruct[1] = attr;
emptyStruct[2] = new object[0];
emptyStruct[3] = ""; // nodeValue
return emptyStruct;
}
private string[] AddLastToStringArray(string[] a, string b)
{
var n = new string[a.Length + 1];
for (var i = 0; i != a.Length; i++)
{
n[i] = a[i];
}
n[a.Length] = b;
return n;
}
private string[] RemoveIndexStringArray(string[] a, int index)
{
var n = new string[a.Length - 1];
for (var i = 0; i < index; i++)
{
n[i] = a[i];
}
for (var i = index + 1; i != a.Length - 1; i++)
{
n[i - 1] = a[i];
}
return n;
}
private object[] AddFirstToObjectArray(object[] a, object b)
{
var n = new object[a.Length + 1];
for (var i = 0; i != a.Length; i++)
{
n[i + 1] = a[i];
}
n[0] = b;
return n;
}
private object[] AddLastToObjectArray(object[] a, object b)
{
var n = new object[a.Length + 1];
for (var i = 0; i != a.Length; i++)
{
n[i] = a[i];
}
n[a.Length] = b;
return n;
}
private object[] RemoveFirstObjectArray(object[] a)
{
var n = new object[a.Length - 1];
for (var i = 0; i != a.Length - 1; i++)
{
n[i] = a[i + 1];
}
return n;
}
private object[] RemoveIndexObjectArray(object[] a, int index)
{
var n = new object[a.Length - 1];
for (var i = 0; i < index; i++)
{
n[i] = a[i];
}
for (var i = index + 1; i != a.Length - 1; i++)
{
n[i - 1] = a[i];
}
return n;
}
private int[] AddLastToIntegerArray(int[] a, int b)
{
var n = new int[a.Length + 1];
for (var i = 0; i != a.Length; i++)
{
n[i] = a[i];
}
n[a.Length] = b;
return n;
}
private int[] RemoveFirstIntegerArray(int[] a)
{
var n = new int[a.Length - 1];
for (var i = 0; i != a.Length - 1; i++)
{
n[i] = a[i + 1];
}
return n;
}
private int[] RemoveLastIntegerArray(int[] a)
{
var n = new int[a.Length - 1];
for (var i = 0; i != a.Length - 1; i++)
{
n[i] = a[i];
}
return n;
}
private object[] FindCurrentLevel(object[] data, int[] position)
{
if (position.Length == 0)
{
return data;
}
var current = data;
// [ 1, 0, 1]
while (position.Length != 0)
{
current = (object[]) ((object[]) current[2])[position[0]];
position = RemoveFirstIntegerArray(position);
}
return current;
}
private object[] Parse(char[] input)
{
var state = 0;
var level = 0;
var isSpecialData = false;
var isWithinQuotes = false;
var isSelfClosingNode = false;
var hasNodeNameEnded = false;
var hasTagSplitOccured = false; // means the = between the name and the value
var data = GenerateEmptyStruct();
data[0] = "UdonXMLRoot";
// Position to know where we are in the tree.
var position = new int[0];
var nodeName = "";
var tagName = "";
var tagValue = "";
var tagNames = new string[0];
var tagValues = new string[0];
for (var i = 0; i != input.Length; i++)
{
char c = input[i];
string pos = "";
for (int n = 0; n != position.Length; n++)
{
pos += position[n] + ">";
}
#if DEBUG
Debug.Log(state + " " + level + " " + c + " " + pos);
#endif
if (state == 0)
{
if (c == '<')
{
isSpecialData = false;
isWithinQuotes = false;
isSelfClosingNode = false;
hasNodeNameEnded = false;
hasTagSplitOccured = false;
nodeName = "";
tagNames = new string[0];
tagValues = new string[0];
state = 1;
}
else
{
object[] s = FindCurrentLevel(data, position);
s[3] = (string) s[3] + c;
}
}
else if (state == 1)
{
if (c == '/')
{
state = 2;
}
else
{
if (c == '?' || c == '!')
{
isSpecialData = true;
}
nodeName += c + "";
state = 3;
}
}
else if (state == 2)
{
if (c == '>')
{
level--;
position = RemoveLastIntegerArray(position);
state = 0;
#if DEBUG
Debug.Log("CLOSED TAG : " + nodeName);
#endif
}
else
{
nodeName += c + "";
}
}
else if (state == 3)
{
if (c == '>' && !isWithinQuotes)
{
#if DEBUG
Debug.Log("OPENED TAG : " + nodeName);
#endif
state = 0;
tagName = "";
tagValue = "";
var s = FindCurrentLevel(data, position);
position = AddLastToIntegerArray(position, ((object[]) s[2]).Length);
s[2] = AddLastToObjectArray((object[]) s[2], GenerateEmptyStruct());
var children = (object[]) s[2];
var child = (object[]) children[children.Length - 1];
child[0] = nodeName;
var attr = (object[]) child[1];
attr[0] = tagNames;
attr[1] = tagValues;
if (isSelfClosingNode || isSpecialData)
{
position = RemoveLastIntegerArray(position);
#if DEBUG
Debug.Log("SELF-CLOSED TAG : " + nodeName);
#endif
}
if (!isSelfClosingNode && !isSpecialData)
{
level++;
}
}
else if (c == '/' && !isWithinQuotes)
{
isSelfClosingNode = true;
}
else if (c == '"')
{
if (isWithinQuotes)
{
// Add tag
if (tagName.Trim().Length != 0)
{
tagNames = AddLastToStringArray(tagNames, tagName.Trim());
tagValues = AddLastToStringArray(tagValues, tagValue);
tagName = "";
tagValue = "";
hasTagSplitOccured = false;
}
}
isWithinQuotes = !isWithinQuotes;
}
else if (c == '=' && !isWithinQuotes)
{
hasTagSplitOccured = true;
}
else
{
if (c == ' ' && !hasNodeNameEnded)
{
hasNodeNameEnded = true;
var nodeNameLow = nodeName.ToLower();
if (nodeNameLow == "area" || nodeNameLow == "base" || nodeNameLow == "br" ||
nodeNameLow == "embed" || nodeNameLow == "hr" || nodeNameLow == "iframe" ||
nodeNameLow == "img" || nodeNameLow == "input" || nodeNameLow == "link" ||
nodeNameLow == "meta" || nodeNameLow == "param" || nodeNameLow == "source" ||
nodeNameLow == "track")
{
isSelfClosingNode = true;
}
}
if (hasNodeNameEnded)
{
// if tag name or tag value
if (hasTagSplitOccured)
{
tagValue += c + "";
}
else
{
// i.e. bordered in <table>, or html in <doctype>, sometimes they don't have values
if (c == ' ')
{
// Add tag
if (tagName.Trim().Length != 0)
{
tagNames = AddLastToStringArray(tagNames, tagName.Trim());
tagValues = AddLastToStringArray(tagValues, null);
tagName = "";
}
}
else
{
tagName += c + "";
}
}
}
else
{
nodeName += c + "";
}
}
}
}
#if DEBUG
Debug.Log("Level after parsing: " + level);
#endif
return level != 0 ? null : data;
}
private string Serialize(object[] data, string padding)
{
var output = "";
var work = new object[0];
var current = data;
var nodeChildren = (object[]) current[2];
// Add all current children
foreach (object o in nodeChildren)
{
work = AddLastToObjectArray(work, new[] {o, 0});
}
while (work.Length != 0)
{
current = (object[]) work[0];
var node = (object[]) current[0];
var level = (int) current[1];
work = RemoveFirstObjectArray(work);
var nodeName = (string) node[0];
var nodeTags = (object[]) node[1];
var tagNames = (object[]) nodeTags[0];
var tagValues = (object[]) nodeTags[1];
nodeChildren = (object[]) node[2];
var nodeValue = (string) node[3];
#if DEBUG
Debug.Log("[UdonXML] [Save] Work: " + nodeName + " " + level);
#endif
// Add newline if not first line
if (output.Length != 0)
{
output += "\n";
}
// Add indentation
for (var i = 0; i != level; i++)
{
output += padding;
}
// Compile tags list
var tagList = "";
for (var i = 0; i != tagNames.Length; i++)
{
if (null == tagValues[i])
{
// Tags without value, such as bordered in table, or html in doctype
tagList += " " + tagNames[i];
}
else
{
tagList += " " + tagNames[i] + "=\"" + tagValues[i] + "\"";
}
}
if (nodeChildren.Length == 0)
{
if (nodeValue.Trim().Length == 0)
{
var nodeNameLow = nodeName.ToLower();
switch (nodeNameLow)
{
// ?xml has an extra ? at the end
case "?xml":
output += $"<{nodeName}{tagList}?>";
break;
// doc types are self closing without the usual slash
case "!doctype":
output += $"<{nodeName}{tagList}>";
break;
case "!--":
output += $"<{nodeName}{tagList} -->";
break;
default:
output += $"<{nodeName}{tagList} />";
break;
}
}
else
{
output += $"<{nodeName}{tagList}>{nodeValue}</{nodeName}>";
}
}
else
{
output += $"<{nodeName}{tagList}>";
if (nodeChildren[0] != null)
{
var tempData = GenerateEmptyStruct();
tempData[0] = "/" + nodeName;
tempData[2] = new object[] {null};
work = AddFirstToObjectArray(work, (object) new object[] {tempData, level});
}
}
// Add all current children
for (var i = nodeChildren.Length - 1; i >= 0; i--)
{
var o = nodeChildren[i];
if (o != null)
{
work = AddFirstToObjectArray(work, new [] {o, level + 1});
}
}
}
return output;
}
/**
* Loads an XML structure into memory by parsing the provided input.
*
* Returns null in case of parse failure.
*/
public object LoadXml(string input)
{
return Parse(input.ToCharArray());
}
/**
* Saves the stored XML structure in memory to an XML document.
* Uses default indent of 4 spaces. Use `SaveXmlWithIdent` to override.
*/
public string SaveXml(object data)
{
return SaveXmlWithIdent(data, " ");
}
/**
* Saves the stored XML structure in memory to an XML document with given indentation.
*/
public string SaveXmlWithIdent(object data, string indent)
{
return Serialize((object[]) data, indent);
}
/**
* Returns true if the node has child nodes.
*/
public bool HasChildNodes(object data)
{
return ((object[]) ((object[]) data)[2]).Length != 0;
}
/**
* Returns the number of children the current node has.
*/
public int GetChildNodesCount(object data)
{
return ((object[]) ((object[]) data)[2]).Length;
}
/**
* Returns the child node by the given index.
*/
public object GetChildNode(object data, int index)
{
return (object[]) ((object[]) ((object[]) data)[2])[index];
}
/**
* Returns the child node by the given name.
*
* If multiple nodes exists with the same type-name then the first one will be returned.
*/
public object GetChildNodeByName(object data, string nodeName)
{
var children = (object[]) ((object[]) data)[2];
for (var i = 0; i != children.Length; i++)
{
var child = (object[]) children[i];
if (((string) child[0]) == nodeName)
{
return child;
}
}
return null;
}
/**
* Creates a new child node under the current given node.
*
* Returns the newly created node.
*/
public object CreateChildNode(object data, string nodeName)
{
var newChild = GenerateEmptyStruct();
newChild[0] = nodeName;
var d = (object[]) data;
d[2] = AddLastToObjectArray((object[]) d[2], newChild);
return newChild;
}
/**
* Removes a child node from the current node by given index.
*
* Returns the deleted node.
*/
public object RemoveChildNode(object data, int index)
{
var d = (object[]) data;
var old = ((object[]) d[2])[index];
d[2] = RemoveIndexObjectArray((object[]) d[2], index);
return old;
}
/**
* Removes a child node from the current node by given name. If multiple nodes exist with the same name then only the first one is deleted.
*
* Returns the deleted node, or null if not found.
*/
public object RemoveChildNodeByName(object data, string nodeName)
{
var d = (object[]) data;
var children = (object[]) d[2];
for (var i = 0; i != children.Length; i++)
{
var old = (object[]) children[i];
if ((string) old[0] == nodeName)
{
d[2] = RemoveIndexObjectArray(children, i);
return old;
}
}
return null;
}
/**
* Returns the type-name of the node.
*/
public string GetNodeName(object data)
{
return (string) ((object[]) data)[0];
}
/**
* Sets the name of the node.
*/
public void SetNodeName(object data, string newName)
{
((object[]) data)[0] = newName;
}
/**
* Returns the value of the node.
*/
public string GetNodeValue(object data)
{
return (string) ((object[]) data)[3];
}
/**
* Sets the value of the node.
*/
public void SetNodeValue(object data, string newValue)
{
((object[]) data)[3] = newValue;
}
/**
* Returns whether the node has a given attribute or not.
*/
public bool HasAttribute(object data, string attrName)
{
var attr = (object[]) ((object[]) data)[1];
var tagNames = (string[]) attr[1];
for (var i = 0; i != tagNames.Length; i++)
{
if (tagNames[i] == attrName)
{
return true;
}
}
return false;
}
/**
* Returns the value of the attribute by given name.
*/
public string GetAttribute(object data, string attrName)
{
var attr = (object[]) ((object[]) data)[1];
var tagNames = (string[]) attr[1];
var tagValues = (string[]) attr[1];
for (var i = 0; i != tagNames.Length; i++)
{
if (tagNames[i] == attrName)
{
return tagValues[i];
}
}
return null;
}
/**
* Sets the value of an attribute on given node.
*
* Returns false if the attribute already existed, returns true if attribute was created.
*/
public bool SetAttribute(object data, string attrName, string newValue)
{
var attr = (object[]) ((object[]) data)[1];
var tagNames = (string[]) attr[1];
var tagValues = (string[]) attr[1];
for (var i = 0; i != tagNames.Length; i++)
{
if (tagNames[i] == attrName)
{
tagValues[i] = newValue;
return false;
}
}
// This only executes if it wasn't already found
attr[0] = AddLastToStringArray(tagNames, attrName);
attr[1] = AddLastToStringArray(tagValues, newValue);
return true;
}
/**
* Removes an attribute by name in the given node.
*
* Returns true if attribute was deleted, false if it did not exist.
*/
public bool RemoveAttribute(object data, string attrName)
{
var attr = (object[]) ((object[]) data)[1];
var tagNames = (string[]) attr[1];
var tagValues = (string[]) attr[1];
for (var i = 0; i != tagNames.Length; i++)
{
if (tagNames[i] == attrName)
{
attr[0] = RemoveIndexStringArray(tagNames, i);
attr[1] = RemoveIndexStringArray(tagValues, i);
return true;
}
}
return false;
}
}