Feldspar.Data.Queue

Indexable FIFO queues

Documentation

data Queue a

Indexable FIFO queue

Constructors

Queue

Fields

• indexQ :: forall m. MonadComp m => Data Index -> m a
• putQ :: forall m. MonadComp m => a -> m ()
• withQ :: forall m b. (Syntax b, MonadComp m) => (Pull a -> m b) -> m b

initQueueFromBuffer :: forall m a. (Syntax a, MonadComp m) => Arr a -> m (Queue a)

Create a new cyclic queue using an existing array as buffer. The length of the array determines the queue size.

initQueue

Arguments

:: (Manifestable m vec a, Finite vec, Syntax a, MonadComp m)

=> vec

Initial content (also determines the queue size)

-> m (Queue a)

Create a new cyclic queue initialized by the given vector (which also determines the size)

newQueue :: (Syntax a, MonadComp m) => Data Length -> m (Queue a)

Create a new cyclic queue of the given length without initialization

initQueueFromBuffer2

Arguments

:: (Syntax a, MonadComp m)

=> Data Length

Queue size, must be <= half the buffer size

-> Arr a

Buffer

-> m (Queue a)

initQueue2

Arguments

:: (Pushy m vec a, Finite vec, Syntax a, MonadComp m)

=> vec

Initial content (also determines the queue size)

-> m (Queue a)

Create a new cyclic queue. This implementation uses a buffer twice as long as the queue size to avoid modulus operations when accessing the elements.

newQueue2

Arguments

:: (Syntax a, MonadComp m)

=> Data Length

Queue size

-> m (Queue a)

Create a new cyclic queue. This implementation uses a buffer twice as long as the queue size to avoid modulus operations when accessing the elements.