#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