Text.Regex.Applicative.StateQueue

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

Documentation

data 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.

Instances

Foldable StateQueue

Eq a => Eq (StateQueue a)

Show a => Show (StateQueue a)

empty :: StateQueue a

The empty state queue

insert :: 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.

insertUnique

Arguments

:: Int

key

-> a

-> StateQueue a

-> StateQueue a

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

getElements :: StateQueue a -> [a]

Get the list of all elements