-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvector.cpp
More file actions
97 lines (95 loc) · 1.76 KB
/
vector.cpp
File metadata and controls
97 lines (95 loc) · 1.76 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
#pragma once
#include <iostream>
template <typename T>
class Vector
{
T *array;
int size_;
int capacity;
public:
Vector()
{
array = new T[1];
size_ = 0;
capacity = 1;
}
void push_back(T &data)
{
if (size_ == capacity)
{
T *temp = new T[2 * capacity];
for (int i = 0; i < capacity; i++)
{
temp[i] = array[i];
}
delete[] array;
capacity *= 2;
array = temp;
}
array[size_] = data;
size_++;
}
void push_back(const T &data)
{
if (size_ == capacity)
{
T *temp = new T[2 * capacity];
for (int i = 0; i < capacity; i++)
{
temp[i] = array[i];
}
delete[] array;
capacity *= 2;
array = temp;
}
array[size_] = data;
size_++;
}
T pop_back()
{
size_--;
return array[size_];
}
T pop_front()
{
T temp = array[0];
for (int i = 0; i < size_ - 1; i++)
{
std::swap(array[i], array[i + 1]);
}
size_--;
return temp;
}
int size() const
{
return size_;
}
bool empty()
{
return size_ == 0;
}
T &operator[](int index)
{
return array[index];
}
T front()
{
return array[0];
}
T back()
{
return array[size_ - 1];
}
~Vector()
{
delete[] array;
}
friend std::ostream &operator<<(std::ostream &out, const Vector<T> &v)
{
for (int i = 0; i < v.size_; i++)
{
out << v.array[i] << std::endl;
}
return out;
}
};