/// <summary>
/// Finds all elements with the given priority.
/// </summary>
/// <param name="priority">The priority.</param>
/// <remarks>O(log(m)), where m is the number of values from the closer side of
/// the queue to the position of the priority.</remarks>
public PriorityQueue <T, TPriority> FindAll(TPriority priority)
{
return(new PriorityQueue <T, TPriority>(_ft.FindAll(priority)));
}
/// <summary>
/// Finds all elements equal to the given item.
/// </summary>
/// <param name="item">The key.</param>
/// <remarks>O(log(m)), where m is the number of elements from the closer side of
/// the sequence to the position of the item.</remarks>
public OrderedSequence <T> FindAll(T item)
{
return(new OrderedSequence <T>(_ft.FindAll(item)));
}
