toysolver-0.1.0: Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

Copyright(c) Masahiro Sakai 2012
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable (MultiParamTypeClasses, FlexibleInstances, BangPatterns, TypeSynonymInstances)
Safe HaskellNone
LanguageHaskell2010

ToySolver.Internal.Data.IndexedPriorityQueue

Contents

Description

Priority queue implemented as array-based binary heap.

Synopsis

PriorityQueue type

data PriorityQueue Source

Priority queue implemented as array-based binary heap.

Constructors

newPriorityQueue :: IO PriorityQueue Source

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

newPriorityQueueBy :: (Value -> Value -> IO Bool) -> IO PriorityQueue Source

Build a priority queue with a given less than operator.

class Monad m => NewFifo q m where

Construct a new FIFO queue.

Methods

newFifo :: m q

Operators

getElems :: PriorityQueue -> IO [Value] Source

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

clear :: PriorityQueue -> IO () Source

Remove all elements from a priority queue.

clone :: PriorityQueue -> IO PriorityQueue Source

Create a copy of a priority queue.

class Monad m => Enqueue q m 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

class Monad m => Dequeue q m 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

class Monad m => QueueSize q m where

Methods

queueSize :: q -> m Int

return the number of elements in the queue

getHeapArray :: PriorityQueue -> IO (IOUArray Index Value) Source

Get the internal representation of a given priority queue.

getHeapVec :: PriorityQueue -> IO (UVec Value) Source

Get the internal representation of a given priority queue.

Misc operations

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

Pre-allocate internal buffer for n elements.

resizeTableCapacity :: PriorityQueue -> Int -> IO () Source

Pre-allocate internal buffer for [0..n-1] values.