-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTrackList.cpp
More file actions
222 lines (204 loc) · 3.41 KB
/
TrackList.cpp
File metadata and controls
222 lines (204 loc) · 3.41 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
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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
#include "Album.h"
#include "Artist.h"
#include "Track.h"
#include "TrackList.h"
TrackList::TrackList()
{
ID = 0;
Track_Count = 0;
}
int TrackList::ReCount()
{
IDTrack* IDTr = IDs.GetpHead();
int i = 0;
while (IDTr)
{
i++;
IDTr = IDTr->pNext;
}
Track_Count = i;
return Track_Count;
}
void TrackList::Set(int IDd, int Count, ListTracks list, string path)
{
ID = IDd;
Track_Count = Count;
IDs = list;
Path = path;
}
void TrackList::UploadTrackList(string path)
{
ifstream file(path);
if (!file.is_open())
{
throw "Tracklist table is not open";
}
else
{
int pos1;
string str;
getline(file, str);
pos1 = str.find('|');
int IDAl = stoi(str.substr(0, pos1));
int Count = stoi(str.substr(pos1 + 1, str.length() - pos1 - 1));
ListTracks list = ListTracks();
int i = 0;
while (i < Count)
{
getline(file, str);
list.Add(stoi(str));
i++;
}
Set(IDAl, Count, list, path);
}
Path = path;
file.close();
}
bool TrackList::Exists(int Name)
{
IDTrack* NodeCell = IDs.GetpHead();
while (NodeCell)
{
int Cell = NodeCell->ID;
if (Name == Cell)
{
return true;
}
NodeCell = NodeCell->pNext;
}
return false;
}
bool TrackList::operator==(TrackList Cell)
{
if (ID == Cell.ID)
return true;
return false;
}
void TrackList::Add(int IDTr)
{
IDs.Add(IDTr);
}
void TrackList::UpdateFile()
{
ofstream file;
file.open(Path, std::ofstream::out | std::ofstream::trunc);
if (!file.is_open())
{
throw "Tracklist table is not open";
}
file << to_string(ID) + '|' + to_string(ReCount());
IDTrack* IDTr = IDs.GetpHead();
while (IDTr)
{
cout << IDTr << endl;
file << '\n';
file << to_string(IDTr->ID);
IDTr = IDTr->pNext;
}
file.close();
}
void TrackList::DeleteTrack(int ID)
{
IDTrack IDTr = IDs.GetIDTrackByID(ID);
IDs.DeleteNode(IDTr);
cout << "The track deleted from tracklist" << endl;
}
void TrackList::PrintListOfIDs()
{
IDTrack* NodeCell = IDs.GetpHead();
while (NodeCell)
{
cout << NodeCell->ID << endl;
NodeCell = NodeCell->pNext;
}
}
IDTrack::IDTrack(int id)
{
ID = id;
pNext = nullptr;
pPrev = nullptr;
}
ListTracks::ListTracks()
{
pHead = nullptr;
pTail = nullptr;
Size = 0;
}
void ListTracks::Add(int Cell)
{
IDTrack* newTail = new IDTrack(Cell);
if (pTail == nullptr)
{
pHead = pTail = newTail;
Size++;
return;
}
pTail->pNext = newTail;
newTail->pPrev = pTail;
pTail = newTail;
Size++;
return;
}
IDTrack* ListTracks::GetpHead()
{
return pHead;
}
void ListTracks::DeleteNode(IDTrack Cell)
{
IDTrack* Curr = pHead;
while (Curr) {
if (Curr->ID == Cell.ID)
{
if (Curr == pHead)
{
IDTrack* Del = Curr->pNext->pPrev;
Curr->pNext->pPrev = Curr->pPrev;
pHead = Curr->pNext;
delete Del;
break;
}
else
{
if (Curr == pTail)
{
IDTrack* Del = Curr->pPrev->pNext;
Curr->pPrev->pNext = Curr->pNext;
pTail = Curr->pPrev;
delete Del;
break;
}
else
{
IDTrack* Del = Curr->pPrev->pNext;
Curr->pNext->pPrev = Curr->pPrev;
Curr->pPrev->pNext = Curr->pNext;
delete Del;
break;
}
}
}
Curr = Curr->pNext;
}
}
IDTrack ListTracks::GetIDTrackByID(int ID)
{
IDTrack* NodeCell = GetpHead();
while (NodeCell)
{
if (ID == NodeCell->ID)
{
return *NodeCell;
}
NodeCell = NodeCell->pNext;
}
}
bool IDTrack::operator==(IDTrack Cell)
{
if (ID == Cell.ID)
return true;
return false;
}