deque 0.4.1 → 0.4.2

raw patch · 5 files changed

+29/−1 lines, 5 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

+ Deque.Lazy.Reader: span :: MonadReader (Deque a) m => (a -> Bool) -> m (Deque a, Deque a)

+ Deque.Lazy.State: span :: MonadState (Deque a) m => (a -> Bool) -> m (Deque a)

+ Deque.Strict.Reader: span :: MonadReader (Deque a) m => (a -> Bool) -> m (Deque a, Deque a)

+ Deque.Strict.State: span :: MonadState (Deque a) m => (a -> Bool) -> m (Deque a)

deque.cabal view

@@ -1,5 +1,5 @@ name: deque-version: 0.4.1+version: 0.4.2 synopsis: Double-ended queues description:   Strict and lazy implementations of Double-Ended Queue (aka Dequeue or Deque)

library/Deque/Lazy/Reader.hs view

@@ -102,6 +102,13 @@ dropWhile predicate = reader (Deque.dropWhile predicate)  {-|+/O(n)/.+Same as @(,) <$> `takeWhile` predicate <*> `dropWhile` predicate@.+-}+span :: MonadReader (Deque a) m => (a -> Bool) -> m (Deque a, Deque a)+span predicate = reader (Deque.span predicate)++{-| /O(1)/, occasionally /O(n)/. Get the first element and deque without it if it's not empty. -}

library/Deque/Lazy/State.hs view

@@ -102,6 +102,13 @@ dropWhile predicate = modify (Deque.dropWhile predicate)  {-|+/O(n)/.+Return the first elements satisfying the predicate, removing them from the state.+-}+span :: MonadState (Deque a) m => (a -> Bool) -> m (Deque a)+span predicate = state (Deque.span predicate)++{-| /O(1)/, occasionally /O(n)/. Get the first element if deque is not empty, removing the element.

library/Deque/Strict/Reader.hs view

@@ -102,6 +102,13 @@ dropWhile predicate = reader (Deque.dropWhile predicate)  {-|+/O(n)/.+Same as @(,) <$> `takeWhile` predicate <*> `dropWhile` predicate@.+-}+span :: MonadReader (Deque a) m => (a -> Bool) -> m (Deque a, Deque a)+span predicate = reader (Deque.span predicate)++{-| /O(1)/, occasionally /O(n)/. Get the first element and deque without it if it's not empty. -}

library/Deque/Strict/State.hs view

@@ -102,6 +102,13 @@ dropWhile predicate = modify (Deque.dropWhile predicate)  {-|+/O(n)/.+Return the first elements satisfying the predicate, removing them from the state.+-}+span :: MonadState (Deque a) m => (a -> Bool) -> m (Deque a)+span predicate = state (Deque.span predicate)++{-| /O(1)/, occasionally /O(n)/. Get the first element if deque is not empty, removing the element.