Safe Haskell	None
Language	GHC2021

Test.Credit.RandomAccess.Binary

Synopsis

data Stream (m :: Type -> Type) a
- = SCons a (Stream m a)
- | SNil
- | SIndirect (Thunk m (Lazy m) (Stream m a))
indirect :: MonadCredit m => m (Stream m a) -> m (Stream m a)
credit :: MonadCredit m => Credit -> Stream m a -> m ()
smatch :: MonadCredit m => Stream m a -> m b -> (a -> Stream m a -> m b) -> m b
data Tree a
- = Leaf a
- | Node Int (Tree a) (Tree a)
data Digit a
- = Zero
- | One (Tree a)
- | Two (Tree a) (Tree a)
size :: Tree a -> Int
link :: Tree a -> Tree a -> Tree a
consTree :: MonadCredit m => Tree a -> Stream m (Digit a) -> m (Stream m (Digit a))
unconsTree :: MonadCredit m => Stream m (Digit a) -> m (Maybe (Tree a, Stream m (Digit a)))
lookupTree :: MonadCredit m => Int -> Tree a -> m (Maybe a)
updateTree :: MonadCredit m => Int -> a -> Tree a -> m (Tree a)
newtype BinaryRA a (m :: Type -> Type) = BinaryRA {
- unBinaryRA :: Stream m (Digit a)
}

Documentation

Constructors

SCons a (Stream m a)
SNil
SIndirect (Thunk m (Lazy m) (Stream m a))

Instances details

(MonadMemory m, MemoryCell m a) => MemoryCell m (Stream m a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods prettyCell :: Stream m a -> m Memory Source #

Arguments

Smart destructor for streams, consuming one credit

Constructors

Leaf a
Node Int (Tree a) (Tree a)

Instances details

MemoryCell m a => MemoryCell m (Tree a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods prettyCell :: Tree a -> m Memory Source #
Show a => Show (Tree a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods showsPrec :: Int -> Tree a -> ShowS # show :: Tree a -> String # showList :: [Tree a] -> ShowS #
Eq a => Eq (Tree a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods (==) :: Tree a -> Tree a -> Bool # (/=) :: Tree a -> Tree a -> Bool #
Ord a => Ord (Tree a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods compare :: Tree a -> Tree a -> Ordering # (<) :: Tree a -> Tree a -> Bool # (<=) :: Tree a -> Tree a -> Bool # (>) :: Tree a -> Tree a -> Bool # (>=) :: Tree a -> Tree a -> Bool # max :: Tree a -> Tree a -> Tree a # min :: Tree a -> Tree a -> Tree a #

Constructors

Instances details

MemoryCell m a => MemoryCell m (Digit a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods prettyCell :: Digit a -> m Memory Source #
Show a => Show (Digit a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods showsPrec :: Int -> Digit a -> ShowS # show :: Digit a -> String # showList :: [Digit a] -> ShowS #
Eq a => Eq (Digit a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods (==) :: Digit a -> Digit a -> Bool # (/=) :: Digit a -> Digit a -> Bool #
Ord a => Ord (Digit a) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods compare :: Digit a -> Digit a -> Ordering # (<) :: Digit a -> Digit a -> Bool # (<=) :: Digit a -> Digit a -> Bool # (>) :: Digit a -> Digit a -> Bool # (>=) :: Digit a -> Digit a -> Bool # max :: Digit a -> Digit a -> Digit a # min :: Digit a -> Digit a -> Digit a #

newtype BinaryRA a (m :: Type -> Type) Source #

Constructors

BinaryRA
Fields unBinaryRA :: Stream m (Digit a)

Instances details

BoundedRandomAccess BinaryRA Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods qcost :: Size -> RandomAccessOp a -> Credit Source #
RandomAccess BinaryRA Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods empty :: MonadCredit m => m (BinaryRA a m) Source # cons :: MonadCredit m => a -> BinaryRA a m -> m (BinaryRA a m) Source # uncons :: MonadCredit m => BinaryRA a m -> m (Maybe (a, BinaryRA a m)) Source # lookup :: MonadCredit m => Int -> BinaryRA a m -> m (Maybe a) Source # update :: MonadCredit m => Int -> a -> BinaryRA a m -> m (BinaryRA a m) Source #
(MonadMemory m, MemoryCell m a) => MemoryCell m (BinaryRA a m) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods prettyCell :: BinaryRA a m -> m Memory Source #
Pretty a => MemoryStructure (BinaryRA (PrettyCell a)) Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods prettyStructure :: MonadMemory m => BinaryRA (PrettyCell a) m -> m Memory Source #