Safe Haskell	Safe-Inferred
Language	Haskell2010

Network.HTTP2.Priority.Internal

Synopsis

type Key = Int
type Weight = Int
type Deficit = Word
data Precedence = Precedence {
- deficit :: Deficit
- weight :: Weight
- dependency :: Key
}
newPrecedence :: Weight -> Precedence
data PriorityQueue a = PriorityQueue {
- baseDeficit :: Deficit
- queue :: Heap a
}
type Heap a = IntPSQ Precedence a
empty :: PriorityQueue a
isEmpty :: PriorityQueue a -> Bool
enqueue :: Key -> Precedence -> a -> PriorityQueue a -> PriorityQueue a
dequeue :: PriorityQueue a -> Maybe ( Key , Precedence , a, PriorityQueue a)
delete :: Key -> PriorityQueue a -> ( Maybe a, PriorityQueue a)

Documentation

type Key = Int Source #

type Weight = Int Source #

type Deficit = Word Source #

data Precedence Source #

Internal representation of priority in priority queues. The precedence of a dequeued entry should be specified to enqueue when the entry is enqueued again.

Constructors

Precedence
Fields deficit :: Deficit weight :: Weight dependency :: Key

Instances

Instances details

Eq Precedence Source #
Instance details Defined in Network.HTTP2.Priority.PSQ Methods (==) :: Precedence -> Precedence -> Bool Source # (/=) :: Precedence -> Precedence -> Bool Source #
Ord Precedence Source #
Instance details Defined in Network.HTTP2.Priority.PSQ Methods compare :: Precedence -> Precedence -> Ordering Source # (<) :: Precedence -> Precedence -> Bool Source # (<=) :: Precedence -> Precedence -> Bool Source # (>) :: Precedence -> Precedence -> Bool Source # (>=) :: Precedence -> Precedence -> Bool Source # max :: Precedence -> Precedence -> Precedence Source # min :: Precedence -> Precedence -> Precedence Source #
Show Precedence Source #
Instance details Defined in Network.HTTP2.Priority.PSQ Methods showsPrec :: Int -> Precedence -> ShowS Source # show :: Precedence -> String Source # showList :: [ Precedence ] -> ShowS Source #

newPrecedence :: Weight -> Precedence Source #

For test only

data PriorityQueue a Source #

Constructors

PriorityQueue
Fields baseDeficit :: Deficit queue :: Heap a

type Heap a = IntPSQ Precedence a Source #

empty :: PriorityQueue a Source #

isEmpty :: PriorityQueue a -> Bool Source #

enqueue :: Key -> Precedence -> a -> PriorityQueue a -> PriorityQueue a Source #

dequeue :: PriorityQueue a -> Maybe ( Key , Precedence , a, PriorityQueue a) Source #

delete :: Key -> PriorityQueue a -> ( Maybe a, PriorityQueue a) Source #