Copyright | 2014 Edward Kmett Charles Durham [2015..2020] Trevor L. McDonell |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Trevor L. McDonell <trevor.mcdonell@gmail.com> |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | Haskell2010 |
0-D Vectors
Documentation
A 0-dimensional vector
>>>
pure 1 :: V0 Int
V0
>>>
V0 + V0
V0
Instances
Monad V0 | |
Functor V0 | |
MonadFix V0 | |
Applicative V0 | |
Foldable V0 | |
Defined in Linear.V0 fold :: Monoid m => V0 m -> m # foldMap :: Monoid m => (a -> m) -> V0 a -> m # foldr :: (a -> b -> b) -> b -> V0 a -> b # foldr' :: (a -> b -> b) -> b -> V0 a -> b # foldl :: (b -> a -> b) -> b -> V0 a -> b # foldl' :: (b -> a -> b) -> b -> V0 a -> b # foldr1 :: (a -> a -> a) -> V0 a -> a # foldl1 :: (a -> a -> a) -> V0 a -> a # elem :: Eq a => a -> V0 a -> Bool # maximum :: Ord a => V0 a -> a # | |
Traversable V0 | |
Functor V0 Source # | |
Distributive V0 | |
Representable V0 | |
Eq1 V0 | |
Ord1 V0 | |
Read1 V0 | |
Show1 V0 | |
MonadZip V0 | |
Serial1 V0 | |
Defined in Linear.V0 serializeWith :: MonadPut m => (a -> m ()) -> V0 a -> m () # deserializeWith :: MonadGet m => m a -> m (V0 a) # | |
Hashable1 V0 | |
Apply V0 | |
Trace V0 | |
Finite V0 | |
Metric V0 | |
Additive V0 | |
Bind V0 | |
Additive V0 Source # | |
Defined in Data.Array.Accelerate.Linear.V0 | |
Metric V0 Source # | |
Defined in Data.Array.Accelerate.Linear.V0 dot :: (Num a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp a Source # quadrance :: (Num a, Box V0 a) => Exp (V0 a) -> Exp a Source # qd :: (Num a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp a Source # distance :: (Floating a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp a Source # norm :: (Floating a, Box V0 a) => Exp (V0 a) -> Exp a Source # signorm :: (Floating a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) Source # | |
Trace V0 Source # | |
Lift Exp (V0 a) Source # | |
Unlift Exp (V0 a) Source # | |
Vector Vector (V0 a) | |
Defined in Linear.V0 basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V0 a) -> m (Vector (V0 a)) # basicUnsafeThaw :: PrimMonad m => Vector (V0 a) -> m (Mutable Vector (PrimState m) (V0 a)) # basicLength :: Vector (V0 a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (V0 a) -> Vector (V0 a) # basicUnsafeIndexM :: Monad m => Vector (V0 a) -> Int -> m (V0 a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V0 a) -> Vector (V0 a) -> m () # | |
MVector MVector (V0 a) | |
Defined in Linear.V0 basicLength :: MVector s (V0 a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (V0 a) -> MVector s (V0 a) # basicOverlaps :: MVector s (V0 a) -> MVector s (V0 a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V0 a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (V0 a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> V0 a -> m (MVector (PrimState m) (V0 a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V0 a) -> Int -> m (V0 a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V0 a) -> Int -> V0 a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (V0 a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (V0 a) -> V0 a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V0 a) -> MVector (PrimState m) (V0 a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V0 a) -> MVector (PrimState m) (V0 a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V0 a) -> Int -> m (MVector (PrimState m) (V0 a)) # | |
Elt a => Bounded (Exp (V0 a)) Source # | |
Bounded (V0 a) | |
Enum (V0 a) | |
Eq (V0 a) | |
Floating (V0 a) | |
Fractional (V0 a) | |
Data a => Data (V0 a) | |
Defined in Linear.V0 gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> V0 a -> c (V0 a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (V0 a) # dataTypeOf :: V0 a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (V0 a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V0 a)) # gmapT :: (forall b. Data b => b -> b) -> V0 a -> V0 a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V0 a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V0 a -> r # gmapQ :: (forall d. Data d => d -> u) -> V0 a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> V0 a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> V0 a -> m (V0 a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> V0 a -> m (V0 a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> V0 a -> m (V0 a) # | |
Num a => Num (Exp (V0 a)) Source # | |
Defined in Data.Array.Accelerate.Linear.V0 | |
Num (V0 a) | |
Ord (V0 a) | |
Read (V0 a) | |
Show (V0 a) | |
Ix (V0 a) | |
Generic (V0 a) | |
Semigroup (V0 a) | |
Monoid (V0 a) | |
Lift (V0 a) | |
Elt a => Ord (V0 a) Source # | |
Defined in Data.Array.Accelerate.Linear.V0 | |
Elt a => Eq (V0 a) Source # | |
Elt a => Elt (V0 a) Source # | |
Storable (V0 a) | |
Binary (V0 a) | |
Serial (V0 a) | |
Serialize (V0 a) | |
NFData (V0 a) | |
Hashable (V0 a) | |
Unbox (V0 a) | |
Defined in Linear.V0 | |
Ixed (V0 a) | |
Epsilon (V0 a) | |
Random (V0 a) | |
Generic1 V0 | |
FunctorWithIndex (E V0) V0 | |
FoldableWithIndex (E V0) V0 | |
TraversableWithIndex (E V0) V0 | |
Defined in Linear.V0 itraverse :: Applicative f => (E V0 -> a -> f b) -> V0 a -> f (V0 b) # itraversed :: IndexedTraversal (E V0) (V0 a) (V0 b) a b # | |
Each (V0 a) (V0 b) a b | |
(Elt a, Elt b) => Each (Exp (V0 a)) (Exp (V0 b)) (Exp a) (Exp b) Source # | |
type Rep V0 | |
type Size V0 | |
newtype MVector s (V0 a) | |
type Rep (V0 a) | |
type EltR (V0 a) | |
Defined in Data.Array.Accelerate.Linear.V0 | |
type Plain (V0 a) Source # | |
Defined in Data.Array.Accelerate.Linear.V0 | |
newtype Vector (V0 a) | |
type Index (V0 a) | |
type IxValue (V0 a) | |
type Rep1 V0 | |
Orphan instances
Functor V0 Source # | |
Additive V0 Source # | |
Metric V0 Source # | |
dot :: (Num a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp a Source # quadrance :: (Num a, Box V0 a) => Exp (V0 a) -> Exp a Source # qd :: (Num a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp a Source # distance :: (Floating a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) -> Exp a Source # norm :: (Floating a, Box V0 a) => Exp (V0 a) -> Exp a Source # signorm :: (Floating a, Box V0 a) => Exp (V0 a) -> Exp (V0 a) Source # | |
Lift Exp (V0 a) Source # | |
Unlift Exp (V0 a) Source # | |
Elt a => Bounded (Exp (V0 a)) Source # | |
Num a => Num (Exp (V0 a)) Source # | |
Elt a => Ord (V0 a) Source # | |
Elt a => Eq (V0 a) Source # | |
Elt a => Elt (V0 a) Source # | |
(Elt a, Elt b) => Each (Exp (V0 a)) (Exp (V0 b)) (Exp a) (Exp b) Source # | |