DList.h

#ifndef __DLIST_H__
#define __DLIST_H__

class DList {

private:
	node* start;

public:
	DList()
	{
		start = NULL;
	}

	unsigned int count() const
	{
		unsigned int counter = 0;
		node* tmp = start;
		while (tmp != NULL)
		{
			tmp = tmp->next;
			counter++;
		}
		return counter;
	}

	void add(int _value)
	{
		node* new_node = new node;
		new_node->value = _value;
		new_node->next = NULL;

		if (start != NULL)
		{
			node* tmp = start;
			while (tmp->next != NULL)
				tmp = tmp->next;
			tmp->next = new_node;
			new_node->previous = tmp;
		}
		else
		{
			new_node->previous = NULL;
			start = new_node;
		}
	}

	node* getNodeAtPos(unsigned int _pos) const
	{
		// Node 1 is zero, node 2 is one, etc.
		if (start != NULL && _pos < count())
		{
			unsigned int pos_counter = 0;
			node* tmp = start;
			
			while (pos_counter != _pos)
			{
				tmp = tmp->next;
				pos_counter++;
			}
			return tmp;
		}
		else
			return NULL;
	}

	void del(node* _node)
	{
		if (start != NULL && _node != NULL)
		{
			if (start != _node)
			{
				node* tmp = start;
				while (tmp->next != _node)
					tmp = tmp->next;
				tmp->next = _node->next;
				if (_node->next != NULL)
					_node->next->previous = tmp;
			}
			else
			{
				start = _node->next;
				_node->next->previous = NULL;
			}
			delete _node;
		}
	}

	void info() const
	{
		if (start != NULL) {
			node* tmp = start;
			unsigned int node_num = 1;
			while (tmp != NULL)
			{
				printf("%s %d: %s %d | %s %p | %s %p | %s %p\n",
					    "Number", node_num,
						"Value", tmp->value,
						"Node", tmp,
						"Next", tmp->next,
						"Previous", tmp->previous);
				tmp = tmp->next;
				node_num++;
			}	
		}
		else
			printf("%s", "Empty Double Linked List");
	}

};


#endif // !__DLIST_H__