public void CompletedVisitor()
{
var tree = GetTestTree();
var visitor = new CompletedTrackingVisitor<KeyValuePair<int, string>>();
tree.AcceptVisitor(visitor);
}
public void Done()
{
var priorityQueue = GetSimpleTestPriorityQueue();
var visitor = new CompletedTrackingVisitor <string>();
priorityQueue.AcceptVisitor(visitor);
}
public void Stopping()
{
var visitor = new CompletedTrackingVisitor <int>();
var heap = GetTestHeap();
heap.AcceptVisitor(visitor);
}
public void CompletedVisitor2()
{
var bag = new Bag<string> { "5", "4", "3", "2" };
var visitor = new CompletedTrackingVisitor<string>();
bag.AcceptVisitor<string>(visitor);
}
public void CompletedVisitor()
{
var tree = GetTestTree();
var visitor = new CompletedTrackingVisitor <KeyValuePair <int, string> >();
tree.AcceptVisitor(visitor);
}
public void StoppingVisitor()
{
var circularQueue = CircularQueueTest.GetFullTestQueue();
var visitor = new CompletedTrackingVisitor <int>();
circularQueue.AcceptVisitor(visitor);
}
public void CompletedVisitor1()
{
var bag = new Bag<string> { "5", "4", "3", "2" };
var visitor = new CompletedTrackingVisitor<KeyValuePair<string, int>>();
bag.AcceptVisitor<KeyValuePair<string, int>>(visitor);
}
public void Completed()
{
var binaryTree = GetTestTree();
var completedTrackingVisitor = new CompletedTrackingVisitor <int>();
binaryTree.AcceptVisitor(completedTrackingVisitor);
}
public void AcceptCompletedVisitor()
{
var generalTree = GetTestTree();
var completedTrackingVisitor = new CompletedTrackingVisitor<int>();
generalTree.AcceptVisitor(completedTrackingVisitor);
}
public void StopVisitor()
{
var binaryTree = GetTestTree();
var visitor = new CompletedTrackingVisitor <int>();
var preVisitor = new PreOrderVisitor <int>(visitor);
binaryTree.DepthFirstTraversal(preVisitor);
}
public void CompletedVisitor()
{
var pascalSet = new PascalSet(0, 50, new[] { 15, 20, 30, 40, 34 });
var completedTrackingVisitor = new CompletedTrackingVisitor <int>();
pascalSet.AcceptVisitor(completedTrackingVisitor);
}
public void AcceptCompletedVisitor()
{
var generalTree = GetTestTree();
var completedTrackingVisitor = new CompletedTrackingVisitor <int>();
generalTree.AcceptVisitor(completedTrackingVisitor);
}
public void CompletedVisitor()
{
var pascalSet = new PascalSet(0, 50, new[] { 15, 20, 30, 40, 34 });
var completedTrackingVisitor = new CompletedTrackingVisitor<int>();
pascalSet.AcceptVisitor(completedTrackingVisitor);
}
public void StopVisitor()
{
var binaryTree = GetTestTree();
var visitor = new CompletedTrackingVisitor<int>();
var preVisitor = new PreOrderVisitor<int>(visitor);
binaryTree.DepthFirstTraversal(preVisitor);
}
public void CompletedVisitor2()
{
var bag = new Bag <string> {
"5", "4", "3", "2"
};
var visitor = new CompletedTrackingVisitor <string>();
bag.AcceptVisitor <string>(visitor);
}
public void CompletedVisitor1()
{
var bag = new Bag <string> {
"5", "4", "3", "2"
};
var visitor = new CompletedTrackingVisitor <KeyValuePair <string, int> >();
bag.AcceptVisitor <KeyValuePair <string, int> >(visitor);
}
public void Done()
{
var dequeeque = new Deque<int>();
dequeeque.EnqueueHead(5);
dequeeque.EnqueueHead(3);
dequeeque.EnqueueHead(2);
var visitor = new CompletedTrackingVisitor<int>();
dequeeque.AcceptVisitor(visitor);
}
public void Done()
{
var dequeeque = new Deque <int>();
dequeeque.EnqueueHead(5);
dequeeque.EnqueueHead(3);
dequeeque.EnqueueHead(2);
var visitor = new CompletedTrackingVisitor <int>();
dequeeque.AcceptVisitor(visitor);
}
public void DoneVisitor()
{
var skipList = new SkipList<int, string>();
for (var i = 0; i < 20; i++)
{
skipList.Add(i, i.ToString());
}
var completedTrackingVisitor = new CompletedTrackingVisitor<KeyValuePair<int, string>>();
skipList.AcceptVisitor(completedTrackingVisitor);
}
public void DoneVisitor()
{
var skipList = new SkipList <int, string>();
for (var i = 0; i < 20; i++)
{
skipList.Add(i, i.ToString());
}
var completedTrackingVisitor = new CompletedTrackingVisitor <KeyValuePair <int, string> >();
skipList.AcceptVisitor(completedTrackingVisitor);
}
public void CompletedVisitor()
{
var graph = new Graph<int>(false);
var vertices = new Vertex<int>[20];
for (var i = 0; i < 20; i++)
{
vertices[i] = new Vertex<int>(i);
graph.AddVertex(vertices[i]);
}
for (var i = 0; i < 17; i += 2)
{
var edge = new Edge<int>(vertices[i], vertices[i + 2], false);
graph.AddEdge(edge);
}
var completedTrackingVisitor = new CompletedTrackingVisitor<int>();
graph.AcceptVisitor(completedTrackingVisitor);
}
public void CompletedVisitor()
{
var graph = new Graph <int>(false);
var vertices = new Vertex <int> [20];
for (var i = 0; i < 20; i++)
{
vertices[i] = new Vertex <int>(i);
graph.AddVertex(vertices[i]);
}
for (var i = 0; i < 17; i += 2)
{
var edge = new Edge <int>(vertices[i], vertices[i + 2], false);
graph.AddEdge(edge);
}
var completedTrackingVisitor = new CompletedTrackingVisitor <int>();
graph.AcceptVisitor(completedTrackingVisitor);
}
public void Completed()
{
var binaryTree = GetTestTree();
var completedTrackingVisitor = new CompletedTrackingVisitor<int>();
binaryTree.AcceptVisitor(completedTrackingVisitor);
}
public void StoppingVisitor()
{
var circularQueue = CircularQueueTest.GetFullTestQueue();
var visitor = new CompletedTrackingVisitor<int>();
circularQueue.AcceptVisitor(visitor);
}
public void Done()
{
var priorityQueue = GetSimpleTestPriorityQueue();
var visitor = new CompletedTrackingVisitor<string>();
priorityQueue.AcceptVisitor(visitor);
}
public void Stopping()
{
var visitor = new CompletedTrackingVisitor<int>();
var heap = GetTestHeap();
heap.AcceptVisitor(visitor);
}
