-
Notifications
You must be signed in to change notification settings - Fork 0
/
TableDriver.cpp
74 lines (57 loc) · 1.21 KB
/
TableDriver.cpp
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
#include "TableSortedList.h"
#include "ListArray.h"
using CSC2110::ListArray;
#include "ListArrayIterator.h"
using CSC2110::ListArrayIterator;
#include "CD.h"
using CSC2110::CD;
#include "Text.h"
using CSC2110::String;
#include <iostream>
using namespace std;
void deleteCDs(ListArray<CD>* list)
{
ListArrayIterator<CD>* iter = list->iterator();
while(iter->hasNext())
{
CD* cd = iter->next();
delete cd;
}
delete iter;
}
void displayTitles(TableSortedList<CD>* s)
{
ListDoublyLinkedIterator<CD>* i = s->iterator();
while(i->hasNext())
{
i->next()->getKey()->displayString();
cout << endl;
}
}
void displayCDs(TableSortedList<CD>* s)
{
ListDoublyLinkedIterator<CD>* i = s->iterator();
while(i->hasNext())
{
i->next()->displayCD();
cout << endl;
}
}
int main()
{
ListArray<CD>* cds = CD::readCDs("cds.txt");
int num_items = cds->size();
cout << num_items << endl;
TableSortedList<CD>* slt = new TableSortedList<CD>(&CD::compare_items, &CD::compare_keys);
//DO THIS
//thoroughly test your table
for(int c = 0; c < num_items; c++)
{
slt->tableInsert(cds->get(c+1));
}
displayTitles(slt);
deleteCDs(cds);
delete cds;
delete slt;
return 0;
}