-
Notifications
You must be signed in to change notification settings - Fork 0
/
List.hpp
155 lines (89 loc) · 2.59 KB
/
List.hpp
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
//
// Created by Vasiliy Evdokimov on 12.05.2020.
//
#pragma once
#include <iostream>
template<typename T>
class List {
public:
// **** Constructors ****
List();
List(T const *, size_t);
// ** Copy Constructor
List(List<T> const &);
// **** Operators ****
template<typename TT>
friend List<TT> operator+(List<TT>, List<TT>);
List<T> & operator=(List<T> const &);
template<typename TT>
friend std::istream & operator>>(std::istream &, List<TT> &);
template<typename TT>
friend std::ostream & operator<<(std::ostream &, List<TT> const &);
T operator[](size_t) const;
T & operator[](size_t);
// **** Destructor ****
~List();
// **** Getters ****
size_t GetSize() const;
T GetFirst() const;
T & GetFirst();
T GetLast() const;
T & GetLast();
T GetElementData(size_t) const;
T & GetElementData(size_t);
List<T> * GetSubList(size_t, size_t);
// **** Setters ****
void SetSize(size_t);
// **** Modifiers ****
void Prepend(T);
void InsertAt(size_t, T);
void Append(T);
void PopFirst();
void EraseAt(size_t);
void PopBack();
private:
struct Node;
// ****** Private Methods ******
// **** Getters ****
Node * GetHead() const;
Node GetNode(size_t) const;
Node & GetNode(size_t);
// **** Setters ****
void SetHead(Node *);
// **** Utils ****
void SwapAttributes(List<T> &);
// **** Member Variables ****
struct Node {
// **** Constructors ****
Node()
: data_(T(0)), next_(nullptr) {}
explicit Node(T data, Node *next = nullptr)
: data_(data), next_(next) {}
// **** Destructor ****
// If I uncomment this than program will free \
nodes twice. First in List destructor then \
in Node destructor which will cause error
~Node(){
//if (GetNext() != nullptr) delete next_;
next_ = nullptr;
}
// **** Output ****
// template<typename TT>
// friend std::ostream & List<T>::operator<<(std::ostream &, List<TT>);
// **** Getters ****
T GetData() const { return data_; }
T & GetData() { return data_; }
Node * GetNext() { return next_; }
// **** Setters ****
void SetNext(Node *pNewNext) {
//if (next_ != nullptr) delete next_;
next_ = pNewNext;
}
// **** Member Variables ****
T data_;
Node *next_;
};
size_t size_;
Node *head_;
};
#include "ListImplementation.hpp"