-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathUser.cpp
executable file
·169 lines (129 loc) · 2.82 KB
/
User.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
/*
* User.cpp
*
* Created on: 27 áãöî 2018
* Author: nave
*/
#include"User.h"
#include"Person.h"
#include <typeinfo>
User::User(const string& fpName) :name(fpName) , pastStatus() , friends()
{
numOfFriends = 0;
numOfStatuses = 0;
}
User::User(const User& copy) :name(copy.name) , pastStatus(copy.pastStatus),numOfStatuses(copy.numOfStatuses), friends(copy.friends) ,numOfFriends(copy.numOfFriends)
{
for (int i = 0; i < numOfStatuses; i++)
{
pastStatus[i] = new Status(*(copy.pastStatus[i]));
//pastStatus.push_back(new Status(*(copy.pastStatus[i])));
}
}
User::~User()
{
for (int i = 0; i < numOfStatuses; i++)
{
delete pastStatus[i];
}
}
const string& User::getName() const
{
return name;
}
bool User::isPersonFriend(const Person& fanToFind) const
{
bool isFound = false;
for (int i = 0;!isFound && i < numOfFriends; i++)
{
isFound = areEquals(fanToFind,*(friends[i]));
}
return isFound;
}
void User::addFriend(Person& sub)
{
if (!isPersonFriend(sub))
{
friends.push_back(&sub);
//friends[numOfFriends] = ⊂
numOfFriends++;
}
}
void User::addStatus(Status& sub)
{
pastStatus.push_back(&sub);
numOfStatuses++;
}
// this function allocates new status
void User::addStatus(STATUSTYPE sType,const string& sContent)
{
Status* stat = new Status(sType, sContent , name);
addStatus(*stat);
}
int User::getNumOfStatuses() const
{
return numOfStatuses;
}
int User::getNumOfFriends() const
{
return numOfFriends;
}
const vector<Status*>& User::getPastStatus() const
{
return pastStatus;
}
const vector<Person*>& User::getFriends() const
{
return friends;
}
void User::printLastStatuses(int num) const
{
if (num > numOfStatuses)
{
cout <<"there are only " << numOfStatuses << " statuses" << endl;
num = numOfStatuses;
}
if (num <= numOfStatuses) {
for(int i = 0; i < num; i++)
{
pastStatus[numOfStatuses - i -1]->show();
}
}
}
void User::showFriends(int num) const
{
if (num > numOfFriends)
{
cout <<"there are only " << numOfFriends << " friends" << endl;
num = numOfFriends;
}
for(int i = 0; i < num; i++)
{
cout << friends[numOfFriends - i -1]->getName() << endl;
}
}
void User::show() const
{
cout << "User: " << name << endl;
}
int User::compare(const User& other) const
{
return(name.compare(other.getName()));
}
int compare(const User& p1,const User& p2)
{
return(p1.getName().compare(p2.getName()));
}
bool areEquals(const User& p1, const User& p2)
{
return (compare(p1,p2) == 0);
}
bool User::operator>(const User& other) const
{
return (this->getNumOfFriends() > other.getNumOfFriends());
}
const User& User::operator+=(Person& personToAdd)
{
addFriend(personToAdd);
return *this;
}