-
Notifications
You must be signed in to change notification settings - Fork 131
Expand file tree
/
Copy pathSingleLinkList.cc
More file actions
124 lines (110 loc) · 3.05 KB
/
SingleLinkList.cc
File metadata and controls
124 lines (110 loc) · 3.05 KB
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
123
124
/*
* NIST STEP Core Class Library
* clstepcore/SingleLinkList.cc
* April 1997
* David Sauder
* KC Morris
* Development of this software was funded by the United States Government,
* and is not subject to copyright.
*/
#include <SingleLinkList.h>
#include "sc_memmgr.h"
#include <iostream>
SingleLinkList::SingleLinkList() : head( 0 ), tail( 0 ) {
}
SingleLinkList::~SingleLinkList() {
Empty();
}
void SingleLinkList::Empty() {
SingleLinkNode * tmp = head;
while( tmp ) {
tmp = head -> NextNode();
delete head;
head = tmp;
}
}
SingleLinkNode * SingleLinkList::NewNode() {
// defined in subtypes
std::cerr << "\n\n******BUG****** a virtually defined function should \n"
<< "be called for SingleLinkList::NewNode()\n\n";
return new SingleLinkNode();
}
SingleLinkNode * SingleLinkList::GetHead() const {
return ( head );
}
int SingleLinkList::EntryCount() const {
int entryCount = 0;
SingleLinkNode * entryPtr = head;
while( entryPtr != 0 ) {
entryPtr = entryPtr->NextNode();
entryCount++;
}
return entryCount;
}
void SingleLinkList::DeleteFollowingNodes( SingleLinkNode * item ) {
if( head ) {
SingleLinkNode * trailer = 0;
SingleLinkNode * leader = head;
while( leader ) {
if( leader == item ) {
while( leader ) {
if( trailer ) {
trailer->next = leader->next;
} else if( leader == head ) {
head = leader->next;
trailer = head;
}
if( leader == tail ) {
tail = trailer;
}
delete leader;
leader = trailer->next;
}
} else {
if( trailer ) {
trailer = trailer->NextNode();
} else {
trailer = leader;
}
leader = leader->NextNode();
}
}
}
}
void SingleLinkList::AppendNode( SingleLinkNode * item ) {
if( head ) {
tail -> next = item;
tail = item;
} else {
head = tail = item;
}
item->owner = this;
}
void SingleLinkList::DeleteNode( SingleLinkNode * item ) {
if( head ) {
SingleLinkNode * trailer = 0;
SingleLinkNode * leader = head;
while( leader ) {
if( leader == item ) {
if( trailer ) {
trailer->next = leader->next;
}
leader = leader->next;
if( item == head ) {
head = item->next;
}
if( item == tail ) {
tail = trailer;
}
delete item;
} else {
if( trailer ) {
trailer = trailer->NextNode();
} else {
trailer = leader;
}
leader = leader->NextNode();
}
}
}
}