template<typename T> void
List<T>::insertAfter(const size_t id, const T& value)
{
	if (empty() | (id >= size_))
		THROW_OUT_OF_RANGE_EXCEPTION;

	else
	{
		Node* it = first_;
		for (size_t i = 0; i < id; i++)
			it = it->next;

		it->next = new Node(value, it->next, it);
		if (it->next->next != nullptr)
			it->next->next->prev = it->next;
	}
	size_++;
}