monadiccp-0.7.7: Constraint Programming

Safe HaskellSafe
LanguageHaskell98

Control.CP.PriorityQueue

Documentation

data Ord k => PriorityQueue k a Source #

Instances

Ord a => Queue (PriorityQueue a (a, b, c)) Source # 

Associated Types

type Elem (PriorityQueue a (a, b, c)) :: * Source #

Methods

emptyQ :: PriorityQueue a (a, b, c) -> PriorityQueue a (a, b, c) Source #

isEmptyQ :: PriorityQueue a (a, b, c) -> Bool Source #

popQ :: PriorityQueue a (a, b, c) -> (Elem (PriorityQueue a (a, b, c)), PriorityQueue a (a, b, c)) Source #

pushQ :: Elem (PriorityQueue a (a, b, c)) -> PriorityQueue a (a, b, c) -> PriorityQueue a (a, b, c) Source #

type Elem (PriorityQueue a (a, b, c)) Source # 
type Elem (PriorityQueue a (a, b, c)) = (a, b, c)

empty :: Ord k => PriorityQueue k a Source #

is_empty :: PriorityQueue k a -> Bool Source #

minKey :: Ord k => PriorityQueue k a -> k Source #

minKeyValue :: Ord k => PriorityQueue k a -> (k, a) Source #

insert :: Ord k => k -> a -> PriorityQueue k a -> PriorityQueue k a Source #

deleteMin :: Ord k => PriorityQueue k a -> ((k, a), PriorityQueue k a) Source #

deleteMinAndInsert :: Ord k => k -> a -> PriorityQueue k a -> PriorityQueue k a Source #