Deque.Lazy.Reader · deque-0.4.4.4

valuemap :: MonadReader (Deque a) m => (a -> b) -> m (Deque b)

#

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

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

#

O(n). Add elements to the begginning.

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

#

O(n). Add elements to the ending.

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

#

O(1). Add element in the beginning.

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

#

O(1). Add element in the ending.

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

#

O(1). Reverse the deque.

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

#

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

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

#

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

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

#

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

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

#

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

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

#

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

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

#

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

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

#

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

valuespan :: MonadReader (Deque a) m => (a -> Bool) -> m (Deque a, Deque a)

#

O(n). Same as (,) <$> takeWhile predicate <*> dropWhile predicate.

valueuncons :: MonadReader (Deque a) m => m (Maybe a, Deque a)

#

O(1), occasionally O(n). Get the first element and deque without it if it's not empty.

valueunsnoc :: MonadReader (Deque a) m => m (Maybe a, Deque a)

#

O(1), occasionally O(n). Get the last element and deque without it if it's not empty.

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

#

O(1). Check whether deque is empty.

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

#

O(1). Check whether deque is empty.

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

#

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

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

#

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

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

#

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

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

#

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