Moduleabstract-deque-0.3Haskell98

Data.Concurrent.Deque.Reference

A strawman implementation of concurrent Dequeues. This implementation is so simple that it also makes a good reference implementation for debugging.

The queue representation is simply an IORef containing a Data.Sequence.

Also see Data.Concurrent.Deque.Reference.DequeInstance. By convention a module of this name is also provided.

Synopsis

datadata SimpleDeque elt

Stores a size bound (if any) as well as a mutable Seq.

Instances5BoundedL, BoundedR, DequeClass, PopL, PushR

BoundedL SimpleDequeDefined in abstract-deque-0.3 · Data.Concurrent.Deque.Reference
BoundedR SimpleDequeDefined in abstract-deque-0.3 · Data.Concurrent.Deque.Reference
DequeClass SimpleDequeDefined in abstract-deque-0.3 · Data.Concurrent.Deque.Reference
PopL SimpleDequeDefined in abstract-deque-0.3 · Data.Concurrent.Deque.Reference
PushR SimpleDequeDefined in abstract-deque-0.3 · Data.Concurrent.Deque.Reference

valuenewQ :: IO (SimpleDeque elt)

valuenullQ :: SimpleDeque elt -> IO Bool

valuenewBoundedQ :: Int -> IO (SimpleDeque elt)

valuepushL :: SimpleDeque t -> t -> IO ()

valuepushR :: SimpleDeque t -> t -> IO ()

valuetryPopR :: SimpleDeque a -> IO (Maybe a)

valuetryPopL :: SimpleDeque a -> IO (Maybe a)

valuetryPushL :: SimpleDeque a -> a -> IO Bool

valuetryPushR :: SimpleDeque a -> a -> IO Bool

value_is_using_CAS :: Bool