Class FastList

Kernel/include/list.h:80–190

// Type is required to be a pointer with the members next and prev
template<typename T>
class FastList {
public:
	FastList()
	{
		front = NULL;
		back = NULL;
		num = 0;
	}

	~FastList() {
	}

	void clear() {
		front = NULL;
		back = NULL;
		num = 0;
	}

	void add_back(const T& obj) {
		if (!front) {
			front = obj;
			obj->prev = obj;
		} else if (back) {
			back->next = obj;
			obj->prev = back;
		}
		back = obj;
		obj->next = front;
		num++;
	}

	void add_front(const T& obj) {
		if (!back) {
			back = obj;
		}
		else if(front) {
			front->prev = obj;
			obj->next = front;
		}
		front = obj;
		obj->prev = back;
		num++;
	}

	T operator[](unsigned pos) {
		return get_at(pos);
	}

	T get_at(unsigned pos) {
		assert(num > 0 && pos < num && front);
		/*if (num <= 0 || pos >= num || front == NULL) {
			return nullptr;
		}*/

		T current = front;

		for (unsigned int i = 0; i < pos && i < num && current->next; i++) current = current->next;