AP1405/vector.hpp at main · Mahbodbe/AP1405 · GitHub

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
template <typename T> Vector<T>::Vector(size_t _N) : N { _N } {
    std::cout << "Vector constructor: " << this << std::endl;
    arr = new T[N];
}

template <typename T> Vector<T>::Vector() : N {}, arr { nullptr } {
    std::cout << "Vector default: " << this << std::endl;
}

template <typename T> Vector<T>::~Vector() {
    delete[] arr;
    std::cout << "Vector destructor: " << this << std::endl;
}

template <typename T> Vector<T>::Vector(const Vector<T> &v) : N { v.N }, arr { new T[v.N] } {
    std::cout << "Vector copy costructor: " << this << std::endl;
    for (size_t i = 0; i < N; i++)
        arr[i] = v.arr[i];
}

template <typename T> void Vector<T>::fill() {
    for (size_t i = 0; i < N; i++)
        arr[i] = i;
}

template <typename T> void Vector<T>::disp() const {
    std::cout << "Vector:";
    for (size_t i = 0; i < N; i++)
        std::cout << arr[i] << " ";
    std::cout << std::endl;
}

template <typename T> void Vector<T>::push_back(T item) {
    T *arr2 = new T[++N];
    for (size_t i {}; i < N - 1; i++)
        arr2[i] = arr[i];
    arr2[N - 1] = item;
    delete[] arr;
    arr = arr2;
}

template <typename T> const T &Vector<T>::operator[](const size_t &i) const {
    if (i > N - 1)
        throw new std::invalid_argument { "index not valid" };

    return arr[i];
}

template <typename T> T &Vector<T>::operator[](const size_t &i) {

    return const_cast<T &>(std::as_const(*this)[i]);
}

// Vector::Vector(Vector &&v) : N { v.N }, arr { v.arr } {
//     v.arr = nullptr;
//     std::cout << "Vector moved " << this << std::endl;
// }

// // Vector Vector::operator++(){
// //     std::cout << "operator ++ left" << std::endl;
// //     arr[N - 1]++;
// //     return *this;
// // }
// // Vector& Vector::operator++(){
// //     std::cout << "operator ++ left" << std::endl;
// //     arr[N - 1]++;
// //     return *this;
// // }

template <typename T> const Vector<T> &Vector<T>::operator++() const {
    std::cout << "operator ++ left" << std::endl;
    arr[N - 1]++;
    return *this;
}

// // Vector Vector::operator++(int) const {
// //     std::cout << "operator ++ right" << std::endl;
// //     Vector v { *this };
// //     arr[N - 1]++;
// //     return v;
// // }

template <typename T> Vector<T> Vector<T>::operator++(int) const {
    std::cout << "operator ++ right" << std::endl;
    Vector<T> v { *this };
    ++*this;
    return v;
}
template <typename T> Vector<T> &Vector<T>::operator+=(const Vector<T> &v) {
    // std::cout << "operator +=" << std::endl;
    // if (v.arr == arr) {
    //     arr = static_cast<T *>(realloc(arr, (N + v.N) * sizeof(T)));
    //     for (size_t i {}; i < v.N; i++)
    //         arr[i + N] = arr[i];

    //     N += v.N;

    //     return *this;
    // } else {
    //     arr = static_cast<T *>(realloc(arr, (N + v.N) * sizeof(T)));
    //     for (size_t i {}; i < v.N; i++)
    //         arr[i + N] = v.arr[i];
    //     N += v.N;
    //     return *this;
    // }
    T *arr2 { new T[N + v.N] };

    for (size_t i {}; i < N; i++)
        arr2[i] = arr[i];

    delete[] arr;
    if (v.arr == arr)
        for (size_t i {}; i < v.N; i++)
            arr[i + N] = arr[i];
    else
        for (size_t i {}; i < v.N; i++)
            arr2[i + N] = v.arr[i];

    arr = arr2;
    return *this;
}

// // Vector Vector::operator+(const Vector& v){
// //     Vector _v { *this };
// //     _v += v;
// //     return _v;
// // }
template <typename T> Vector<T> Vector<T>::operator+(const Vector<T> &v) {
    Vector<T> _v { N + v.N };
    std::cout << &_v << std::endl;
    for (size_t i {}; i < N; i++)
        _v.arr[i] = arr[i];
    for (size_t i { N }; i < N + v.N; i++)
        _v.arr[i] = v.arr[i - N];
    return _v;
}

template <typename T> Vector<T>::operator T() const {
    T sum {};
    for (size_t i {}; i < N; i++)
        sum += arr[i];
    return sum;
}

template <typename T> Vector<T> &Vector<T>::operator=(const Vector<T> &v) {
    std::cout << "vector operator = copy version" << std::endl;
    if (this == &v)
        return *this;
    delete[] arr;
    N = v.N;
    arr = new T[N];
    for (size_t i {}; i < N; i++)
        arr[i] = v.arr[i];
    return *this;
}
template <typename T> Vector<T> &Vector<T>::operator=(Vector<T> &&v) {
    std::cout << "operator = move version" << std::endl;
    delete[] arr;
    arr = v.arr;
    N = v.N;
    v.arr = nullptr;
    return *this;
}