From 8af2c4a6d53375e8815e4152ed4b7ffb166c6a2a Mon Sep 17 00:00:00 2001 From: Syndamia Date: Tue, 14 Jun 2022 14:44:36 +0300 Subject: Autocommit at 14.06.2022 @ 14:44 --- src/Generic/List/OrderedList.hpp | 55 ---------------------------------------- src/Generic/Pair/Pair.hpp | 8 ++++++ 2 files changed, 8 insertions(+), 55 deletions(-) delete mode 100644 src/Generic/List/OrderedList.hpp (limited to 'src/Generic') diff --git a/src/Generic/List/OrderedList.hpp b/src/Generic/List/OrderedList.hpp deleted file mode 100644 index 8d13a5d..0000000 --- a/src/Generic/List/OrderedList.hpp +++ /dev/null @@ -1,55 +0,0 @@ -#ifndef HEADER_ORDEREDLIST -#define HEADER_ORDEREDLIST - -/*! \file OrderedList.hpp - * \brief Stores declaration and definition of templated class OrderedList - */ - -#include "List.hpp" - -/*! \brief Inherits List, but contains it's elements in a sorted manner - * - * \warning Outside those defined in List, insert() requires the type to have defined a "compare" of functions. - * \sa insert() - */ -template -class OrderedList : public List { -public: - OrderedList(); - OrderedList(const T* elements, unsigned elementsCount); - - /*! \brief \warning Function is deleted, use insert() instead - * \sa insert() - */ - void add(T element) = delete; - /*! \brief \warning Function is deleted, use insert() instead - * \sa insert() - */ - void insertAt(T element, unsigned index) = delete; - - //! Inserts an element at a sorted position - void insert(T element); -}; - -template -OrderedList::OrderedList() : OrderedList(nullptr, 0) {} - -template -OrderedList::OrderedList(const T* elements, unsigned elementsCount) : List::List(elements, elementsCount) {} - -/*! - * \warning The function depends on the type having a function "compare" defined, which takes two elements and returns a number <0 if elem1 < elem2, >0 if elem1 > elem2, 0 if elem1 == elem2 - * \note Insertion is done linearly - */ -template -void OrderedList::insert(T element) { - if (List::length == List::count) List::resize(); - - unsigned insertionInd = 0; - while (insertionInd < List::count && List::elements[insertionInd].compare(element) < 0) - insertionInd++; - - List::insertAt(element, insertionInd); -} - -#endif diff --git a/src/Generic/Pair/Pair.hpp b/src/Generic/Pair/Pair.hpp index 0238130..64614ca 100644 --- a/src/Generic/Pair/Pair.hpp +++ b/src/Generic/Pair/Pair.hpp @@ -1,6 +1,14 @@ #ifndef PAIR #define PAIR +/*! \file Pair.hpp + * \brief Stores the declaration of struct Pair + */ + +/*! \brief Stores two values of any types + * + * Values are public, so no explicit getters or setters are made. + */ template struct Pair { T left; -- cgit v1.3.1-26-gb76a