-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathwy_vector.cpp
More file actions
222 lines (220 loc) · 4.61 KB
/
wy_vector.cpp
File metadata and controls
222 lines (220 loc) · 4.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
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
#include<stdlib.h>
#include<cstddef>
#ifndef VECTOR_WY
#define VECTOR_WY
template<typename T>
class vector
{
public:
using iterator=T*;
using difference_type=ptrdiff_t;
using const_iterator=T*;
using value_type=T;
class reverse_iterator
{
private :
T* t;
public:
reverse_iterator(T *_t = nullptr) : t(_t){}
reverse_iterator& operator++()
{
return t;
}
reverse_iterator& operator--()
{
return t;
}
reverse_iterator operator++( int )
{
return --t;
}
reverse_iterator operator--( int )
{
return ++t;
}
reverse_iterator& operator+=( difference_type n )
{
return t;
}
reverse_iterator& operator-=( difference_type n )
{
return t;
}
};
private :
size_t thesize;
size_t thecapacity;
T* Obj;
public:
vector ()
{
thesize=0;
thecapacity=5;
Obj=new T*[thecapacity];
}
explicit vector( size_t count )
{
thesize=count;
thecapacity=2*count+1;
Obj=new T*[thecapacity];
}
vector(size_t count,value_type n)
{
thesize=count;
thecapacity=2*count+1;
Obj=new T*[thecapacity];
for(auto i=0;i<count;i++)
Obj[i]=n;
}
~vector()
{
delete[] Obj;
}
void push_back(size_t n)
{
if(thesize==thecapacity)
{
reserve(2*thesize+1);
}
Obj[thesize++]=n;
}
void pop_back()
{
thesize--;
}
void assign(size_t count,value_type value)
{
if(thesize<count)
{
auto i=0;
for(;i<thesize;i++)
Obj[i]=value;
for(;i<count;i++)
push_back(value);
}
else
{
thesize=count;
for(auto i=0;i<thesize;i++)
Obj[i]=value;
}
}
iterator at(size_t pos )
{
if(pos>thesize||pos<0)
return 0;
return pos;
}
T* data() noexcept
{
return Obj;
}
iterator begin()
{
return Obj;
}
const_iterator cbegin() const noexcept
{
return Obj;
}
iterator end()
{
return Obj+thesize;
}
const_iterator cend() const noexcept
{
return Obj+thesize;
}
reverse_iterator rbegin()
{
return Obj+thesize-1;
}
const reverse_iterator rbegin() const noexcept
{
return Obj+thesize-1;
}
reverse_iterator rend()
{
return Obj-1;
}
const reverse_iterator rend() const noexcept
{
return Obj-1;
}
bool empty() const
{
if(thesize==0)
return 1;
else
return 0;
}
size_t size()const
{
return thesize;
}
void reserve(size_t new_cap)
{
if(thesize>=new_cap)
return;
T* Objs=Obj;
T* Obj=new T* [thecapacity];
for(auto i=0;i<thecapacity;i++)
Obj[i]=Objs[i];
delete [] Objs;
}
size_t capacity() const
{
return capacity;
}
void shrink_to_fit()
{
thecapacity=thesize;
T* Objs=Obj;
T* newdata=new T* [thecapacity];
for(auto i=0;i<thecapacity;i++)
newdata[i]=Obj[i];
Obj=newdata;
delete [] Objs;
}
void clear()
{
thesize=0;
}
void insert(size_t pos,value_type value )
{
thesize++;
if(thesize==thecapacity)
{
reserve(2*thesize+1);
}
for(auto i=pos;i<thesize;i++)
Obj[i+1]=Obj[i];
Obj[pos]=value;
}
void erase(size_t pos)
{
thesize--;
for(auto i=pos;i<thesize;i++)
Obj[i]=Obj[i+1];
return begin()+pos;
}
void resize(size_t count )
{
if(thesize<=count)
reserve(count*2+1);
thesize=count;
}
void swap( vector& other )
{
T* Objs=Obj;
Obj=other.Obj;
other.Obj=Objs;
size_t tempsize=thesize;
thesize=other.thesize;
other.thesize=tempsize;
size_t tempcapacity=thecapacity;
thecapacity=other.thecapacity;
other.thecapacity=tempcapacity;
}
};
#endif