ToySolver.Internal.Data.PriorityQueue

Priority queue implemented as array-based binary heap.

PriorityQueue type

data PriorityQueue a

Priority queue implemented as array-based binary heap.

Instances

Ord a => NewFifo (PriorityQueue a) IO

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

newFifo :: IO (PriorityQueue a)

QueueSize (PriorityQueue a) IO

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

queueSize :: PriorityQueue a -> IO Int

Dequeue (PriorityQueue a) IO a

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

dequeue :: PriorityQueue a -> IO (Maybe a)

dequeueBatch :: PriorityQueue a -> IO [a]

Enqueue (PriorityQueue a) IO a

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

enqueue :: PriorityQueue a -> a -> IO ()

enqueueBatch :: PriorityQueue a -> [a] -> IO ()

type Index = Int

Constructors

newPriorityQueue :: Ord a => IO (PriorityQueue a)

Build a priority queue with default ordering ((<) of Ord class)

newPriorityQueueBy :: (a -> a -> IO Bool) -> IO (PriorityQueue a)

Build a priority queue with a given less than operator.

class Monad m => NewFifo q (m :: Type -> Type) where

Construct a new FIFO queue.

Methods

newFifo :: m q

Instances

NewFifo PriorityQueue IO

Defined in ToySolver.Internal.Data.IndexedPriorityQueue

Methods

newFifo :: IO PriorityQueue

Ord a => NewFifo (PriorityQueue a) IO

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

newFifo :: IO (PriorityQueue a)

PrimMonad m => NewFifo (SeqQueue m a) m

Defined in ToySolver.Internal.Data.SeqQueue

Methods

newFifo :: m (SeqQueue m a)

Operators

getElems :: PriorityQueue a -> IO [a]

Return a list of all the elements of a priority queue. (not sorted)

clear :: PriorityQueue a -> IO ()

Remove all elements from a priority queue.

clone :: PriorityQueue a -> IO (PriorityQueue a)

Create a copy of a priority queue.

class Monad m => Enqueue q (m :: Type -> Type) a | q -> a where

Minimal complete definition

enqueue

Methods

enqueue :: q -> a -> m ()

Put an item into a queue. May block while trying to do so. No constraint is placed on the behavior of the queue except that every item put in "really ought to" come out sometime before dequeue returns a Nothing.

enqueueBatch :: q -> [a] -> m ()

Instances

Enqueue PriorityQueue IO Value

Defined in ToySolver.Internal.Data.IndexedPriorityQueue

Methods

enqueue :: PriorityQueue -> Value -> IO ()

enqueueBatch :: PriorityQueue -> [Value] -> IO ()

Enqueue q m a => Enqueue (WQueue q) m a

Defined in Data.Queue

Methods

enqueue :: WQueue q -> a -> m ()

enqueueBatch :: WQueue q -> [a] -> m ()

Enqueue (PriorityQueue a) IO a

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

enqueue :: PriorityQueue a -> a -> IO ()

enqueueBatch :: PriorityQueue a -> [a] -> IO ()

PrimMonad m => Enqueue (SeqQueue m a) m a

Defined in ToySolver.Internal.Data.SeqQueue

Methods

enqueue :: SeqQueue m a -> a -> m ()

enqueueBatch :: SeqQueue m a -> [a] -> m ()

class Monad m => Dequeue q (m :: Type -> Type) a | q -> a where

Minimal complete definition

dequeue

Methods

dequeue :: q -> m (Maybe a)

Pull an item out of a queue. Should not block. No ordering constraints are implied other than that any item that went into the queue "really ought to" come out before dequeue returns Nothing.

dequeueBatch :: q -> m [a]

Instances

Dequeue PriorityQueue IO Value

Defined in ToySolver.Internal.Data.IndexedPriorityQueue

Methods

dequeue :: PriorityQueue -> IO (Maybe Value)

dequeueBatch :: PriorityQueue -> IO [Value]

Dequeue q m a => Dequeue (RQueue q) m a

Defined in Data.Queue

Methods

dequeue :: RQueue q -> m (Maybe a)

dequeueBatch :: RQueue q -> m [a]

Dequeue (PriorityQueue a) IO a

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

dequeue :: PriorityQueue a -> IO (Maybe a)

dequeueBatch :: PriorityQueue a -> IO [a]

PrimMonad m => Dequeue (SeqQueue m a) m a

Defined in ToySolver.Internal.Data.SeqQueue

Methods

dequeue :: SeqQueue m a -> m (Maybe a)

dequeueBatch :: SeqQueue m a -> m [a]

class Monad m => QueueSize q (m :: Type -> Type) where

Methods

queueSize :: q -> m Int

return the number of elements in the queue

Instances

QueueSize PriorityQueue IO

Defined in ToySolver.Internal.Data.IndexedPriorityQueue

Methods

queueSize :: PriorityQueue -> IO Int

QueueSize (PriorityQueue a) IO

Defined in ToySolver.Internal.Data.PriorityQueue

Methods

queueSize :: PriorityQueue a -> IO Int

PrimMonad m => QueueSize (SeqQueue m a) m

Defined in ToySolver.Internal.Data.SeqQueue

Methods

queueSize :: SeqQueue m a -> m Int

rebuild :: PriorityQueue a -> IO ()

getHeapArray :: PriorityQueue a -> IO (IOArray Index a)

Get the internal representation of a given priority queue.

getHeapVec :: PriorityQueue a -> IO (Vec a)

Get the internal representation of a given priority queue.

Misc operations

resizeHeapCapacity :: PriorityQueue a -> Int -> IO ()

Pre-allocate internal buffer for n elements.