deque 0.4 → 0.4.0.1

raw patch · 3 files changed

+9/−5 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

deque.cabal +1/−1
library/Deque/Lazy/State.hs +4/−2
library/Deque/Strict/State.hs +4/−2

deque.cabal view

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

library/Deque/Lazy/State.hs view

@@ -103,7 +103,8 @@  {-| /O(1)/, occasionally /O(n)/.-Get the first element and deque without it if it's not empty.+Get the first element if deque is not empty,+removing the element. -} uncons :: MonadState (Deque a) m => m (Maybe a) uncons = state (\ deque -> case Deque.uncons deque of@@ -112,7 +113,8 @@  {-| /O(1)/, occasionally /O(n)/.-Get the last element and deque without it if it's not empty.+Get the last element if deque is not empty,+removing the element. -} unsnoc :: MonadState (Deque a) m => m (Maybe a) unsnoc = state (\ deque -> case Deque.unsnoc deque of

library/Deque/Strict/State.hs view

@@ -103,7 +103,8 @@  {-| /O(1)/, occasionally /O(n)/.-Get the first element and deque without it if it's not empty.+Get the first element if deque is not empty,+removing the element. -} uncons :: MonadState (Deque a) m => m (Maybe a) uncons = state (\ deque -> case Deque.uncons deque of@@ -112,7 +113,8 @@  {-| /O(1)/, occasionally /O(n)/.-Get the last element and deque without it if it's not empty.+Get the last element if deque is not empty,+removing the element. -} unsnoc :: MonadState (Deque a) m => m (Maybe a) unsnoc = state (\ deque -> case Deque.unsnoc deque of