Deque.Strict.State · deque-0.4.4.4

valuemap :: MonadState (Deque a) m => (a -> a) -> m ()

#

O(n). Modify each element of the queue.

valueprepend :: MonadState (Deque a) m => Deque a -> m ()

#

O(n). Add elements to the begginning.

valueappend :: MonadState (Deque a) m => Deque a -> m ()

#

O(n). Add elements to the ending.

valuecons :: MonadState (Deque a) m => a -> m ()

#

O(1). Add element in the beginning.

valuesnoc :: MonadState (Deque a) m => a -> m ()

#

O(1). Add element in the ending.

valuereverse :: MonadState (Deque a) m => m ()

#

O(1). Reverse the deque.

valueshiftLeft :: MonadState (Deque a) m => m ()

#

O(1), occasionally O(n). Move the first element to the end.

valueshiftRight :: MonadState (Deque a) m => m ()

#

O(1), occasionally O(n). Move the last element to the beginning.

valuefilter :: MonadState (Deque a) m => (a -> Bool) -> m ()

#

O(n). Leave only the elements satisfying the predicate.

valuetake :: MonadState (Deque a) m => Int -> m ()

#

O(n). Leave only the specified amount of first elements.

valuedrop :: MonadState (Deque a) m => Int -> m ()

#

O(n). Drop the specified amount of first elements.

valuetakeWhile :: MonadState (Deque a) m => (a -> Bool) -> m ()

#

O(n). Leave only the first elements satisfying the predicate.

valuedropWhile :: MonadState (Deque a) m => (a -> Bool) -> m ()

#

O(n). Drop the first elements satisfying the predicate.

valuespan :: MonadState (Deque a) m => (a -> Bool) -> m (Deque a)

#

O(n). Return the first elements satisfying the predicate, removing them from the state.

valueuncons :: MonadState (Deque a) m => m (Maybe a)

#

O(1), occasionally O(n). Get the first element if deque is not empty, removing the element.

valueunsnoc :: MonadState (Deque a) m => m (Maybe a)

#

O(1), occasionally O(n). Get the last element if deque is not empty, removing the element.

valuenull :: MonadState (Deque a) m => m Bool

#

O(1). Check whether deque is empty.

valuelength :: MonadState (Deque a) m => m Int

#

O(1). Check whether deque is empty.

valuehead :: MonadState (Deque a) m => m (Maybe a)

#

O(1), occasionally O(n). Get the first element if deque is not empty.

valuelast :: MonadState (Deque a) m => m (Maybe a)

#

O(1), occasionally O(n). Get the last element if deque is not empty.

valuetail :: MonadState (Deque a) m => m ()

#

O(1), occasionally O(n). Keep all elements but the first one.

valueinit :: MonadState (Deque a) m => m ()

#

O(1), occasionally O(n). Keep all elements but the last one.