public static void Main(string[] p_args)
{
Node root;
Node longLivedTree;
Node tempTree;
Thread sleepThread;
kStretchTreeDepth = 19; // about 24MB
kLongLivedTreeDepth = 18; // about 12MB
kShortLivedTreeDepth = 13; // about 0.4MB
tempTree = new Node();
Populate(kStretchTreeDepth, tempTree);
tempTree = null;
longLivedTree = new Node();
Populate(kLongLivedTreeDepth, longLivedTree);
SleepThread sThread;
sThread = new SleepThread(100);
sleepThread = new Thread(new ThreadStart(SleepThread.ThreadStart));
sleepThread.Start();
for (long i = 0; i < NUM_ITERATIONS; i++)
{
root = new Node();
Populate(kShortLivedTreeDepth, root);
}
root = longLivedTree;
SleepThread.shouldContinue = false;
sleepThread.Join(500);
}
public static void Main(string[] p_args)
{
Node root;
Node longLivedTree;
Node tempTree;
Thread sleepThread;
kStretchTreeDepth = 19; // about 24MB
kLongLivedTreeDepth = 18; // about 12MB
kShortLivedTreeDepth = 13; // about 0.4MB
tempTree = new Node();
Populate(kStretchTreeDepth, tempTree);
tempTree = null;
longLivedTree = new Node();
Populate(kLongLivedTreeDepth, longLivedTree);
SleepThread sThread;
sThread = new SleepThread(100);
sleepThread = new Thread(new ThreadStart(SleepThread.ThreadStart));
sleepThread.Start();
for (long i = 0; i < NUM_ITERATIONS; i++)
{
root = new Node();
Populate(kShortLivedTreeDepth, root);
}
root = longLivedTree;
SleepThread.shouldContinue = false;
sleepThread.Join(500);
}