134 lines
2.5 KiB
C++
134 lines
2.5 KiB
C++
#ifndef FRAMEWORK_CONTAINER_SINGLYLINKEDLIST_H_
|
|
#define FRAMEWORK_CONTAINER_SINGLYLINKEDLIST_H_
|
|
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
|
|
/**
|
|
* @brief Linked list data structure,
|
|
* each entry has a pointer to the next entry (singly)
|
|
* @ingroup container
|
|
*/
|
|
template<typename T>
|
|
class LinkedElement {
|
|
public:
|
|
T *value;
|
|
class Iterator {
|
|
public:
|
|
LinkedElement<T> *value = nullptr;
|
|
//! Creates an uninitialized iterator which points to nullptr.
|
|
Iterator() {}
|
|
|
|
/**
|
|
* Initialize iterator at specified linked element.
|
|
* @param element
|
|
*/
|
|
Iterator(LinkedElement<T> *element) :
|
|
value(element) {
|
|
}
|
|
|
|
Iterator& operator++() {
|
|
value = value->getNext();
|
|
return *this;
|
|
}
|
|
|
|
Iterator operator++(int) {
|
|
Iterator tmp(*this);
|
|
operator++();
|
|
return tmp;
|
|
}
|
|
|
|
bool operator==(Iterator other) {
|
|
return value == other.value;
|
|
}
|
|
|
|
bool operator!=(Iterator other) {
|
|
return !(*this == other);
|
|
}
|
|
T *operator->() {
|
|
return value->value;
|
|
}
|
|
};
|
|
|
|
LinkedElement(T* setElement, LinkedElement<T>* setNext = nullptr):
|
|
value(setElement), next(setNext) {}
|
|
|
|
virtual ~LinkedElement(){}
|
|
|
|
virtual LinkedElement* getNext() const {
|
|
return next;
|
|
}
|
|
|
|
virtual void setNext(LinkedElement* next) {
|
|
this->next = next;
|
|
}
|
|
|
|
virtual void setEnd() {
|
|
this->next = nullptr;
|
|
}
|
|
|
|
LinkedElement* begin() {
|
|
return this;
|
|
}
|
|
LinkedElement* end() {
|
|
return nullptr;
|
|
}
|
|
private:
|
|
LinkedElement *next;
|
|
};
|
|
|
|
/**
|
|
* @brief SinglyLinkedList data structure which keeps a pointer to its
|
|
* first element to perform all operations.
|
|
* @tparam T
|
|
*/
|
|
template<typename T>
|
|
class SinglyLinkedList {
|
|
public:
|
|
using ElementIterator = typename LinkedElement<T>::Iterator;
|
|
|
|
SinglyLinkedList() {}
|
|
|
|
SinglyLinkedList(ElementIterator start) :
|
|
start(start.value) {}
|
|
|
|
SinglyLinkedList(LinkedElement<T>* startElement) :
|
|
start(startElement) {}
|
|
|
|
ElementIterator begin() const {
|
|
return ElementIterator::Iterator(start);
|
|
}
|
|
|
|
ElementIterator end() const {
|
|
LinkedElement<T> *element = start;
|
|
while (element != nullptr) {
|
|
element = element->getNext();
|
|
}
|
|
return ElementIterator::Iterator(element);
|
|
}
|
|
|
|
size_t getSize() const {
|
|
size_t size = 0;
|
|
LinkedElement<T> *element = start;
|
|
while (element != nullptr) {
|
|
size++;
|
|
element = element->getNext();
|
|
}
|
|
return size;
|
|
}
|
|
void setStart(LinkedElement<T>* setStart) {
|
|
start = setStart;
|
|
}
|
|
|
|
void setEnd(LinkedElement<T>* setEnd) {
|
|
setEnd->setEnd();
|
|
}
|
|
|
|
// SHOULDDO: Insertion operation ?
|
|
|
|
protected:
|
|
LinkedElement<T> *start = nullptr;
|
|
};
|
|
|
|
#endif /* SINGLYLINKEDLIST_H_ */
|