forked from ExileLord/Open-GHTCP
-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathAbstractTreeNode1.cs
142 lines (126 loc) · 3.92 KB
/
AbstractTreeNode1.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
using System;
using System.Collections.Generic;
using GHNamespace9;
namespace GHNamespaceB
{
public abstract class AbstractTreeNode1 : AbstractBaseTreeNode1, IComparable
{
public AbstractTreeNode1 method_1()
{
return (AbstractTreeNode1) Parent;
}
public virtual bool vmethod_7()
{
return method_1().vmethod_7();
}
public static int smethod_0(long long0)
{
return (int) (4L - (long0 & 3L)) & 3;
}
public virtual bool vmethod_8()
{
return method_1().vmethod_8();
}
public virtual void vmethod_9(bool bool1)
{
method_1().vmethod_9(bool1);
}
public virtual Dictionary<int, string> vmethod_10()
{
return method_1().vmethod_10();
}
public virtual void vmethod_11(Dictionary<int, string> dictionary0)
{
method_1().vmethod_11(dictionary0);
}
public AbstractBaseTreeNode1 method_2(int int0)
{
return (AbstractBaseTreeNode1) Nodes[int0];
}
public int addChild(AbstractBaseTreeNode1 class2580)
{
return Nodes.Add(class2580);
}
public virtual AbstractTreeNode1 vmethod_12(int int0)
{
return method_1().vmethod_12(int0);
}
public void method_4(Stream26 stream260)
{
vmethod_13(stream260);
vmethod_0();
}
public abstract void vmethod_13(Stream26 stream260);
public abstract void vmethod_14(Stream26 stream260);
public T zzFindNode<T>(T gparam0) where T : AbstractTreeNode1
{
if (CompareTo(gparam0) == 0)
{
return (T) this;
}
if (Nodes.Count != 0 && Nodes[0] is AbstractTreeNode1)
{
System.Collections.IEnumerator enumerator = Nodes.GetEnumerator();
T result;
try
{
while (enumerator.MoveNext())
{
AbstractTreeNode1 @class = (AbstractTreeNode1) enumerator.Current;
T t;
if ((t = @class.zzFindNode(gparam0)) != null)
{
result = t;
return result;
}
}
goto IL_84;
}
finally
{
if (enumerator is IDisposable disposable)
{
disposable.Dispose();
}
}
}
IL_84:
return default(T);
}
public bool method_6<T>(ref T gparam0) where T : AbstractTreeNode1
{
if (CompareTo(gparam0) == 0)
{
gparam0 = (T) this;
return true;
}
if (Nodes.Count != 0 && Nodes[0] is AbstractTreeNode1)
{
System.Collections.IEnumerator enumerator = Nodes.GetEnumerator();
bool result;
try
{
while (enumerator.MoveNext())
{
AbstractTreeNode1 @class = (AbstractTreeNode1) enumerator.Current;
if (@class.method_6(ref gparam0))
{
result = true;
return result;
}
}
return false;
}
finally
{
if (enumerator is IDisposable disposable)
{
disposable.Dispose();
}
}
}
return false;
}
public abstract int CompareTo(object target);
}
}