-
Notifications
You must be signed in to change notification settings - Fork 0
/
STL_utils.cpp
255 lines (221 loc) · 5.08 KB
/
STL_utils.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
#include "STL_utils.h"
#include "simpio.h"
#include <cassert>
bool ReverseStack(stack<int>& stk)
{
vector<int> vect_tmp;
while(!stk.empty())
{
vect_tmp.push_back(stk.top());
stk.pop();
}
for(vector<int>::iterator Itr = vect_tmp.begin();Itr != vect_tmp.end();++Itr)
{
stk.push(*Itr);
}
return true;
}
bool GenerateGeneralFibonacciNumbers(vector<int>& array, int init_1, int init_2)
{
if(!array.size()==0)
{
cout << "The vector is not empty!" << endl;
return false;
}
array.push_back(init_1);
array.push_back(init_2);
int tmp1, tmp2, sum;
tmp1=init_1;
tmp2=init_2;
const int RUNTIME = 20;
for(int i=2;i<=RUNTIME;i++)
{
sum=tmp1+tmp2;
array.push_back(sum);
tmp1 = tmp2;
tmp2 = sum;
}
return true;
}
bool CycleQueue(queue<int>& que, int iteration)
{
assert(iteration>=0);
int count=iteration;
while(count>0)
{
que.push(que.front());
que.pop();
count--;
}
return true;
}
bool CycleVector(vector<int>& vect, int iteration)
{
assert(iteration>=0);
vector<int>::size_type orig = vect.size();
// Bug fixed:
// the vector should be resize
// before further manipulation
vect.resize(orig+iteration);
vector<int>::iterator itr=vect.begin();
int count=iteration;
while(count>0)
{
*(itr+orig)=*itr;
++itr;
count--;
}
vect.erase(vect.begin(), vect.begin()+iteration);
return true;
}
bool CycleDeque(deque<int>& deq, int iteration)
{
assert(iteration>=0);
int count=iteration;
while(count>0)
{
deq.push_back(deq.front());
deq.pop_front();
count--;
}
return true;
}
void ClockVectorInsert()
{
// Input from file and generate a container
// with string
vector<string> strs;
string str_tmp;
// cout << "Please specify input file: ";
// str_tmp=GetLine();
// if(str_tmp=="\n")
ifstream input("input_test.htm");
// else
// ifstream input(str_tmp.c_str());
if(!input.is_open())
{
cerr << "Failed in opening file: "
<< str_tmp << endl;
return;
}
while(true)
{
str_tmp="";
getline(input,str_tmp);
if(input.eof()&&input.fail())
break;
strs.push_back(str_tmp);
}
vector<string>::size_type linenum=strs.size();
// Clock with no reserve
clock_t test_orig=clock();
vector<string> vect;
for(vector<string>::iterator itr=strs.begin();
itr!=strs.end();
++itr)
{
vect.push_back(*itr);
}
test_orig=clock()-test_orig;
clock_t test_rsv=clock();
vector<string> vect_rsv;
vect_rsv.resize(linenum);
for(vector<string>::iterator itr=strs.begin();
itr!=strs.end();
++itr)
{
vect_rsv.push_back(*itr);
}
test_rsv=clock()-test_rsv;
cout << "Test without reserve: "
<< ((double)(test_orig)/CLOCKS_PER_SEC)
<< " seconds." << endl;
cout << "Test with reserve: "
<< ((double)(test_rsv)/CLOCKS_PER_SEC)
<< " seconds." << endl;
}
bool CountLetters(ifstream& input, map<char,int>& table)
{
char tmp;
while(true)
{
input.get(tmp);
if(input.eof()&&input.fail())
break;
table[tmp]+=1;
}
for(map<char,int>::iterator itr=table.begin();
itr!=table.end();
++itr)
{
cout << itr->first <<" : " << itr->second << endl;
}
return true;
}
vector<int> SetSortVector(vector<int>& origin)
{
multiset<int> bufset;
for(vector<int>::iterator itr=origin.begin();
itr!=origin.end();
++itr)
{
bufset.insert(*itr);
}
vector<int> sortedvect;
sortedvect.reserve(origin.size());
for(multiset<int>::iterator itr=bufset.begin();
itr!=bufset.end();
++itr)
{
sortedvect.push_back(*itr);
}
return sortedvect;
}
vector<int> ListSortVector(vector<int>& origin)
{
list<int> buflist;
for(vector<int>::iterator itr=origin.begin();
itr!=origin.end();
++itr)
{
buflist.push_back(*itr);
}
buflist.sort();
vector<int> sortedvect;
sortedvect.reserve(origin.size());
for(list<int>::iterator itr=buflist.begin();
itr!=buflist.end();
++itr)
{
sortedvect.push_back(*itr);
}
return sortedvect;
}
int NumUniqueCharacters(string& toCount)
{
set<char> table(toCount.begin(),toCount.end());
/*
for(set<char>::iterator itr=table.begin();
itr!=table.end();
++itr)
{
cout << *itr << endl;
}
*/
return table.size();
}
set<string> LoadAllTokens(string& filename)
{
ifstream rawdata(filename.c_str());
set<string> tokens;
istream_iterator<string> rawitr(rawdata);
istream_iterator<string> eos;
insert_iterator<set<string> > tkitr(tokens,tokens.begin());
while(rawitr!=eos)
{
*tkitr=*rawitr;
++tkitr;
++rawitr;
}
return tokens;
}