From b0f046461b44a0c4002ea667a726403ff4a1a701 Mon Sep 17 00:00:00 2001 From: Syndamia Date: Wed, 4 May 2022 10:58:48 +0300 Subject: Moved templated stuff into hpp files and added a blank main.cpp file --- src/List/List.cpp | 169 ------------------------------------- src/List/List.h | 42 ---------- src/List/List.hpp | 211 +++++++++++++++++++++++++++++++++++++++++++++++ src/List/OrderedList.cpp | 18 ---- src/List/OrderedList.h | 19 ----- src/List/OrderedList.hpp | 36 ++++++++ 6 files changed, 247 insertions(+), 248 deletions(-) delete mode 100644 src/List/List.cpp delete mode 100644 src/List/List.h create mode 100644 src/List/List.hpp delete mode 100644 src/List/OrderedList.cpp delete mode 100644 src/List/OrderedList.h create mode 100644 src/List/OrderedList.hpp (limited to 'src/List') diff --git a/src/List/List.cpp b/src/List/List.cpp deleted file mode 100644 index e5b360c..0000000 --- a/src/List/List.cpp +++ /dev/null @@ -1,169 +0,0 @@ -#include "List.h" - -/* Private */ - -template -void List::resize() { - length = (length == 0) ? 8 : length << 1; - T* temp = new T[length]; - for (int i = 0; i < count; i++) - temp[i] = elements[i]; - delete[] elements; - elements = temp; -} - -template -void List::free() { - delete[] elements; -} - -template -void List::copyFrom(const List& other) { - elements = new T[other.length]; - for (int i = 0; i < other.count; i++) - elements[i] = other.elements[i]; - length = other.length; - count = other.count; -} - -/* Public */ - -template -List::List(const T* elements, unsigned elementsCount) { - count = length = 0; - for (unsigned i = 0; i < elementsCount; i++) - add(elements[i]); -} - -template -void List::add(const T& element) { - if (length == count) resize(); - - elements[count++] = element; -} - -template -bool List::insertAt(const T& element, unsigned index) { - if (index >= count) return add(element); - if (length == count) resize(); - - for (unsigned i = count; i > index; i--) - elements[i] = elements[i - 1]; - - elements[index] = element; - count++; -} - -template -bool List::removeAt(unsigned index) { - if (index >= count) return false; - - delete elements[index]; - for (int i = index; i < count; i++) - elements[i] = elements[i + 1]; - elements[count--] = nullptr; -} - -template -unsigned List::findIndex(const T& element) const { - unsigned ind = 0; - while (ind < count && elements[ind].compare(element) != 0) - ind++; - return ind; -} - -template -bool List::contain(const T& element) const { - return findIndex(element) < count; -} - -template -T& List::operator[](unsigned index) { - return elements[index]; -} - -template -const T& List::operator[](unsigned index) const { - return elements[index]; -} - -template -std::istream& List::read(std::istream& istr) { - istr.read((char*)&length, sizeof(length)); - istr.read((char*)&count, sizeof(count)); - - delete[] elements; - elements = new T[length]; - - for (int i = 0; i < count; i++) - elements[i].read(istr); // disgusting - - return istr; -} - -template -std::ostream& List::write(std::ostream& ostr) const { - ostr.write((const char*)&length, sizeof(length)); - ostr.write((const char*)&count, sizeof(count)); - - for (int i = 0; i < count; i++) - elements[i].write(ostr); // disgusting - - return ostr; -} - -template -unsigned List::get_length() const { - return length; -} - -template -unsigned List::get_count() const { - return count; -} - -// Rule of 4 - -template -List::List() : List(nullptr, 0) {} - -template -List& List::operator=(const List& other) { - if (this != &other) { - free(); - copyFrom(other); - } - return *this; -} - -template -List::List(const List& other) { - copyFrom(other); -} - -template -List::~List() { - free(); -} - -// Move semantics - -template -List::List(List&& other) { - length = other.length; - count = other.count; - elements = other.elements; - other.elements = nullptr; -} - -template -List& List::operator=(List&& other) { - if (this != &other) { - free(); - length = other.length; - count = other.count; - elements = other.elements; - other.elements = nullptr; - } - return *this; -} diff --git a/src/List/List.h b/src/List/List.h deleted file mode 100644 index 23e3ee5..0000000 --- a/src/List/List.h +++ /dev/null @@ -1,42 +0,0 @@ -#ifndef HEADER_LIST -#define HEADER_LIST - -#include "istream" -#include "ostream" - -template -class List { - T* elements; - unsigned length; - unsigned count; - - void resize(); - void free(); - void copyFrom(const List& other); - -public: - List(const T* elements, unsigned elementsCount); - void add(const T& element); - bool insertAt(const T& element, unsigned index); - bool removeAt(unsigned index); - unsigned findIndex(const T& element) const; - bool contain(const T& element) const; - T& operator[](unsigned index); - const T& operator[](unsigned index) const; - - std::istream& read(std::istream& istr); - std::ostream& write(std::ostream& ostr) const; - - unsigned get_length() const; - unsigned get_count() const; - - List(); - List& operator=(const List& other); - List(const List& other); - ~List(); - - List(List&& other); - List& operator=(List&& other); -}; - -#endif diff --git a/src/List/List.hpp b/src/List/List.hpp new file mode 100644 index 0000000..1e75c89 --- /dev/null +++ b/src/List/List.hpp @@ -0,0 +1,211 @@ +#ifndef HEADER_LIST +#define HEADER_LIST + +#include +#include + +template +class List { +protected: + T* elements; + unsigned length; + unsigned count; + + void resize(); + void free(); + void copyFrom(const List& other); + +public: + List(const T* elements, unsigned elementsCount); + void add(const T& element); + void insertAt(const T& element, unsigned index); + bool removeAt(unsigned index); + unsigned findIndex(const T& element) const; + bool contain(const T& element) const; + T& operator[](unsigned index); + const T& operator[](unsigned index) const; + + std::istream& read(std::istream& istr); + std::ostream& write(std::ostream& ostr) const; + + unsigned get_length() const; + unsigned get_count() const; + + List(); + List& operator=(const List& other); + List(const List& other); + ~List(); + + List(List&& other); + List& operator=(List&& other); +}; + +/* Private */ + +template +void List::resize() { + length = (length == 0) ? 8 : length << 1; + T* temp = new T[length]; + for (int i = 0; i < count; i++) + temp[i] = elements[i]; + delete[] elements; + elements = temp; +} + +template +void List::free() { + delete[] elements; +} + +template +void List::copyFrom(const List& other) { + elements = new T[other.length]; + for (int i = 0; i < other.count; i++) + elements[i] = other.elements[i]; + length = other.length; + count = other.count; +} + +/* Public */ + +template +List::List(const T* elements, unsigned elementsCount) { + count = length = 0; + for (unsigned i = 0; i < elementsCount; i++) + add(elements[i]); +} + +template +void List::add(const T& element) { + if (length == count) resize(); + + elements[count++] = element; +} + +template +void List::insertAt(const T& element, unsigned index) { + if (index >= count) add(element); + if (length == count) resize(); + + for (unsigned i = count; i > index; i--) + elements[i] = elements[i - 1]; + + elements[index] = element; + count++; +} + +template +bool List::removeAt(unsigned index) { + if (index >= count) return false; + + for (int i = index; i < count; i++) + elements[i] = elements[i + 1]; + count--; + return true; +} + +template +unsigned List::findIndex(const T& element) const { + unsigned ind = 0; + while (ind < count && elements[ind].compare(element) != 0) + ind++; + return ind; +} + +template +bool List::contain(const T& element) const { + return findIndex(element) < count; +} + +template +T& List::operator[](unsigned index) { + return elements[index]; +} + +template +const T& List::operator[](unsigned index) const { + return elements[index]; +} + +template +std::istream& List::read(std::istream& istr) { + istr.read((char*)&length, sizeof(length)); + istr.read((char*)&count, sizeof(count)); + + delete[] elements; + elements = new T[length]; + + for (int i = 0; i < count; i++) + elements[i].read(istr); // disgusting + + return istr; +} + +template +std::ostream& List::write(std::ostream& ostr) const { + ostr.write((const char*)&length, sizeof(length)); + ostr.write((const char*)&count, sizeof(count)); + + for (int i = 0; i < count; i++) + elements[i].write(ostr); // disgusting + + return ostr; +} + +template +unsigned List::get_length() const { + return length; +} + +template +unsigned List::get_count() const { + return count; +} + +// Rule of 4 + +template +List::List() : List(nullptr, 0) {} + +template +List& List::operator=(const List& other) { + if (this != &other) { + free(); + copyFrom(other); + } + return *this; +} + +template +List::List(const List& other) { + copyFrom(other); +} + +template +List::~List() { + free(); +} + +// Move semantics + +template +List::List(List&& other) { + length = other.length; + count = other.count; + elements = other.elements; + other.elements = nullptr; +} + +template +List& List::operator=(List&& other) { + if (this != &other) { + free(); + length = other.length; + count = other.count; + elements = other.elements; + other.elements = nullptr; + } + return *this; +} + +#endif diff --git a/src/List/OrderedList.cpp b/src/List/OrderedList.cpp deleted file mode 100644 index 7476574..0000000 --- a/src/List/OrderedList.cpp +++ /dev/null @@ -1,18 +0,0 @@ -#include "OrderedList.h" - -template -OrderedList::OrderedList() : OrderedList(nullptr, 0) {} - -template -OrderedList::OrderedList(const T* elements, unsigned elementsCount) : List::List(elements, elementsCount) {} - -template -bool OrderedList::insert(const T& element) { - if (List::length == List::count) List::resize(); - - unsigned insertionInd = 0; - while (List::elements[insertionInd].compare(element) < 0 && insertionInd < List::count) - insertionInd++; - - return List::insertAt(element, insertionInd); -} diff --git a/src/List/OrderedList.h b/src/List/OrderedList.h deleted file mode 100644 index e0b104f..0000000 --- a/src/List/OrderedList.h +++ /dev/null @@ -1,19 +0,0 @@ -#ifndef HEADER_ORDEREDLIST -#define HEADER_ORDEREDLIST - -#include "List.h" - -template -class OrderedList : public List { -public: - OrderedList(); - OrderedList(const T* elements, unsigned elementsCount); - - void add(const T& element) = delete; - bool insertAt(const T& element, unsigned index) = delete; - - bool insert(const T& element); - // unsigned findIndex(const T& element) const; TODO: binary search -}; - -#endif diff --git a/src/List/OrderedList.hpp b/src/List/OrderedList.hpp new file mode 100644 index 0000000..4396d33 --- /dev/null +++ b/src/List/OrderedList.hpp @@ -0,0 +1,36 @@ +#ifndef HEADER_ORDEREDLIST +#define HEADER_ORDEREDLIST + +#include "List.hpp" + +template +class OrderedList : public List { +public: + OrderedList(); + OrderedList(const T* elements, unsigned elementsCount); + + void add(const T& element) = delete; + void insertAt(const T& element, unsigned index) = delete; + + void insert(const T& element); + // unsigned findIndex(const T& element) const; TODO: binary search +}; + +template +OrderedList::OrderedList() : OrderedList(nullptr, 0) {} + +template +OrderedList::OrderedList(const T* elements, unsigned elementsCount) : List::List(elements, elementsCount) {} + +template +void OrderedList::insert(const T& element) { + if (List::length == List::count) List::resize(); + + unsigned insertionInd = 0; + while (List::elements[insertionInd].compare(element) < 0 && insertionInd < List::count) + insertionInd++; + + List::insertAt(element, insertionInd); +} + +#endif -- cgit v1.3.1-26-gb76a