Moduleregex-applicative-0.3.4Haskell2010

Text.Regex.Applicative.StateQueue

This internal module is exposed only for testing and benchmarking. You don't need to import it.

1 type
4 values

Packageregex-applicative-0.3.4
Exports5
LanguageHaskell2010
LicenceMIT
SourceStateQueue.hs

datadata StateQueue a

StateQueue is a data structure that can efficiently insert elements (preserving their order) and check whether an element with the given Int key is already in the queue.

Instances3Foldable, Eq, Show

Foldable StateQueueDefined in regex-applicative-0.3.4 · Text.Regex.Applicative.StateQueue
Eq a => Eq (StateQueue a)Defined in regex-applicative-0.3.4 · Text.Regex.Applicative.StateQueue
Show a => Show (StateQueue a)Defined in regex-applicative-0.3.4 · Text.Regex.Applicative.StateQueue

valueempty :: StateQueue a

The empty state queue

valueinsert :: a -> StateQueue a -> StateQueue a

Insert an element in the state queue without a key.

Since insert doesn't take a key, it won't affect any insertUnique.

valueinsertUnique

:: Int
key
-> a
-> StateQueue a
-> StateQueue a

Insert an element in the state queue, unless there is already an element with the same key

valuegetElements :: StateQueue a -> [a]

Get the list of all elements