Method remove

Kernel/include/list.h:410–437

	}

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

		acquireLock(&lock);

		ListNode<T>* current = front;

		while(current && current != back && current->obj != val) current = current->next;

		if(current){
			current->prev->next = current->next;
			current->next->prev = current->prev;
			if (front == current) front = current->next;
			if (back == current) back = current->prev;

			num--;

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

		releaseLock(&lock);
	}


	void remove(ListIterator<T>& it){