-
Notifications
You must be signed in to change notification settings - Fork 0
/
Vector.h
174 lines (130 loc) · 2.98 KB
/
Vector.h
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
//--------------------------------------------------------------------------------------------------------------------------------
// Hassan Shahzad & Azka Khurram
// 18i-0441 & 18i-0461
// Algo-Project
// FAST NUCES
// Queue.h
//--------------------------------------------------------------------------------------------------------------------------------
//================================================================================================================================
// 1: This file contains a Vector data structure with all its functionalities and some adjusted according to our requirements
//================================================================================================================================
#pragma once
#include <iostream>
#include <string>
#include <fstream>
using namespace std;
template <typename T>
class Vector
{
T* ptr;
int size_;
int c_index;
int cap;
public:
Vector() : ptr(NULL), size_(0), c_index(0), cap(0) {};
Vector(int size) : size_(0), c_index(0), cap(size)
{
ptr = new T[cap];
}
Vector(int size, const T& iv) : size_(size), c_index(size_)
{
ptr = new T[size_];
for (int i = 0; i < size_; i++)
ptr[i] = iv;
}
~Vector()
{
delete[]ptr;
}
const T& operator = (const T& obj) // copies one vector to another
{
if (size_ == cap) {
Vector<T> copy(*this);
~*this;
cap *= 2;
ptr = new T[cap];
for (int i = 0; i < size_; i++)
ptr[i] = copy.ptr[i];
delete[]copy.ptr;
}
size_++;
ptr[size_] = obj;
return ptr[size_];
}
int size() {
return size_;
}
void resize(int x) {
if (x == cap)
return;
else if (x > cap) {
Vector<T> copy(*this);
delete[]ptr;
cap = x;
ptr = new T[cap];
for (int i = 0; i < size_; i++)
ptr[i] = copy[i];
delete[]copy.ptr;
return;
}
else {
Vector<T> copy(*this);
delete[]ptr;
cap = x;
ptr = new T[cap];
if (size_ > cap)
size_ = cap;
for (int i = 0; i < size_; i++)
ptr[i] = copy[i];
delete[]copy.ptr;
return;
}
}
bool empty() {
if (size_ == -1)
return true;
return false;
}
void shrink_to_fit(int x) {
Vector<T> copy(*this);
delete[]ptr;
cap = x;
ptr = new T[cap];
if (size_ > cap)
size_ = cap;
for (int i = 0; i < size_; i++)
ptr[i] = copy[i];
delete[]copy.ptr;
}
T& operator [] (int index) {
return ptr[index];
}
void push_back(const T& value) {
if (size_ == cap)
this->resize(cap * 2);
ptr[size_] = value;
size_++;
}
void pop_back() {
size_--;
}
void clear() {
//c_index = 0;
size_ = -1;
}
int capacity() {
return cap;
}
bool search(T& item) {
for (int i = 0; i < this->size_; i++) {
if (ptr[i] == item)
return true;
}
return false;
}
void display() {
for (int i = 0; i < this->size_; i++)
cout << ptr[i];
cout << endl;
}
};