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
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
using System;
namespace Rotate
{
internal class App
{
public static int s_weightCount = 1;
public static int s_objCount = 0;
private class Node
{
public float m_weight;
public Node m_leftChild, m_rightChild;
public Node()
{
s_objCount++;
m_weight = (float)(s_weightCount++);
}
~Node()
{
//Console.WriteLine("Deleting " + m_weight.ToString());
s_objCount--;
}
public void growTree(int maxHeight, String indent)
{
//Console.WriteLine(indent + m_weight.ToString());
if (maxHeight > 0)
{
m_leftChild = new Node();
m_leftChild.growTree(maxHeight - 1, indent + " ");
m_rightChild = new Node();
m_rightChild.growTree(maxHeight - 1, indent + " ");
}
else
m_leftChild = m_rightChild = null;
}
public void rotateTree(ref float leftWeight, ref float rightWeight)
{
//Console.WriteLine("rotateTree(" + m_weight.ToString() + ") - begin");
Node newLeftChild = null, newRightChild = null;
int objCount = s_objCount;
if (m_leftChild != null)
{
newRightChild = new Node();
objCount++;
newRightChild.m_leftChild = m_leftChild.m_leftChild;
newRightChild.m_rightChild = m_leftChild.m_rightChild;
newRightChild.m_weight = m_leftChild.m_weight;
}
if (m_rightChild != null)
{
newLeftChild = new Node();
objCount++;
newLeftChild.m_leftChild = m_rightChild.m_leftChild;
newLeftChild.m_rightChild = m_rightChild.m_rightChild;
newLeftChild.m_weight = m_rightChild.m_weight;
}
m_leftChild = newLeftChild;
m_rightChild = newRightChild;
for (int I = 0; I < 1024; I++) { int[] u = new int[1024]; }
GC.Collect();
if (m_rightChild != null)
{
if (m_rightChild.m_leftChild != null &&
m_rightChild.m_rightChild != null)
{
m_rightChild.rotateTree(
ref m_rightChild.m_leftChild.m_weight,
ref m_rightChild.m_rightChild.m_weight);
}
else
{
float minus1 = -1;
m_rightChild.rotateTree(ref minus1, ref minus1);
}
if (leftWeight != m_rightChild.m_weight)
{
Console.WriteLine("left weight do not match.");
throw new Exception();
}
}
if (m_leftChild != null)
{
if (m_leftChild.m_leftChild != null &&
m_leftChild.m_rightChild != null)
{
m_leftChild.rotateTree(
ref m_leftChild.m_leftChild.m_weight,
ref m_leftChild.m_rightChild.m_weight);
}
else
{
float minus1 = -1;
m_leftChild.rotateTree(ref minus1, ref minus1);
}
if (rightWeight != m_leftChild.m_weight)
{
Console.WriteLine("right weight do not match.");
throw new Exception();
}
}
//Console.WriteLine("rotateTree(" + m_weight.ToString() + ") - end");
}
}
private static int Main()
{
Node root = new Node();
root.growTree(4, "");
root.rotateTree(ref root.m_leftChild.m_weight, ref root.m_rightChild.m_weight);
return 100;
}
}
}
|
