arbor-lru-cache-0.1.1.1: LRU cache based on STM

Safe HaskellSafe
LanguageHaskell2010

Arbor.LruCache.Internal.PriorityQueue

Documentation

newtype PQueue p v Source #

Constructors

PQueue [(p, v)] 
Instances
(Eq p, Eq v) => Eq (PQueue p v) Source # 
Instance details

Defined in Arbor.LruCache.Internal.PriorityQueue

Methods

(==) :: PQueue p v -> PQueue p v -> Bool #

(/=) :: PQueue p v -> PQueue p v -> Bool #

(Show p, Show v) => Show (PQueue p v) Source # 
Instance details

Defined in Arbor.LruCache.Internal.PriorityQueue

Methods

showsPrec :: Int -> PQueue p v -> ShowS #

show :: PQueue p v -> String #

showList :: [PQueue p v] -> ShowS #

insert :: Eq v => p -> v -> PQueue p v -> PQueue p v Source #

take :: Ord p => Int -> PQueue p v -> ([v], PQueue p v) Source #

toList :: Ord p => PQueue p v -> [(p, v)] Source #

size :: PQueue p v -> Int Source #

forceSpine :: [a] -> [a] Source #