{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# OPTIONS_GHC -Wall #-}
{-# OPTIONS_HADDOCK show-extensions #-}
module ToySolver.Internal.Data.PriorityQueue
(
PriorityQueue
, Index
, newPriorityQueue
, newPriorityQueueBy
, NewFifo (..)
, getElems
, clear
, clone
, Enqueue (..)
, Dequeue (..)
, QueueSize (..)
, rebuild
, getHeapArray
, getHeapVec
, resizeHeapCapacity
) where
import Control.Loop
import qualified Data.Array.IO as A
import Data.Queue.Classes
import qualified ToySolver.Internal.Data.Vec as Vec
type Index = Int
data PriorityQueue a
= PriorityQueue
{ forall a. PriorityQueue a -> a -> a -> IO Bool
lt :: !(a -> a -> IO Bool)
, forall a. PriorityQueue a -> Vec a
heap :: !(Vec.Vec a)
}
newPriorityQueue :: Ord a => IO (PriorityQueue a)
newPriorityQueue :: forall a. Ord a => IO (PriorityQueue a)
newPriorityQueue = forall a. (a -> a -> IO Bool) -> IO (PriorityQueue a)
newPriorityQueueBy (\a
a a
b -> forall (m :: * -> *) a. Monad m => a -> m a
return (a
a forall a. Ord a => a -> a -> Bool
< a
b))
newPriorityQueueBy :: (a -> a -> IO Bool) -> IO (PriorityQueue a)
newPriorityQueueBy :: forall a. (a -> a -> IO Bool) -> IO (PriorityQueue a)
newPriorityQueueBy a -> a -> IO Bool
cmp = do
GenericVec IOArray a
vec <- forall (a :: * -> * -> *) e. MArray a e IO => IO (GenericVec a e)
Vec.new
forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ PriorityQueue{ lt :: a -> a -> IO Bool
lt = a -> a -> IO Bool
cmp, heap :: GenericVec IOArray a
heap = GenericVec IOArray a
vec }
getElems :: PriorityQueue a -> IO [a]
getElems :: forall a. PriorityQueue a -> IO [a]
getElems PriorityQueue a
q = forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> IO [e]
Vec.getElems (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
clear :: PriorityQueue a -> IO ()
clear :: forall a. PriorityQueue a -> IO ()
clear PriorityQueue a
q = forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> IO ()
Vec.clear (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
clone :: PriorityQueue a -> IO (PriorityQueue a)
clone :: forall a. PriorityQueue a -> IO (PriorityQueue a)
clone PriorityQueue a
q = do
GenericVec IOArray a
h2 <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> IO (GenericVec a e)
Vec.clone (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ PriorityQueue{ lt :: a -> a -> IO Bool
lt = forall a. PriorityQueue a -> a -> a -> IO Bool
lt PriorityQueue a
q, heap :: GenericVec IOArray a
heap = GenericVec IOArray a
h2 }
instance Ord a => NewFifo (PriorityQueue a) IO where
newFifo :: IO (PriorityQueue a)
newFifo = forall a. Ord a => IO (PriorityQueue a)
newPriorityQueue
instance Enqueue (PriorityQueue a) IO a where
enqueue :: PriorityQueue a -> a -> IO ()
enqueue PriorityQueue a
q a
val = do
Index
n <- forall (a :: * -> * -> *) e. GenericVec a e -> IO Index
Vec.getSize (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> e -> IO ()
Vec.push (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) a
val
forall a. PriorityQueue a -> Index -> IO ()
up PriorityQueue a
q Index
n
instance Dequeue (PriorityQueue a) IO a where
dequeue :: PriorityQueue a -> IO (Maybe a)
dequeue PriorityQueue a
q = do
Index
n <- forall (a :: * -> * -> *) e. GenericVec a e -> IO Index
Vec.getSize (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
case Index
n of
Index
0 ->
forall (m :: * -> *) a. Monad m => a -> m a
return forall a. Maybe a
Nothing
Index
_ -> do
a
val <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO e
Vec.unsafeRead (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
0
if Index
n forall a. Eq a => a -> a -> Bool
== Index
1 then do
forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO ()
Vec.resize (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) (Index
nforall a. Num a => a -> a -> a
-Index
1)
else do
a
val1 <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> IO e
Vec.unsafePop (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> e -> IO ()
Vec.unsafeWrite (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
0 a
val1
forall a. PriorityQueue a -> Index -> IO ()
down PriorityQueue a
q Index
0
forall (m :: * -> *) a. Monad m => a -> m a
return (forall a. a -> Maybe a
Just a
val)
dequeueBatch :: PriorityQueue a -> IO [a]
dequeueBatch PriorityQueue a
q = [a] -> IO [a]
go []
where
go :: [a] -> IO [a]
go :: [a] -> IO [a]
go [a]
xs = do
Maybe a
r <- forall q (m :: * -> *) a. Dequeue q m a => q -> m (Maybe a)
dequeue PriorityQueue a
q
case Maybe a
r of
Maybe a
Nothing -> forall (m :: * -> *) a. Monad m => a -> m a
return (forall a. [a] -> [a]
reverse [a]
xs)
Just a
x -> [a] -> IO [a]
go (a
xforall a. a -> [a] -> [a]
:[a]
xs)
instance QueueSize (PriorityQueue a) IO where
queueSize :: PriorityQueue a -> IO Index
queueSize PriorityQueue a
q = forall (a :: * -> * -> *) e. GenericVec a e -> IO Index
Vec.getSize (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
up :: PriorityQueue a -> Index -> IO ()
up :: forall a. PriorityQueue a -> Index -> IO ()
up PriorityQueue a
q !Index
i = do
a
val <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO e
Vec.unsafeRead (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
i
let loop :: Index -> IO Index
loop Index
0 = forall (m :: * -> *) a. Monad m => a -> m a
return Index
0
loop Index
j = do
let p :: Index
p = Index -> Index
parent Index
j
a
val_p <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO e
Vec.unsafeRead (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
p
Bool
b <- forall a. PriorityQueue a -> a -> a -> IO Bool
lt PriorityQueue a
q a
val a
val_p
if Bool
b
then do
forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> e -> IO ()
Vec.unsafeWrite (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
j a
val_p
Index -> IO Index
loop Index
p
else forall (m :: * -> *) a. Monad m => a -> m a
return Index
j
Index
j <- Index -> IO Index
loop Index
i
forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> e -> IO ()
Vec.unsafeWrite (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
j a
val
down :: PriorityQueue a -> Index -> IO ()
down :: forall a. PriorityQueue a -> Index -> IO ()
down PriorityQueue a
q !Index
i = do
Index
n <- forall (a :: * -> * -> *) e. GenericVec a e -> IO Index
Vec.getSize (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
a
val <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO e
Vec.unsafeRead (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
i
let loop :: Index -> IO Index
loop !Index
j = do
let !l :: Index
l = Index -> Index
left Index
j
!r :: Index
r = Index -> Index
right Index
j
if Index
l forall a. Ord a => a -> a -> Bool
>= Index
n
then forall (m :: * -> *) a. Monad m => a -> m a
return Index
j
else do
Index
child <- do
if Index
r forall a. Ord a => a -> a -> Bool
>= Index
n
then forall (m :: * -> *) a. Monad m => a -> m a
return Index
l
else do
a
val_l <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO e
Vec.unsafeRead (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
l
a
val_r <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO e
Vec.unsafeRead (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
r
Bool
b <- forall a. PriorityQueue a -> a -> a -> IO Bool
lt PriorityQueue a
q a
val_r a
val_l
if Bool
b
then forall (m :: * -> *) a. Monad m => a -> m a
return Index
r
else forall (m :: * -> *) a. Monad m => a -> m a
return Index
l
a
val_child <- forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO e
Vec.unsafeRead (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
child
Bool
b <- forall a. PriorityQueue a -> a -> a -> IO Bool
lt PriorityQueue a
q a
val_child a
val
if Bool -> Bool
not Bool
b
then forall (m :: * -> *) a. Monad m => a -> m a
return Index
j
else do
forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> e -> IO ()
Vec.unsafeWrite (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
j a
val_child
Index -> IO Index
loop Index
child
Index
j <- Index -> IO Index
loop Index
i
forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> e -> IO ()
Vec.unsafeWrite (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
j a
val
rebuild :: PriorityQueue a -> IO ()
rebuild :: forall a. PriorityQueue a -> IO ()
rebuild PriorityQueue a
q = do
Index
n <- forall (a :: * -> * -> *) e. GenericVec a e -> IO Index
Vec.getSize (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
forall (m :: * -> *) a.
Monad m =>
a -> (a -> Bool) -> (a -> a) -> (a -> m ()) -> m ()
forLoop Index
0 (forall a. Ord a => a -> a -> Bool
<Index
n) (forall a. Num a => a -> a -> a
+Index
1) forall a b. (a -> b) -> a -> b
$ \Index
i -> do
forall a. PriorityQueue a -> Index -> IO ()
up PriorityQueue a
q Index
i
getHeapArray :: PriorityQueue a -> IO (A.IOArray Index a)
getHeapArray :: forall a. PriorityQueue a -> IO (IOArray Index a)
getHeapArray PriorityQueue a
q = forall (a :: * -> * -> *) e. GenericVec a e -> IO (a Index e)
Vec.getArray (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
getHeapVec :: PriorityQueue a -> IO (Vec.Vec a)
getHeapVec :: forall a. PriorityQueue a -> IO (Vec a)
getHeapVec PriorityQueue a
q = forall (m :: * -> *) a. Monad m => a -> m a
return (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q)
resizeHeapCapacity :: PriorityQueue a -> Int -> IO ()
resizeHeapCapacity :: forall a. PriorityQueue a -> Index -> IO ()
resizeHeapCapacity PriorityQueue a
q Index
capa = forall (a :: * -> * -> *) e.
MArray a e IO =>
GenericVec a e -> Index -> IO ()
Vec.resizeCapacity (forall a. PriorityQueue a -> Vec a
heap PriorityQueue a
q) Index
capa
{-# INLINE left #-}
left :: Index -> Index
left :: Index -> Index
left Index
i = Index
iforall a. Num a => a -> a -> a
*Index
2 forall a. Num a => a -> a -> a
+ Index
1
{-# INLINE right #-}
right :: Index -> Index
right :: Index -> Index
right Index
i = (Index
iforall a. Num a => a -> a -> a
+Index
1)forall a. Num a => a -> a -> a
*Index
2;
{-# INLINE parent #-}
parent :: Index -> Index
parent :: Index -> Index
parent Index
i = (Index
iforall a. Num a => a -> a -> a
-Index
1) forall a. Integral a => a -> a -> a
`div` Index
2