-
Notifications
You must be signed in to change notification settings - Fork 0
/
Account.cpp
479 lines (361 loc) · 13.1 KB
/
Account.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
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
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
/****************************************************************************************************************************
Title : Account.hpp
Author : modified by Kasaf Shah
Description : header/interface files for Account class
Date : 12/09/2022
****************************************************************************************************************************/
#include "Account.hpp"
//default constructor
//@post: set username and password to ""
// creates an empty vector of post objects to store into feed_
Account::Account()
{
username_ = "";
password_ = "";
posts_ = LinkedList<Post*>();
following_ = {};
}
/**
Parameterized Constructor
@param username : username of the account, stored into username_
@param password : password of the account, stored into password_
@post: sets the private members to the value of the parameters
*/
Account::Account(std::string username, std::string password) : username_(username), password_(password), posts_(LinkedList<Post*>()), following_({}), net_(nullptr) { }
/**
@return: the username of the Account
*/
std::string Account::getUsername() const { return username_; }
/**
@param: a reference to the username of the Account
@psot: sets the parameter to the value of the private member
*/
void Account::setUsername(const std::string& username) { username_ = username; }
/**
@return: the password of the Account
*/
std::string Account::getPassword() const { return password_; }
/**
@param a reference to the password of the Account
@post: sets the private member to the value of the parameter
*/
void Account::setPassword(const std::string& password) { password_ = password; }
/**
Accessor function
@return : the pointer to the Network the account is in
*/
Network<Account>* Account::getNetwork() const { return net_; }
/**
Mutator function
@param : a pointer to a Network
@post : the Network pointer private member points to the input Network
*/
void Account::setNetwork(Network<Account>* network) { net_ = network; }
/**
@param newPost : The pointer to the Post object that will be added to its list
@return : Will return true if a post gets added sucesfully to the vector
@post: " Adds post to posts_ and its Networks feed_. Additionally adds posts
to a stack and sorts them according to likes.
*/
bool Account::addPost(Post* newPost){
posts_.insert(newPost, 0);
net_->addToFeed(newPost);
if(max_stack.empty() && min_stack.empty()){
max_stack.push(newPost);
min_stack.push(newPost);
}
else{
std::stack<Post*> temp_max;
std::stack<Post*> temp_min;
// deal with the max_stack
while(!max_stack.empty() && max_stack.top()->getLikes() >= newPost->getLikes() ){
temp_max.push(max_stack.top());
max_stack.pop();
}
max_stack.push(newPost);
while(!temp_max.empty())
{
max_stack.push(temp_max.top());
temp_max.pop();
}
//deal with min stack
while(!min_stack.empty()&& min_stack.top()->getLikes() < newPost->getLikes()){
temp_min.push(min_stack.top());
min_stack.pop();
}
min_stack.push(newPost);
while(!temp_min.empty())
{
min_stack.push(temp_min.top());
temp_min.pop();
}
}
return true;
}
/*
@post: Prints the feed_ that contains the post objects by calling their display function
*/
void Account::viewPosts() const {
Node<Post*>* itt = posts_.getHeadPtr();
while (itt != nullptr) {
itt->getItem()->displayPost();
itt = itt->getNext();
}
}
/**
@param : the username of the Account to follow
@return : true if the account was successfully able to follow, false otherwise
@post : adds the username to the vector of following accounts only if
it is affiliated to a Network AND it is not already following an account
with the same username.
*/
bool Account::followAccount(const std::string username){
bool exists = false;
for(std::string un : following_) {
if(un == username) {
exists = true;
}
}
if(!exists && net_ != nullptr) {
following_.push_back(username);
return true;
}
return false;
}
/**
@return : the vector of usernames the Account is following
*/
std::vector<std::string> Account::viewFollowing() const {
return following_;
}
/**
@return : true if account has same private members as parameter,
false otherwise
*/
bool Account::operator==(const Account &acc) const {
if(acc.getUsername() == this->username_ && acc.getPassword() == this->password_) {
return true;
}
return false;
}
/*
@param : A pointer to a Post
@return : True iff the Post was successfully found and removed,
false othewise.
@post : Removes the given Post from its list
as well as from the Network's feed. Additionaly the post is removed from the stack
as well based on the way it is sorted
*/
bool Account::removePost(Post* post){
int postPosition = posts_.getIndexOf(post);
if (postPosition > -1) {
posts_.remove(postPosition);
net_->removePostFromFeed(post);
if(max_stack.empty() && min_stack.empty()){
return false;
}
else{
std::stack<Post*> temp;
std::stack<Post*> temp2;
bool removed= true;
while(!min_stack.empty() && removed){
if(min_stack.top() != post){
temp.push(min_stack.top());
min_stack.pop();
}
else {
min_stack.pop();
removed=false;
}
}
removed=true;
while(!max_stack.empty() && removed){
if(max_stack.top() != post){
temp2.push(max_stack.top());
max_stack.pop();
}
else {
max_stack.pop();
removed=false;
}
}
while(!temp2.empty() && !temp.empty()){
max_stack.push(temp2.top());
temp2.pop();
}
while(!temp.empty())
{
min_stack.push(temp.top());
temp.pop();
}
}
return true;
}
}
/*
@param : Pointer to a Post object
@param : The new title of the Post (or an empty string if you do not
want to change it)
@param : The new body of the Post (or an empty string if you do not
want to change it)
@post : This function will take the Post and given the new title and body,
update the Posts title and body as appropriate. It will also update
the `timestamp_` to the current time of the update. This function should then
update the location of the Post in its list of `posts_` to the front of the list
as well as utilizing its Network pointer to do the same in the `feed_`.
*/
void Account::updatePost(Post* post, std::string new_title, std::string new_body) {
if(new_title != "") { post->setTitle(new_title); }
if(new_body != "") { post->setBody(new_body); }
post->updateTimeStamp();
removePost(post);
addPost(post);
}
/*
@return : a pointer to the Post with least likes
*/
Post* Account::getMinLikes(){
if(min_stack.empty())
return nullptr;
return min_stack.top();
}
/*
@return : a pointer to the Post with most likes
*/
Post* Account::getMaxLikes(){
if(max_stack.empty())
return nullptr;
return max_stack.top();
}
/*
@return : a vector of pointers to Post
@post : the order of the Posts in the vector is by increasing
priority, and within each priority class, from oldest
to newest
*/
std::vector<Post*> Account::increasingPriorityOldestToNewest(){
std::stack<Post*> high, medium, low;
Node<Post*>* itt = posts_.getHeadPtr();
while (itt != nullptr) {
if(itt->getItem()->getPriority() == Post::HIGH)
high.push(itt->getItem());
else if(itt->getItem()->getPriority() == Post::MEDIUM)
medium.push(itt->getItem());
else
low.push(itt->getItem());
itt = itt->getNext();
}
std::vector<Post*> result;
while(!low.empty()) {
result.push_back(low.top());
low.pop();
}
while(!medium.empty()) {
result.push_back(medium.top());
medium.pop();
}
while(!high.empty()) {
result.push_back(high.top());
high.pop();
}
return result;
}
/*
@return : a vector of pointers to Post
@post : the order of the Posts in the vector is by increasing
priority, and within each priority class, from newest
to oldest
*/
std::vector<Post*> Account::increasingPriorityNewestToOldest(){
std::queue<Post*> high, medium, low;
Node<Post*>* itt = posts_.getHeadPtr();
while (itt != nullptr) {
if(itt->getItem()->getPriority() == Post::HIGH)
high.push(itt->getItem());
else if(itt->getItem()->getPriority() == Post::MEDIUM)
medium.push(itt->getItem());
else
low.push(itt->getItem());
itt = itt->getNext();
}
std::vector<Post*> result;
while(!low.empty()) {
result.push_back(low.front());
low.pop();
}
while(!medium.empty()) {
result.push_back(medium.front());
medium.pop();
}
while(!high.empty()) {
result.push_back(high.front());
high.pop();
}
return result;
}
/*
@return : a vector of pointers to Post
@post : the order of the Posts in the vector is by decreasing
priority, and within each priority class, from oldest
to newest
*/
std::vector<Post*> Account::decreasingPriorityOldestToNewest(){
std::stack<Post*> high, medium, low;
Node<Post*>* itt = posts_.getHeadPtr();
while (itt != nullptr) {
if(itt->getItem()->getPriority() == Post::HIGH)
high.push(itt->getItem());
else if(itt->getItem()->getPriority() == Post::MEDIUM)
medium.push(itt->getItem());
else
low.push(itt->getItem());
itt = itt->getNext();
}
std::vector<Post*> result;
while(!high.empty()) {
result.push_back(high.top());
high.pop();
}
while(!medium.empty()) {
result.push_back(medium.top());
medium.pop();
}
while(!low.empty()) {
result.push_back(low.top());
low.pop();
}
return result;
}
/*
@return : a vector of pointers to Post
@post : the order of the Posts in the vector is by decreasing
priority, and within each priority class, from newest
to oldest
*/
std::vector<Post*> Account::decreasingPriorityNewestToOldest(){
std::queue<Post*> high, medium, low;
Node<Post*>* itt = posts_.getHeadPtr();
while (itt != nullptr) {
if(itt->getItem()->getPriority() == Post::HIGH)
high.push(itt->getItem());
else if(itt->getItem()->getPriority() == Post::MEDIUM)
medium.push(itt->getItem());
else
low.push(itt->getItem());
itt = itt->getNext();
}
std::vector<Post*> result;
while(!high.empty()) {
result.push_back(high.front());
high.pop();
}
while(!medium.empty()) {
result.push_back(medium.front());
medium.pop();
}
while(!low.empty()) {
result.push_back(low.front());
low.pop();
}
return result;
}