Website Summary Files Commits Branches @commit @diff @stats
path: root / src / Generic / List / OrderedList.hpp
diff options
context:
space:
mode:
Commit3098e987d83a7fa2ea33e66b901e6941233a9879 (patch)
Author
 Syndamia <kamen@syndamia.com>
2022-05-28 09:33:26 +0300
Committer
 Syndamia <kamen@syndamia.com>
2022-05-28 09:33:26 +0300
Files8fe54cd3f7c29b24b822762d7249e6310ae97d6a /src/Generic/List/OrderedList.hpp
FMI-OOP-P2_Tables-3098e987d83a7fa2ea33e66b901e6941233a9879.tar
FMI-OOP-P2_Tables-3098e987d83a7fa2ea33e66b901e6941233a9879.tar.gz
FMI-OOP-P2_Tables-3098e987d83a7fa2ea33e66b901e6941233a9879.zip
Parent12df7aa3b9ec4bc6d9b74ae86ef0248d049f8785 (diff)
Added generic stuff from previous project
1 files changed, 55 insertions, 0 deletions
-rw-r--r--src/Generic/List/OrderedList.hpp55
diff --git a/src/Generic/List/OrderedList.hpp b/src/Generic/List/OrderedList.hpp
new file mode 100644
index 0000000..8d13a5d
--- /dev/null
+++ b/src/Generic/List/OrderedList.hpp
@@ -0,0 +1,55 @@
+#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 <typename T>
+class OrderedList : public List<T> {
+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 <typename T>
+OrderedList<T>::OrderedList() : OrderedList(nullptr, 0) {}
+
+template <typename T>
+OrderedList<T>::OrderedList(const T* elements, unsigned elementsCount) : List<T>::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 <typename T>
+void OrderedList<T>::insert(T element) {
+ if (List<T>::length == List<T>::count) List<T>::resize();
+
+ unsigned insertionInd = 0;
+ while (insertionInd < List<T>::count && List<T>::elements[insertionInd].compare(element) < 0)
+ insertionInd++;
+
+ List<T>::insertAt(element, insertionInd);
+}
+
+#endif