Advent.Queue

Description

Synopsis

data Queue a where
- pattern Empty :: Queue a
- pattern (:<|) :: a -> Queue a -> Queue a
(|>) :: Queue a -> a -> Queue a
singleton :: a -> Queue a
fromList :: [a] -> Queue a
snoc :: a -> Queue a -> Queue a
pop :: Queue a -> Maybe (a, Queue a)
appendList :: Queue a -> [a] -> Queue a

Documentation

data Queue a where Source #

FIFO Queue implementation

Bundled Patterns

pattern Empty :: Queue a

Empty queue

>>> Empty :: Queue Char
fromList ""

pattern (:<|) :: a -> Queue a -> Queue a

Pattern for pop

>>> let x :<| xs = fromList "abc" in (x, xs)
('a',fromList "bc")

Instances details

Foldable Queue Source #	Fold over elements in the order they would be returned by pop `>>>` `toList (fromList "abc")`"abc"
Instance details Defined in Advent.Queue Methods fold :: Monoid m => Queue m -> m # foldMap :: Monoid m => (a -> m) -> Queue a -> m # foldMap' :: Monoid m => (a -> m) -> Queue a -> m # foldr :: (a -> b -> b) -> b -> Queue a -> b # foldr' :: (a -> b -> b) -> b -> Queue a -> b # foldl :: (b -> a -> b) -> b -> Queue a -> b # foldl' :: (b -> a -> b) -> b -> Queue a -> b # foldr1 :: (a -> a -> a) -> Queue a -> a # foldl1 :: (a -> a -> a) -> Queue a -> a # toList :: Queue a -> [a] # null :: Queue a -> Bool # length :: Queue a -> Int # elem :: Eq a => a -> Queue a -> Bool # maximum :: Ord a => Queue a -> a # minimum :: Ord a => Queue a -> a # sum :: Num a => Queue a -> a # product :: Num a => Queue a -> a #
Read a => Read (Queue a) Source #
Instance details Defined in Advent.Queue Methods readsPrec :: Int -> ReadS (Queue a) # readList :: ReadS [Queue a] # readPrec :: ReadPrec (Queue a) # readListPrec :: ReadPrec [Queue a] #
Show a => Show (Queue a) Source #	Renders using `fromList` syntax. `>>>` `show (fromList "example")`"fromList \"example\""
Instance details Defined in Advent.Queue Methods showsPrec :: Int -> Queue a -> ShowS # show :: Queue a -> String # showList :: [Queue a] -> ShowS #

Add an element to the end of a queue. See: snoc

>>> fromList "abc" |> 'z'
fromList "abcz"

Construct a queue from a single element.

>>> singleton 'a'
fromList "a"

Construct a queue from a list. The head of the list will be the first element returned by pop

Add a new element to the end of a queue.

>>> snoc 'z' (fromList "abc")
fromList "abcz"

Remove an element from the front of a queue and a new queue without that element.

>>> pop (fromList "abc")
Just ('a',fromList "bc")

Append many items onto a queue. The items will pop from the queue in the same order as they are in the given list.

>>> appendList (fromList "xyz") "abc"
fromList "xyzabc"