Simply copies a Queue.
Simply copies a Queue.
the Queue to copy.
a new Queue containing all elements of q.
Checks if the given Queue 'in' of type T contains a chain (non-empty queue) starting with an element matching constraint 'from' and ending with one matching 'to'.
Checks if the given Queue 'in' of type T contains a chain (non-empty queue) starting with an element matching constraint 'from' and ending with one matching 'to'.
the starting constraint
the end constraint
the queue to check
true if the given Seq 'in' of type T contains a chain (non-empty seq) starting with an element matching constraint 'from' and ending with one matching 'to', false otherwise.
Removes an element of type T from the given Queue.
Removes an element of type T from the given Queue.
the element to remove
the queue to remove the element from.
a new Queue with all elements of q except elem.
Swap to Elements of type T ind the given Queue l.
Swap to Elements of type T ind the given Queue l.
The queue to swap the elements in it.
Element a that gets swapped with b.
Element b that gets swapped with a.
a new Queue containing all elements of l but element a and b swapped.
The same as swap but only swaps of element a and b are occurring in that exact order like given with parameter t.
The same as swap but only swaps of element a and b are occurring in that exact order like given with parameter t.
The queue to swap the elements in it.
A tuple containing element a (as ._1) and b (as ._2) in the necessary order.
a new Queue containing all elements of l but element a and b swapped if they were found in the order given with t.
Generic Queue ordering utility.