| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Twee.Queue
- class Heuristic h where
- emptyHeap :: Heap a
- data FIFO a = FIFO [a] [a]
- emptyFIFO :: FIFO a
- data Either1 h1 h2 a
- data Mix h a = Mix {}
- emptyMix :: Int -> Int -> h a -> h a -> Mix h a
- data Queue h a = Queue {
- queue :: !(h a)
- emptyQueue :: h a
- queueLabels :: Set Label
- nextLabel :: Label
- class Ord a => Labels a where
- empty :: h a -> Queue h a
- emptyFrom :: Queue q a -> Queue q a
- enqueue :: (Heuristic h, Labels a) => a -> Queue h a -> Queue h a
- reenqueue :: (Heuristic h, Labels a) => a -> Queue h a -> Queue h a
- dequeue :: (Heuristic h, Labels a) => Queue h a -> Maybe (a, Queue h a)
- queueSize :: (Heuristic h, Labels a) => Queue h a -> Int
- toList :: (Heuristic h, Labels a) => Queue h a -> [a]
- newtype Label = Label Int
- noLabel :: Label
- newLabel :: Queue h a -> (Label, Queue h a)
- deleteLabel :: Label -> Queue h a -> Queue h a
- data Labelled a = Labelled {}
- moveLabel :: Functor f => Labelled (f a) -> f (Labelled a)
- unlabelled :: a -> Labelled a
- data Heap a :: * -> *
Documentation
Constructors
| FIFO [a] [a] |
Constructors
| Mix | |
Constructors
| Queue | |
Fields
| |
unlabelled :: a -> Labelled a Source #