Ke.FkeSourceinclude Sigs.FThe type of queues containing elements of type 'a.
peek q returns the first element in the queue q, without removing it from the queue. If q is empty, it returns None.
Get and remove the first element. If q is empty, it returns None.
Get and remove the last element. If q is empty, it returns None.
iter f q applies f in turn to all elements of q, from the least recently entered to the most recently entered. The queue itself is unchanged.
rev_iter f q applies f in turn to all elements of q, from the most recently entered to the least recently entered. The queue itself is unchanged.
fold f a q is equivalent to List.fold_left f a l, where l is the list of q's elements. The queue remains unchanged.