-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedList.cpp
174 lines (174 loc) · 3.99 KB
/
LinkedList.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
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
template<class TYPE> class listnode
{
public:
TYPE data;
listnode<TYPE>* nextnode = 0;
listnode<TYPE>* lastnode = 0;
listnode(TYPE* a,listnode<TYPE>* b)
{
if(b!=0)
{
b->nextnode = this;
lastnode = b;
}
data = *a;
}
void die(listnode<TYPE>** startptr,listnode<TYPE>** endptr)
{
if(nextnode!=0)
{
nextnode->lastnode = lastnode;
}
else
{
*endptr = lastnode;
}
if(lastnode!=0)
{
lastnode->nextnode = nextnode;
}
else
{
*startptr = nextnode;
}
delete this;
}
void deleteall()
{
if(nextnode!=0)
{
nextnode->deleteall();
nextnode = 0;
}
delete this;
}
};
template<class TYPE> class LinkedList
{
public:
listnode<TYPE>* startptr = 0;
listnode<TYPE>* endptr = 0;
LinkedList() {}
void addmember(TYPE data)
{
listnode<TYPE>* traverse = startptr;
if(traverse == 0)
{
startptr = new listnode<TYPE>(&data,0);
return;
}
else
{
if(endptr == 0)
{
while(traverse->nextnode!=0)
{
traverse = traverse->nextnode;
}
endptr = traverse;
}
else
{
traverse = endptr;
}
traverse->nextnode = new listnode<TYPE>(&data,traverse);
endptr = traverse->nextnode;
}
}
listnode<TYPE>* getNode(int index)
{
listnode<TYPE>* traverse = startptr;
if(index == 0)return traverse;
int i = 0;
while(i!=index&&traverse!=0)
{
i++;
traverse = traverse->nextnode;
}
return traverse;
}
TYPE getData(int index)
{
return getNode(index)->data;
}
TYPE* getArray(TYPE delim)
{
int memberCount = 0;
listnode<TYPE>* traverse = startptr;
if(traverse!=0)memberCount++;
else
{
TYPE *fail = new TYPE;
*fail = delim;
return fail;
}
while(traverse->nextnode!=0)
{
traverse = traverse->nextnode;
memberCount++;
}
TYPE *outArray = new TYPE[memberCount+1];
outArray[memberCount] = delim;
traverse = startptr;
memberCount = 0;
while(traverse!=0)
{
outArray[memberCount] = traverse->data;
traverse = traverse->nextnode;
memberCount++;
}
return outArray;
}
~LinkedList()
{
startptr->deleteall();
}
};
inline void swap(Triangle &a,Triangle &b)
{
Triangle tmp = a;
a = b;
b = tmp;
}
int Split(Triangle* arrstart,int a,int b,float p, float* (*getattribute)(Triangle&))
{
int left = a;
int right = b;
while(left<right)
{
while(p<(*(getattribute(arrstart[right])))&&right>left)right--;
swap(arrstart[right],arrstart[left]);
while(p>=(*(getattribute(arrstart[left])))&&left<right)left++;
swap(arrstart[right],arrstart[left]);
}
return left;
}
void Sorttris(Triangle* arrstart,int a, int b, float* (*getattribute)(Triangle&))
{
int random;
if(b-a>0)
{
random = a+(rand()%(b-a));
}else
{
return;
}
swap(arrstart[a],arrstart[random]);
float pivot = *getattribute(arrstart[a]);
Triangle piv = arrstart[a];
int splitpoint;
if(b>a)
{
splitpoint = Split(arrstart,a,b,pivot,getattribute);
arrstart[splitpoint]=piv;
Sorttris(arrstart,a,splitpoint-1,getattribute);
Sorttris(arrstart,splitpoint+1,b,getattribute);
}
}
void Sorttris(Triangle* arrstart, float* (*getattribute)(Triangle&))
{
int count = 0;
while(arrstart[count++].notnullflag){};
count-=2;
Sorttris(arrstart,0,count,getattribute);
}