Data.Repa.Flow.States

Documentation

class (Ord i, Eq i) => Next i where

Minimal complete definition

first, next, check

Methods

first :: i

Get the zero for this index type.

next :: i -> i -> Maybe i

Given an index an arity, get the next index after this one, or Nothing if there aren't any more.

check :: i -> i -> Bool

Check if an index is valid for this arity.

Instances

Next Int

Integer indices.

Methods

first :: Int

next :: Int -> Int -> Maybe Int

check :: Int -> Int -> Bool

Next ()

Unit indices.

Methods

first :: ()

next :: () -> () -> Maybe ()

check :: () -> () -> Bool

Next (Int, Int)

Tuple indices.

Methods

first :: (Int, Int)

next :: (Int, Int) -> (Int, Int) -> Maybe (Int, Int)

check :: (Int, Int) -> (Int, Int) -> Bool

class (Ord i, Next i, Monad m) => States i m where

Minimal complete definition

extentRefs, newRefs, readRefs, writeRefs

Associated Types

data Refs i m a

A collection of mutable references.

Methods

extentRefs :: Refs i m a -> i

Get the extent of the collection.

newRefs :: i -> a -> m (Refs i m a)

Allocate a new state of the given arity, also returning an index to the first element of the collection.

readRefs :: Refs i m a -> i -> m a

Write an element of the state.

writeRefs :: Refs i m a -> i -> a -> m ()

Read an element of the state.

Instances

States Int IO

Associated Types

data Refs Int (IO :: * -> *) a :: *

Methods

extentRefs :: Refs Int IO a -> Int

newRefs :: Int -> a -> IO (Refs Int IO a)

readRefs :: Refs Int IO a -> Int -> IO a

writeRefs :: Refs Int IO a -> Int -> a -> IO ()

(Monad m, States Int m) => States () m

Associated Types

data Refs () (m :: * -> *) a :: *

Methods

extentRefs :: Refs () m a -> ()

newRefs :: () -> a -> m (Refs () m a)

readRefs :: Refs () m a -> () -> m a

writeRefs :: Refs () m a -> () -> a -> m ()

foldRefsM :: States i m => (a -> b -> b) -> b -> Refs i m a -> m b

Fold all the elements in a collection of refs.

toListM :: States i m => Refs i m a -> m [a]