forked from jaege/Cpp-Primer-5th-Exercises
-
Notifications
You must be signed in to change notification settings - Fork 0
/
StrVec.cpp
150 lines (129 loc) · 3.88 KB
/
StrVec.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
#include <utility> // move
#include <algorithm> // equal
#include <iostream>
#include "StrVec.h"
std::allocator<std::string> StrVec::alloc;
StrVec::StrVec(std::initializer_list<std::string> il) : StrVec() {
for (const auto &s : il)
push_back(s);
}
std::pair<std::string *, std::string *>
StrVec::alloc_n_copy(const std::string *b, const std::string *e) {
auto b2 = alloc.allocate(e - b);
return {b2, std::uninitialized_copy(b, e, b2)};
}
void StrVec::reallocate() {
auto new_cap_sz = size() ? 2 * size() : 1;
auto new_first_elem = alloc.allocate(new_cap_sz);
auto new_first_free = new_first_elem;
auto old_first_elem = first_elem;
for (size_type i = 0; i != size(); ++i)
alloc.construct(new_first_free++, std::move(*old_first_elem++));
free();
first_elem = new_first_elem;
first_free = new_first_free;
cap = first_elem + new_cap_sz;
}
void StrVec::free() {
if (first_elem) {
for (auto p = first_free; p != first_elem; alloc.destroy(--p)) { }
alloc.deallocate(first_elem, cap - first_elem);
//first_elem = first_free = cap = nullptr;
}
}
StrVec::~StrVec() {
free();
}
StrVec::StrVec(const StrVec &rhs) {
std::cout << "StrVec::StrVec(const StrVec &rhs)" << std::endl;
auto data = alloc_n_copy(rhs.begin(), rhs.end());
first_elem = data.first;
first_free = cap = data.second;
}
StrVec &StrVec::operator=(const StrVec &rhs) {
std::cout << "StrVec::operator=(const StrVec &rhs)" << std::endl;
auto data = alloc_n_copy(rhs.begin(), rhs.end());
free();
first_elem = data.first;
first_free = cap = data.second;
return *this;
}
StrVec::StrVec(StrVec &&rhs) noexcept
: first_elem(rhs.first_elem), first_free(rhs.first_free), cap(rhs.cap) {
std::cout << "StrVec::StrVec(StrVec &&rhs)" << std::endl;
rhs.first_elem = rhs.first_free = rhs.cap = nullptr;
}
StrVec &StrVec::operator=(StrVec &&rhs) noexcept {
std::cout << "StrVec::operator=(StrVec &&rhs)" << std::endl;
if (this != &rhs) {
free();
first_elem = rhs.first_elem;
first_free = rhs.first_free;
cap = rhs.cap;
rhs.first_elem = rhs.first_free = rhs.cap = nullptr;
}
return *this;
}
StrVec &StrVec::operator=(std::initializer_list<std::string> il) {
auto data = alloc_n_copy(il.begin(), il.end());
free();
first_elem = data.first;
first_free = cap = data.second;
return *this;
}
void StrVec::push_back(const std::string &s) {
chk_n_alloc();
alloc.construct(first_free++, s);
}
void StrVec::pop_back() {
if (size() > 0)
alloc.destroy(--first_free);
}
void StrVec::reserve(size_type n) {
if (n > capacity()) {
auto new_first_elem = alloc.allocate(n);
auto new_first_free = new_first_elem;
auto old_first_elem = first_elem;
for (size_type i = 0; i != size(); ++i)
alloc.construct(new_first_free++, std::move(*old_first_elem++));
free();
first_elem = new_first_elem;
first_free = new_first_free;
cap = first_elem + n;
}
}
void StrVec::resize(size_type n, const std::string &s) {
if (n > size()) {
for (int i = n - size(); i != 0; --i)
push_back(s);
} else if (n < size()) {
for (int i = size() - n; i != 0; --i)
pop_back();
}
}
bool operator==(const StrVec &lhs, const StrVec &rhs) {
// compare value
return lhs.size() == rhs.size() &&
std::equal(lhs.begin(), lhs.end(), rhs.begin());
}
bool operator!=(const StrVec &lhs, const StrVec &rhs) {
return !(lhs == rhs);
}
bool operator<(const StrVec &lhs, const StrVec &rhs) {
auto lit = lhs.begin(), rit = rhs.begin();
for (; lit != lhs.end() && rit != rhs.end(); ++lit, ++rit)
if (*lit < *rit)
return true;
else if (*rit < *lit)
return false;
return lit == lhs.end() && rit != rhs.end();
}
bool operator>(const StrVec &lhs, const StrVec &rhs) {
return rhs < lhs;
}
bool operator<=(const StrVec &lhs, const StrVec &rhs) {
return !(lhs > rhs);
}
bool operator>=(const StrVec &lhs, const StrVec &rhs) {
return !(lhs < rhs);
}