-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathch29.ixx
More file actions
184 lines (81 loc) · 2.61 KB
/
Copy pathch29.ixx
File metadata and controls
184 lines (81 loc) · 2.61 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
export module ch29;
import std;
export namespace ch29 {
namespace exercises {
namespace ex1 {
namespace myanswer {
using namespace std;
export class NameDB
{
public:
// Reads list of baby names in nameFile to populate the database.
// Throws invalid_argument if nameFile cannot be opened or read.
explicit NameDB(const std::string& nameFile);
// Returns the rank of the name (1st, 2nd, etc).
// Returns -1 if the name is not found.
int getNameRank(const std::string& name) const;
// Returns the number of babies with a given name.
// Returns -1 if the name is not found.
int getAbsoluteNumber(const std::string& name) const;
private:
std::unordered_map<std::string, int> m_names;
};
// Reads the names from the file and populates the database.
// The database is a map associating names with their frequency.
NameDB::NameDB(const string& nameFile)
{
// Open the file and check for errors.
ifstream inputFile{ nameFile };
if (!inputFile) {
throw invalid_argument{ "Unable to open file" };
}
// Read the names one at a time.
while (!inputFile.eof()) {
string name;
getline(inputFile, name);
m_names[name] += 1;
}
}
// Returns the rank of the name.
// First looks up the name to obtain the number of babies with that name.
// Then iterates through all the names, counting all the names with a higher
// count than the specified name. Returns that count as the rank.
int NameDB::getNameRank(const string& name) const
{
int num{ getAbsoluteNumber(name) };
// Check if we found the name.
if (num == -1) {
return -1;
}
// Now count all the names in the map that have?
// count higher than this one. If no name has a higher count,
// this name is rank number 1. Every name with a higher count
// decreases the rank of this name by 1.
int rank{ 1 };
for (auto& entry : m_names) {
if (entry.second > num) {
++rank;
}
}
return rank;
}
// Returns the count associated with the given name.
int NameDB::getAbsoluteNumber(const string& name) const
{
auto res{ m_names.find(name) };
if (res != end(m_names)) {
return res->second;
}
return -1;
}
void test()
{
NameDB boys{ "boys_long.txt" };
println("{}", boys.getNameRank("Daniel"));
println("{}", boys.getNameRank("Jacob"));
println("{}", boys.getNameRank("William"));
}
}
}
}
}