Method insert

Kernel/include/list.h:302–335

	}

	void insert(const T& obj, size_t pos){
		if(!num){
			add_back(obj);
			return;
		}

		if(!pos){
			add_front(obj);
			return;
		}

		acquireLock(&lock);
		ListNode<T>* current = front;

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

		ListNode<T>* node;
		if(!cache.get_length()){
			node = (ListNode<T>*)kmalloc(sizeof(ListNode<T>));
		} else {
			node = cache.remove_at(0);
		}

		assert(node);

		node->obj = obj;
		node->prev = current;
		node->next = current->next;
		current->next = node;

		num++;

		releaseLock(&lock);
	}

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