TDequeue
A transactional queue that can only be dequeued.
Value members
Abstract methods
Views the next element in the queue without removing it, retrying if the queue is empty.
Views the next element in the queue without removing it, retrying if the queue is empty.
Views the next element in the queue without removing it, returning None
if the queue is empty.
Views the next element in the queue without removing it, returning None
if the queue is empty.
Concrete methods
Takes a single element from the queue, returning None
if the queue is
empty.
Takes a single element from the queue, returning None
if the queue is
empty.
Drops elements from the queue while they do not satisfy the predicate, taking and returning the first element that does satisfy the predicate. Retries if no elements satisfy the predicate.
Drops elements from the queue while they do not satisfy the predicate, taking and returning the first element that does satisfy the predicate. Retries if no elements satisfy the predicate.
Takes a number of elements from the queue between the specified minimum and maximum. If there are fewer than the minimum number of elements available, retries until at least the minimum number of elements have been collected.
Takes a number of elements from the queue between the specified minimum and maximum. If there are fewer than the minimum number of elements available, retries until at least the minimum number of elements have been collected.
Takes the specified number of elements from the queue. If there are fewer than the specified number of elements available, it retries until they become available.
Takes the specified number of elements from the queue. If there are fewer than the specified number of elements available, it retries until they become available.