docs/html/OrderedList_8hpp_source.html

#ifndef HEADER_ORDEREDLIST

#define HEADER_ORDEREDLIST


#include "List.hpp"


template <typename T>

class OrderedList : public List<T> {

public:

    OrderedList();

    OrderedList(const T* elements, unsigned elementsCount);


    void add(T element) = delete;

    void insertAt(T element, unsigned index) = delete;


    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) {}


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

List.hpp
Stores declaration and definition of templated class List.

List
Templated class that stores an array of elements in dynamic memory.
Definition: List.hpp:22

List::insertAt
void insertAt(const T &element, unsigned index)
Inserts element at given index.
Definition: List.hpp:132

OrderedList
Inherits List, but contains it's elements in a sorted manner.
Definition: OrderedList.hpp:16

OrderedList::insert
void insert(T element)
Inserts an element at a sorted position.
Definition: OrderedList.hpp:45

OrderedList::insertAt
void insertAt(T element, unsigned index)=delete

OrderedList::add
void add(T element)=delete