Crypto.Lol.Cyclotomic.Tensor.RepaTensor

A pure, repa-based implementation of the Tensor interface.

Documentation

data RT m r

An implementation of Tensor backed by repa.

Instances

Tensor RT

Associated Types

type TElt (RT :: Factored -> * -> *) r :: Constraint

Methods

entailIndexT :: Tagged * (RT m r) (Fact m :- (Applicative (RT m), Traversable (RT m)))

entailEqT :: Tagged * (RT m r) ((Eq r, Fact m, TElt RT r) :- Eq (RT m r))

entailZTT :: Tagged * (RT m r) ((ZeroTestable r, Fact m, TElt RT r) :- ZeroTestable (RT m r))

entailNFDataT :: Tagged * (RT m r) ((NFData r, Fact m, TElt RT r) :- NFData (RT m r))

entailRandomT :: Tagged * (RT m r) ((Random r, Fact m, TElt RT r) :- Random (RT m r))

entailShowT :: Tagged * (RT m r) ((Show r, Fact m, TElt RT r) :- Show (RT m r))

entailModuleT :: Tagged * (GF k fp d, RT m fp) ((GFCtx k fp d, Fact m, TElt RT fp) :- Module (GF k fp d) (RT m fp))

scalarPow :: (Additive r, Fact m, TElt RT r) => r -> RT m r

l :: (Additive r, Fact m, TElt RT r) => RT m r -> RT m r

lInv :: (Additive r, Fact m, TElt RT r) => RT m r -> RT m r

mulGPow :: (Ring r, Fact m, TElt RT r) => RT m r -> RT m r

mulGDec :: (Ring r, Fact m, TElt RT r) => RT m r -> RT m r

divGPow :: (ZeroTestable r, IntegralDomain r, Fact m, TElt RT r) => RT m r -> Maybe (RT m r)

divGDec :: (ZeroTestable r, IntegralDomain r, Fact m, TElt RT r) => RT m r -> Maybe (RT m r)

crtFuncs :: (CRTrans mon r, Fact m, TElt RT r) => mon (r -> RT m r, RT m r -> RT m r, RT m r -> RT m r, RT m r -> RT m r, RT m r -> RT m r)

tGaussianDec :: (OrdFloat q, Random q, TElt RT q, ToRational v, Fact m, MonadRandom rnd) => v -> rnd (RT m q)

gSqNormDec :: (Ring r, Fact m, TElt RT r) => RT m r -> r

twacePowDec :: (Ring r, Divides m m', TElt RT r) => RT m' r -> RT m r

embedPow :: (Additive r, Divides m m', TElt RT r) => RT m r -> RT m' r

embedDec :: (Additive r, Divides m m', TElt RT r) => RT m r -> RT m' r

crtExtFuncs :: (CRTrans mon r, Divides m m', TElt RT r) => mon (RT m' r -> RT m r, RT m r -> RT m' r)

coeffs :: (Ring r, Divides m m', TElt RT r) => RT m' r -> [RT m r]

powBasisPow :: (Ring r, TElt RT r, Divides m m') => Tagged Factored m [RT m' r]

crtSetDec :: (Divides m m', PrimeField fp, Coprime (PToF (CharOf PrimeBin fp)) m', TElt RT fp) => Tagged Factored m [RT m' fp]

fmapT :: (Fact m, TElt RT a, TElt RT b) => (a -> b) -> RT m a -> RT m b

zipWithT :: (Fact m, TElt RT a, TElt RT b, TElt RT c) => (a -> b -> c) -> RT m a -> RT m b -> RT m c

unzipT :: (Fact m, TElt RT (a, b), TElt RT a, TElt RT b) => RT m (a, b) -> (RT m a, RT m b)

Fact m => Functor (RT m)

Methods

fmap :: (a -> b) -> RT m a -> RT m b

(<$) :: a -> RT m b -> RT m a

Fact m => Applicative (RT m)

Methods

pure :: a -> RT m a

(<*>) :: RT m (a -> b) -> RT m a -> RT m b

(*>) :: RT m a -> RT m b -> RT m b

(<*) :: RT m a -> RT m b -> RT m a

Fact m => Foldable (RT m)

Methods

fold :: Monoid m => RT m m -> m

foldMap :: Monoid m => (a -> m) -> RT m a -> m

foldr :: (a -> b -> b) -> b -> RT m a -> b

foldr' :: (a -> b -> b) -> b -> RT m a -> b

foldl :: (b -> a -> b) -> b -> RT m a -> b

foldl' :: (b -> a -> b) -> b -> RT m a -> b

foldr1 :: (a -> a -> a) -> RT m a -> a

foldl1 :: (a -> a -> a) -> RT m a -> a

toList :: RT m a -> [a]

null :: RT m a -> Bool

length :: RT m a -> Int

elem :: Eq a => a -> RT m a -> Bool

maximum :: Ord a => RT m a -> a

minimum :: Ord a => RT m a -> a

sum :: Num a => RT m a -> a

product :: Num a => RT m a -> a

Fact m => Traversable (RT m)

Methods

traverse :: Applicative f => (a -> f b) -> RT m a -> f (RT m b)

sequenceA :: Applicative f => RT m (f a) -> f (RT m a)

mapM :: Monad m => (a -> m b) -> RT m a -> m (RT m b)

sequence :: Monad m => RT m (m a) -> m (RT m a)

Eq r => Eq (RT m r)

Methods

(==) :: RT m r -> RT m r -> Bool

(/=) :: RT m r -> RT m r -> Bool

Show r => Show (RT m r)

Methods

showsPrec :: Int -> RT m r -> ShowS

show :: RT m r -> String

showList :: [RT m r] -> ShowS

(Unbox r, Random (Arr m r)) => Random (RT m r)

Methods

randomR :: RandomGen g => (RT m r, RT m r) -> g -> (RT m r, g)

random :: RandomGen g => g -> (RT m r, g)

randomRs :: RandomGen g => (RT m r, RT m r) -> g -> [RT m r]

randoms :: RandomGen g => g -> [RT m r]

randomRIO :: (RT m r, RT m r) -> IO (RT m r)

randomIO :: IO (RT m r)

(Unbox r, Arbitrary (Arr m r)) => Arbitrary (RT m r)

Methods

arbitrary :: Gen (RT m r)

shrink :: RT m r -> [RT m r]

NFData r => NFData (RT m r)

Methods

rnf :: RT m r -> ()

(ZeroTestable (Arr m r), ZeroTestable (IZipVector m r)) => C (RT m r)

Methods

isZero :: RT m r -> Bool

(Unbox r, Additive (Arr m r)) => C (RT m r)

Methods

zero :: RT m r

(+) :: RT m r -> RT m r -> RT m r

(-) :: RT m r -> RT m r -> RT m r

negate :: RT m r -> RT m r

(Fact m, Reflects k q Double) => Protoable (RT m (RRq k q Double))

Associated Types

type ProtoType (RT m (RRq k q Double)) :: *

Methods

toProto :: RT m (RRq k q Double) -> ProtoType (RT m (RRq k q Double))

fromProto :: MonadError String m => ProtoType (RT m (RRq k q Double)) -> m (RT m (RRq k q Double))

(Fact m, Reflects k q Int64) => Protoable (RT m (ZqBasic k q Int64))

Associated Types

type ProtoType (RT m (ZqBasic k q Int64)) :: *

Methods

toProto :: RT m (ZqBasic k q Int64) -> ProtoType (RT m (ZqBasic k q Int64))

fromProto :: MonadError String m => ProtoType (RT m (ZqBasic k q Int64)) -> m (RT m (ZqBasic k q Int64))

(GFCtx k fp d, Fact m, Additive (RT m fp)) => C (GF k fp d) (RT m fp)

Methods

(*>) :: GF k fp d -> RT m fp -> RT m fp

type TElt RT r

type TElt RT r = (Unbox r, Elt r)

type ProtoType (RT m (RRq k q Double))

type ProtoType (RT m (RRq k q Double)) = Kq

type ProtoType (RT m (ZqBasic k q Int64))

type ProtoType (RT m (ZqBasic k q Int64)) = Rq