#ifndef _BLE_LINKED_LIST_

#define _BLE_LINKED_LIST_

#include <stddef.h>

template<class T> struct BLELinkedListNode

};

template <typename T> class BLELinkedList {

};

template <typename T> BLELinkedList<T>::BLELinkedList() :

_size(0),

_root(NULL),

_last(NULL)

{

}

template <typename T> BLELinkedList<T>::~BLELinkedList()

{

clear();

}

template <typename T> void BLELinkedList<T>::add(T item)

{

BLELinkedListNode<T>* itemNode = new BLELinkedListNode<T>();

itemNode->data = item;

itemNode->next = NULL;

if (_root == NULL) {

_root = itemNode;

} else {

_last->next = itemNode;

}

_last = itemNode;

_size++;

}

template <typename T> T BLELinkedList<T>::get(unsigned int index) const

{

if (index >= _size) {

return T();

}

BLELinkedListNode<T>* itemNode = _root;

for (unsigned int i = 0; i < index; i++) {

itemNode = itemNode->next;

}

return itemNode->data;

}

template <typename T> void BLELinkedList<T>::clear()

{

BLELinkedListNode<T>* itemNode = _root;

for (unsigned int i = 0; i < _size; i++) {

BLELinkedListNode<T>* n = itemNode;

itemNode = itemNode->next;

delete n;

}

_size = 0;

_root = NULL;

_last = NULL;

}

template <typename T> unsigned int BLELinkedList<T>::size() const

{

return _size;

}

template <typename T> T BLELinkedList<T>::remove(unsigned int index)

{

if (index >= _size) {

return T();

}

BLELinkedListNode<T>* previousItemNode = NULL;

BLELinkedListNode<T>* itemNode = _root;

for (unsigned int i = 0; i < index; i++) {

previousItemNode = itemNode;

itemNode = itemNode->next;

}

T result = itemNode->data;

if (previousItemNode == NULL) {

_root = itemNode->next;

} else {

previousItemNode->next = itemNode->next;

}

if (_last == itemNode) {

_last = previousItemNode;

}

delete itemNode;

_size--;

return result;

}

#endif