úÎ!1w     Safe14X ëdequebDouble-ended queue (aka Dequeue or Deque) based on the head-tail linked list. Can be cycled. See  and .dequeO(1).  is available from the  instance.dequeO(n):. Leave only the first elements satisfying the predicate.dequeO(n)4. Drop the first elements satisfying the predicate.dequeO(1), occasionally O(n). 0» toList . shiftLeft $ fromList [1,2,3] [2,3,1] dequeO(1), occasionally O(n). 1» toList . shiftRight $ fromList [1,2,3] [3,1,2] dequeO(1). Prepend an element.dequeO(1). Append an element. dequeO(1), occasionally O(n). dequeO(1), occasionally O(n). dequeO(n). dequeO(1). dequeO(1), occasionally O(n).dequeO(1), occasionally O(n).dequeO(1), occasionally O(n).dequeO(1), occasionally O(n).        !"deque-0.2.6-Ft7HBuHSSvl9wq0pHNoMAjDequefromList takeWhile dropWhile shiftLeft shiftRightconssnocunconsunsnocprependreverseheadtailinitlast$fMonadFailDeque$fMonadPlusDeque$fAlternativeDeque $fMonadDeque$fApplicativeDeque$fTraversableDeque$fFoldableDeque $fMonoidDeque$fSemigroupDeque$fFunctorDeque $fShowDeque $fEqDequebase Data.FoldabletoListFoldable