Method remove_at

Kernel/include/list.h:375–408

	}

	T remove_at(unsigned pos) {
		assert(num > 0);
		assert(pos < num);
		assert(front != nullptr);

		acquireLock(&lock);

		ListNode<T>* current = front;

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

		assert(current);

		T obj = current->obj;

		num--;

		if (current->next) current->next->prev = current->prev;
		if (current->prev) current->prev->next = current->next;
		if (pos == 0) front = current->next;
		if (pos == num) back = current->prev;

		if(cache.get_length() >= maxCache){
			kfree(current);
		} else {
			cache.add_back(current);
		}

		if(!num) front = back = nullptr;

		releaseLock(&lock);

		return obj;
	}

	void remove(T val){
		if(num <= 0 || !front){