License | BSD-3-Clause |
---|---|
Maintainer | Jamie Willis |
Stability | unstable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Since: 0.1.0.0
Synopsis
- module Parsley.Internal.Common.Fresh
- module Parsley.Internal.Common.Indexed
- module Parsley.Internal.Common.QueueLike
- data Queue a
- data RewindQueue a
- module Parsley.Internal.Common.Utils
- module Parsley.Internal.Common.Vec
Documentation
Concrete FIFO Queue, with amortized constant operations.
Since: 1.5.0.0
data RewindQueue a Source #
Concrete FIFO Queue, with amortized constant operations.
Also keeps history of dequeued values, which can be undone in a LIFO manner.
Since: 1.5.0.0
Instances
QueueLike RewindQueue Source # | |
Defined in Parsley.Internal.Common.RewindQueue empty :: RewindQueue a Source # null :: RewindQueue a -> Bool Source # size :: RewindQueue a -> Int Source # enqueue :: a -> RewindQueue a -> RewindQueue a Source # dequeue :: RewindQueue a -> (a, RewindQueue a) Source # poke :: (a -> a) -> RewindQueue a -> (a, RewindQueue a) Source # enqueueAll :: [a] -> RewindQueue a -> RewindQueue a Source # | |
Show a => Show (RewindQueue a) Source # | |
Defined in Parsley.Internal.Common.RewindQueue.Impl showsPrec :: Int -> RewindQueue a -> ShowS # show :: RewindQueue a -> String # showList :: [RewindQueue a] -> ShowS # | |
Eq a => Eq (RewindQueue a) Source # | |
Defined in Parsley.Internal.Common.RewindQueue.Impl (==) :: RewindQueue a -> RewindQueue a -> Bool # (/=) :: RewindQueue a -> RewindQueue a -> Bool # |
module Parsley.Internal.Common.Vec