private void IntersectNicely(OrderedHashSet <T> other)
{
LinkedListNode <T> curr = order.First;
while (curr != null)
{
LinkedListNode <T> next = curr.Next;
if (other.Contains(curr.Value))
{
removeItem(curr.Value);
}
curr = next;
}
}
public bool Contains(T item)
{
return(sourceData.Contains(item));
}
