-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlist.h
86 lines (71 loc) · 2.27 KB
/
list.h
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
#ifndef _H_list
#define _H_list
#include <deque>
#include "utility.h" // for Assert()
using namespace std;
class Node;
/**
* A custom deque-based class for storing and manipulating lists of objects in the abstract syntax tree.
*/
template<class Element> class List {
private:
deque<Element> elems;
public:
/**
* default constructor, creates an empty list.
*/
List() {}
/**
* returns the number of elements currently in the list.
* @return number of elements in list
*/
int NumElements() const
{ return elems.size(); }
/**
* Returns element at index in list. Indexing is 0-based.
* Raises assert if index out of range
* @param index index of element to be returned
* @return element at the desired index
*/
Element Nth(int index) const
{ Assert(index >= 0 && index < NumElements());
return elems[index]; }
/**
* Inserts element at index, shuffling over others
* Raises assert if index out of range
* @param elem element to be inserted
* @param index index at which element is to be inserted
*/
void InsertAt(const Element &elem, int index)
{ Assert(index >= 0 && index <= NumElements());
elems.insert(elems.begin() + index, elem); }
/**
* Adds element to list end
* @param elem element to be added
*/
void Append(const Element &elem)
{ elems.push_back(elem); }
/**
* Removes element at index, shuffling down others
* Raises assert if index out of range
* @param index index at which element is to be removed
*/
void RemoveAt(int index)
{ Assert(index >= 0 && index < NumElements());
elems.erase(elems.begin() + index); }
/**
* Sets node p as the parent for each node in the list
* @param p parent-to-be node
*/
void SetParentAll(Node *p)
{ for (int i = 0; i < NumElements(); i++)
Nth(i)->SetParent(p); }
/**
* Prints all nodes in the list with an appropriate indentation level
* @param indentLevel indentation level at which the list is to be printed
*/
void PrintAll(int indentLevel, const char *label = NULL)
{ for (int i = 0; i < NumElements(); i++)
Nth(i)->Print(indentLevel, label); }
};
#endif