module Simulation.Aivika.PriorityQueue.Pure
(PriorityQueue,
queueNull,
queueCount,
emptyQueue,
enqueue,
dequeue,
queueFront) where
import Control.Monad
data PriorityQueue a = EmptyQueue
| Queue !Int !Double a !Int (PriorityQueue a) (PriorityQueue a)
deriving Int -> PriorityQueue a -> ShowS
[PriorityQueue a] -> ShowS
PriorityQueue a -> String
(Int -> PriorityQueue a -> ShowS)
-> (PriorityQueue a -> String)
-> ([PriorityQueue a] -> ShowS)
-> Show (PriorityQueue a)
forall a. Show a => Int -> PriorityQueue a -> ShowS
forall a. Show a => [PriorityQueue a] -> ShowS
forall a. Show a => PriorityQueue a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: forall a. Show a => Int -> PriorityQueue a -> ShowS
showsPrec :: Int -> PriorityQueue a -> ShowS
$cshow :: forall a. Show a => PriorityQueue a -> String
show :: PriorityQueue a -> String
$cshowList :: forall a. Show a => [PriorityQueue a] -> ShowS
showList :: [PriorityQueue a] -> ShowS
Show
queueNull :: PriorityQueue a -> Bool
queueNull :: forall a. PriorityQueue a -> Bool
queueNull PriorityQueue a
EmptyQueue = Bool
True
queueNull PriorityQueue a
_ = Bool
False
queueCount :: PriorityQueue a -> Int
queueCount :: forall a. PriorityQueue a -> Int
queueCount PriorityQueue a
EmptyQueue = Int
0
queueCount (Queue Int
n Double
k a
v Int
r PriorityQueue a
a PriorityQueue a
b) = Int
n
emptyQueue :: PriorityQueue a
emptyQueue :: forall a. PriorityQueue a
emptyQueue = PriorityQueue a
forall a. PriorityQueue a
EmptyQueue
enqueue :: PriorityQueue a -> Double -> a -> PriorityQueue a
enqueue :: forall a. PriorityQueue a -> Double -> a -> PriorityQueue a
enqueue PriorityQueue a
pq Double
k a
v = PriorityQueue a -> PriorityQueue a -> PriorityQueue a
forall a. PriorityQueue a -> PriorityQueue a -> PriorityQueue a
mergeQueues PriorityQueue a
pq (Int
-> Double
-> a
-> Int
-> PriorityQueue a
-> PriorityQueue a
-> PriorityQueue a
forall a.
Int
-> Double
-> a
-> Int
-> PriorityQueue a
-> PriorityQueue a
-> PriorityQueue a
Queue Int
1 Double
k a
v Int
1 PriorityQueue a
forall a. PriorityQueue a
EmptyQueue PriorityQueue a
forall a. PriorityQueue a
EmptyQueue)
dequeue :: PriorityQueue a -> PriorityQueue a
dequeue :: forall a. PriorityQueue a -> PriorityQueue a
dequeue PriorityQueue a
EmptyQueue = String -> PriorityQueue a
forall a. HasCallStack => String -> a
error String
"The queue is empty: dequeue"
dequeue (Queue Int
n Double
k a
v Int
r PriorityQueue a
a PriorityQueue a
b) = PriorityQueue a -> PriorityQueue a -> PriorityQueue a
forall a. PriorityQueue a -> PriorityQueue a -> PriorityQueue a
mergeQueues PriorityQueue a
a PriorityQueue a
b
queueFront :: PriorityQueue a -> (Double, a)
queueFront :: forall a. PriorityQueue a -> (Double, a)
queueFront PriorityQueue a
EmptyQueue = String -> (Double, a)
forall a. HasCallStack => String -> a
error String
"The queue is empty: queueFront"
queueFront (Queue Int
n Double
k a
v Int
r PriorityQueue a
a PriorityQueue a
b) = (Double
k, a
v)
queueRank :: PriorityQueue a -> Int
queueRank :: forall a. PriorityQueue a -> Int
queueRank PriorityQueue a
EmptyQueue = Int
0
queueRank (Queue Int
n Double
k a
v Int
r PriorityQueue a
a PriorityQueue a
b) = Int
r
makeQueue :: Double -> a -> PriorityQueue a -> PriorityQueue a -> PriorityQueue a
makeQueue :: forall a.
Double
-> a -> PriorityQueue a -> PriorityQueue a -> PriorityQueue a
makeQueue Double
k a
v PriorityQueue a
a PriorityQueue a
b
| PriorityQueue a -> Int
forall a. PriorityQueue a -> Int
queueRank PriorityQueue a
a Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
>= PriorityQueue a -> Int
forall a. PriorityQueue a -> Int
queueRank PriorityQueue a
b = Int
n Int -> PriorityQueue a -> PriorityQueue a
forall a b. a -> b -> b
`seq` Int
-> Double
-> a
-> Int
-> PriorityQueue a
-> PriorityQueue a
-> PriorityQueue a
forall a.
Int
-> Double
-> a
-> Int
-> PriorityQueue a
-> PriorityQueue a
-> PriorityQueue a
Queue Int
n Double
k a
v (PriorityQueue a -> Int
forall a. PriorityQueue a -> Int
queueRank PriorityQueue a
b Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) PriorityQueue a
a PriorityQueue a
b
| Bool
otherwise = Int
n Int -> PriorityQueue a -> PriorityQueue a
forall a b. a -> b -> b
`seq` Int
-> Double
-> a
-> Int
-> PriorityQueue a
-> PriorityQueue a
-> PriorityQueue a
forall a.
Int
-> Double
-> a
-> Int
-> PriorityQueue a
-> PriorityQueue a
-> PriorityQueue a
Queue Int
n Double
k a
v (PriorityQueue a -> Int
forall a. PriorityQueue a -> Int
queueRank PriorityQueue a
a Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) PriorityQueue a
b PriorityQueue a
a
where n :: Int
n = PriorityQueue a -> Int
forall a. PriorityQueue a -> Int
queueCount PriorityQueue a
a Int -> Int -> Int
forall a. Num a => a -> a -> a
+ PriorityQueue a -> Int
forall a. PriorityQueue a -> Int
queueCount PriorityQueue a
b Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1
mergeQueues :: PriorityQueue a -> PriorityQueue a -> PriorityQueue a
mergeQueues :: forall a. PriorityQueue a -> PriorityQueue a -> PriorityQueue a
mergeQueues PriorityQueue a
h PriorityQueue a
EmptyQueue = PriorityQueue a
h
mergeQueues PriorityQueue a
EmptyQueue PriorityQueue a
h = PriorityQueue a
h
mergeQueues h1 :: PriorityQueue a
h1@(Queue Int
_ Double
k1 a
v1 Int
_ PriorityQueue a
a1 PriorityQueue a
b1) h2 :: PriorityQueue a
h2@(Queue Int
_ Double
k2 a
v2 Int
_ PriorityQueue a
a2 PriorityQueue a
b2)
| Double
k1 Double -> Double -> Bool
forall a. Ord a => a -> a -> Bool
<= Double
k2 = Double
-> a -> PriorityQueue a -> PriorityQueue a -> PriorityQueue a
forall a.
Double
-> a -> PriorityQueue a -> PriorityQueue a -> PriorityQueue a
makeQueue Double
k1 a
v1 PriorityQueue a
a1 (PriorityQueue a -> PriorityQueue a -> PriorityQueue a
forall a. PriorityQueue a -> PriorityQueue a -> PriorityQueue a
mergeQueues PriorityQueue a
b1 PriorityQueue a
h2)
| Bool
otherwise = Double
-> a -> PriorityQueue a -> PriorityQueue a -> PriorityQueue a
forall a.
Double
-> a -> PriorityQueue a -> PriorityQueue a -> PriorityQueue a
makeQueue Double
k2 a
v2 PriorityQueue a
a2 (PriorityQueue a -> PriorityQueue a -> PriorityQueue a
forall a. PriorityQueue a -> PriorityQueue a -> PriorityQueue a
mergeQueues PriorityQueue a
h1 PriorityQueue a
b2)