Safe Haskell	None
Language	GHC2021

Test.Credit.RandomAccess.Base

Documentation

data RandomAccessOp a Source #

Constructors

Cons a
Uncons
Lookup Int
Update Int a

Instances

Instances details

Arbitrary a => Arbitrary (RandomAccessOp a) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods arbitrary :: Gen (RandomAccessOp a) # shrink :: RandomAccessOp a -> [RandomAccessOp a] #
Show a => Show (RandomAccessOp a) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods showsPrec :: Int -> RandomAccessOp a -> ShowS # show :: RandomAccessOp a -> String # showList :: [RandomAccessOp a] -> ShowS #
Eq a => Eq (RandomAccessOp a) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods (==) :: RandomAccessOp a -> RandomAccessOp a -> Bool # (/=) :: RandomAccessOp a -> RandomAccessOp a -> Bool #
Ord a => Ord (RandomAccessOp a) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods compare :: RandomAccessOp a -> RandomAccessOp a -> Ordering # (<) :: RandomAccessOp a -> RandomAccessOp a -> Bool # (<=) :: RandomAccessOp a -> RandomAccessOp a -> Bool # (>) :: RandomAccessOp a -> RandomAccessOp a -> Bool # (>=) :: RandomAccessOp a -> RandomAccessOp a -> Bool # max :: RandomAccessOp a -> RandomAccessOp a -> RandomAccessOp a # min :: RandomAccessOp a -> RandomAccessOp a -> RandomAccessOp a #
(Arbitrary a, BoundedRandomAccess q, Show a) => DataStructure (RA q a) (RandomAccessOp a) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods cost :: Size -> RandomAccessOp a -> Credit Source # create :: MonadLazy m => m (RA q a m) Source # perform :: MonadInherit m => Size -> RA q a m -> RandomAccessOp a -> m (Size, RA q a m) Source #

class RandomAccess (q :: Type -> (Type -> Type) -> Type) where Source #

Methods

empty :: MonadLazy m => m (q a m) Source #

cons :: MonadCredit m => a -> q a m -> m (q a m) Source #

uncons :: MonadCredit m => q a m -> m (Maybe (a, q a m)) Source #

lookup :: MonadCredit m => Int -> q a m -> m (Maybe a) Source #

update :: MonadCredit m => Int -> a -> q a m -> m (q a m) Source #

Instances

Instances details

RandomAccess FingerRA Source #
Instance details Defined in Test.Credit.Finger Methods empty :: MonadLazy m => m (FingerRA a m) Source # cons :: MonadCredit m => a -> FingerRA a m -> m (FingerRA a m) Source # uncons :: MonadCredit m => FingerRA a m -> m (Maybe (a, FingerRA a m)) Source # lookup :: MonadCredit m => Int -> FingerRA a m -> m (Maybe a) Source # update :: MonadCredit m => Int -> a -> FingerRA a m -> m (FingerRA a m) Source #
RandomAccess BinaryRA Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods empty :: MonadLazy 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 #
RandomAccess ZerolessRA Source #
Instance details Defined in Test.Credit.RandomAccess.Zeroless Methods empty :: MonadLazy m => m (ZerolessRA a m) Source # cons :: MonadCredit m => a -> ZerolessRA a m -> m (ZerolessRA a m) Source # uncons :: MonadCredit m => ZerolessRA a m -> m (Maybe (a, ZerolessRA a m)) Source # lookup :: MonadCredit m => Int -> ZerolessRA a m -> m (Maybe a) Source # update :: MonadCredit m => Int -> a -> ZerolessRA a m -> m (ZerolessRA a m) Source #

class RandomAccess q => BoundedRandomAccess (q :: Type -> (Type -> Type) -> Type) where Source #

Methods

qcost :: Size -> RandomAccessOp a -> Credit Source #

Instances

Instances details

BoundedRandomAccess FingerRA Source #
Instance details Defined in Test.Credit.Finger Methods qcost :: Size -> RandomAccessOp a -> Credit Source #
BoundedRandomAccess BinaryRA Source #
Instance details Defined in Test.Credit.RandomAccess.Binary Methods qcost :: Size -> RandomAccessOp a -> Credit Source #
BoundedRandomAccess ZerolessRA Source #
Instance details Defined in Test.Credit.RandomAccess.Zeroless Methods qcost :: Size -> RandomAccessOp a -> Credit Source #

data RA (q :: Type -> k -> Type) a (m :: k) Source #

Constructors

RA (q (PrettyCell a) m)

Instances

Instances details

MemoryCell m (q (PrettyCell a) m) => MemoryCell m (RA q a m) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods prettyCell :: RA q a m -> m Memory Source #
MemoryStructure (q (PrettyCell a)) => MemoryStructure (RA q a) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods prettyStructure :: MonadMemory m => RA q a m -> m Memory Source #
(Arbitrary a, BoundedRandomAccess q, Show a) => DataStructure (RA q a) (RandomAccessOp a) Source #
Instance details Defined in Test.Credit.RandomAccess.Base Methods cost :: Size -> RandomAccessOp a -> Credit Source # create :: MonadLazy m => m (RA q a m) Source # perform :: MonadInherit m => Size -> RA q a m -> RandomAccessOp a -> m (Size, RA q a m) Source #

idx :: Int -> Size -> Int Source #

norm :: Size -> RandomAccessOp a -> RandomAccessOp a Source #