| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
SDL.Vect
Description
SDL's vector representation.
By default, re-exports the Linear and Linear.Affine modules from the
linear package. With the no-linear Cabal flag, instead exports a
duplicate implementation of the V2, V3, V4 and Point types from
SDL.Internal.Vect, which provides as many instances as possible for those
types while avoiding any additional dependencies.
Documentation
module Linear.Affine
module Linear
Point
newtype Point (f :: Type -> Type) a Source #
A handy wrapper to help distinguish points from vectors at the type level
Constructors
| P (f a) |
Instances
| Generic1 (Point f :: Type -> Type) | |
| Unbox (f a) => Vector Vector (Point f a) | |
Defined in Linear.Affine Methods basicUnsafeFreeze :: Mutable Vector s (Point f a) -> ST s (Vector (Point f a)) Source # basicUnsafeThaw :: Vector (Point f a) -> ST s (Mutable Vector s (Point f a)) Source # basicLength :: Vector (Point f a) -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector (Point f a) -> Vector (Point f a) Source # basicUnsafeIndexM :: Vector (Point f a) -> Int -> Box (Point f a) Source # basicUnsafeCopy :: Mutable Vector s (Point f a) -> Vector (Point f a) -> ST s () Source # elemseq :: Vector (Point f a) -> Point f a -> b -> b Source # | |
| Unbox (f a) => MVector MVector (Point f a) | |
Defined in Linear.Affine Methods basicLength :: MVector s (Point f a) -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s (Point f a) -> MVector s (Point f a) Source # basicOverlaps :: MVector s (Point f a) -> MVector s (Point f a) -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s (Point f a)) Source # basicInitialize :: MVector s (Point f a) -> ST s () Source # basicUnsafeReplicate :: Int -> Point f a -> ST s (MVector s (Point f a)) Source # basicUnsafeRead :: MVector s (Point f a) -> Int -> ST s (Point f a) Source # basicUnsafeWrite :: MVector s (Point f a) -> Int -> Point f a -> ST s () Source # basicClear :: MVector s (Point f a) -> ST s () Source # basicSet :: MVector s (Point f a) -> Point f a -> ST s () Source # basicUnsafeCopy :: MVector s (Point f a) -> MVector s (Point f a) -> ST s () Source # basicUnsafeMove :: MVector s (Point f a) -> MVector s (Point f a) -> ST s () Source # basicUnsafeGrow :: MVector s (Point f a) -> Int -> ST s (MVector s (Point f a)) Source # | |
| Representable f => Representable (Point f) | |
| Foldable f => Foldable (Point f) | |
Defined in Linear.Affine Methods fold :: Monoid m => Point f m -> m Source # foldMap :: Monoid m => (a -> m) -> Point f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Point f a -> m Source # foldr :: (a -> b -> b) -> b -> Point f a -> b Source # foldr' :: (a -> b -> b) -> b -> Point f a -> b Source # foldl :: (b -> a -> b) -> b -> Point f a -> b Source # foldl' :: (b -> a -> b) -> b -> Point f a -> b Source # foldr1 :: (a -> a -> a) -> Point f a -> a Source # foldl1 :: (a -> a -> a) -> Point f a -> a Source # toList :: Point f a -> [a] Source # null :: Point f a -> Bool Source # length :: Point f a -> Int Source # elem :: Eq a => a -> Point f a -> Bool Source # maximum :: Ord a => Point f a -> a Source # minimum :: Ord a => Point f a -> a Source # | |
| Eq1 f => Eq1 (Point f) | |
| Ord1 f => Ord1 (Point f) | |
Defined in Linear.Affine | |
| Read1 f => Read1 (Point f) | |
Defined in Linear.Affine Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Point f a) Source # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Point f a] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Point f a) Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Point f a] Source # | |
| Show1 f => Show1 (Point f) | |
| Traversable f => Traversable (Point f) | |
Defined in Linear.Affine | |
| Applicative f => Applicative (Point f) | |
| Functor f => Functor (Point f) | |
| Monad f => Monad (Point f) | |
| Serial1 f => Serial1 (Point f) | |
Defined in Linear.Affine Methods serializeWith :: MonadPut m => (a -> m ()) -> Point f a -> m () Source # deserializeWith :: MonadGet m => m a -> m (Point f a) Source # | |
| Distributive f => Distributive (Point f) | |
Defined in Linear.Affine | |
| Hashable1 f => Hashable1 (Point f) | |
Defined in Linear.Affine | |
| Additive f => Affine (Point f) | |
Defined in Linear.Affine | |
| Metric f => Metric (Point f) | |
| Finite f => Finite (Point f) | |
| R1 f => R1 (Point f) | |
| R2 f => R2 (Point f) | |
| R3 f => R3 (Point f) | |
| R4 f => R4 (Point f) | |
| Additive f => Additive (Point f) | |
Defined in Linear.Affine Methods zero :: Num a => Point f a Source # (^+^) :: Num a => Point f a -> Point f a -> Point f a Source # (^-^) :: Num a => Point f a -> Point f a -> Point f a Source # lerp :: Num a => a -> Point f a -> Point f a -> Point f a Source # liftU2 :: (a -> a -> a) -> Point f a -> Point f a -> Point f a Source # liftI2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c Source # | |
| Apply f => Apply (Point f) | |
| Bind f => Bind (Point f) | |
| (Typeable f, Typeable a, Data (f a)) => Data (Point f a) | |
Defined in Linear.Affine Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Point f a -> c (Point f a) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Point f a) Source # toConstr :: Point f a -> Constr Source # dataTypeOf :: Point f a -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Point f a)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Point f a)) Source # gmapT :: (forall b. Data b => b -> b) -> Point f a -> Point f a Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Point f a -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Point f a -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) Source # | |
| Storable (f a) => Storable (Point f a) | |
Defined in Linear.Affine Methods sizeOf :: Point f a -> Int Source # alignment :: Point f a -> Int Source # peekElemOff :: Ptr (Point f a) -> Int -> IO (Point f a) Source # pokeElemOff :: Ptr (Point f a) -> Int -> Point f a -> IO () Source # peekByteOff :: Ptr b -> Int -> IO (Point f a) Source # pokeByteOff :: Ptr b -> Int -> Point f a -> IO () Source # | |
| Monoid (f a) => Monoid (Point f a) | |
| Semigroup (f a) => Semigroup (Point f a) | |
| Generic (Point f a) | |
| Ix (f a) => Ix (Point f a) | |
Defined in Linear.Affine Methods range :: (Point f a, Point f a) -> [Point f a] Source # index :: (Point f a, Point f a) -> Point f a -> Int Source # unsafeIndex :: (Point f a, Point f a) -> Point f a -> Int Source # inRange :: (Point f a, Point f a) -> Point f a -> Bool Source # | |
| Num (f a) => Num (Point f a) | |
Defined in Linear.Affine Methods (+) :: Point f a -> Point f a -> Point f a Source # (-) :: Point f a -> Point f a -> Point f a Source # (*) :: Point f a -> Point f a -> Point f a Source # negate :: Point f a -> Point f a Source # abs :: Point f a -> Point f a Source # signum :: Point f a -> Point f a Source # fromInteger :: Integer -> Point f a Source # | |
| Read (f a) => Read (Point f a) | |
| Fractional (f a) => Fractional (Point f a) | |
| Show (f a) => Show (Point f a) | |
| Binary (f a) => Binary (Point f a) | |
| Serial (f a) => Serial (Point f a) | |
| Serialize (f a) => Serialize (Point f a) | |
| NFData (f a) => NFData (Point f a) | |
Defined in Linear.Affine | |
| Eq (f a) => Eq (Point f a) | |
| Ord (f a) => Ord (Point f a) | |
Defined in Linear.Affine | |
| Hashable (f a) => Hashable (Point f a) | |
| Ixed (f a) => Ixed (Point f a) | |
Defined in Linear.Affine | |
| Wrapped (Point f a) | |
| Epsilon (f a) => Epsilon (Point f a) | |
| Random (f a) => Random (Point f a) | |
| Unbox (f a) => Unbox (Point f a) | |
Defined in Linear.Affine | |
| t ~ Point g b => Rewrapped (Point f a) t | |
Defined in Linear.Affine | |
| Traversable f => Each (Point f a) (Point f b) a b | |
| type Rep1 (Point f :: Type -> Type) | |
Defined in Linear.Affine type Rep1 (Point f :: Type -> Type) = D1 ('MetaData "Point" "Linear.Affine" "linear-1.22-1667eab2f2cd5289649209dbfe141e37d11497ebaa622eeb775018047bd531ed" 'True) (C1 ('MetaCons "P" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f))) | |
| newtype MVector s (Point f a) | |
Defined in Linear.Affine | |
| type Rep (Point f) | |
Defined in Linear.Affine | |
| type Diff (Point f) | |
Defined in Linear.Affine | |
| type Size (Point f) | |
Defined in Linear.Affine | |
| type Rep (Point f a) | |
Defined in Linear.Affine | |
| type Index (Point f a) | |
Defined in Linear.Affine | |
| type IxValue (Point f a) | |
Defined in Linear.Affine | |
| type Unwrapped (Point f a) | |
Defined in Linear.Affine | |
| newtype Vector (Point f a) | |
Defined in Linear.Affine | |
Vectors
A 2-dimensional vector
>>>pure 1 :: V2 IntV2 1 1
>>>V2 1 2 + V2 3 4V2 4 6
>>>V2 1 2 * V2 3 4V2 3 8
>>>sum (V2 1 2)3
Constructors
| V2 !a !a |
Instances
| Representable V2 | |
| MonadFix V2 | |
| MonadZip V2 | |
| Foldable V2 | |
Defined in Linear.V2 Methods fold :: Monoid m => V2 m -> m Source # foldMap :: Monoid m => (a -> m) -> V2 a -> m Source # foldMap' :: Monoid m => (a -> m) -> V2 a -> m Source # foldr :: (a -> b -> b) -> b -> V2 a -> b Source # foldr' :: (a -> b -> b) -> b -> V2 a -> b Source # foldl :: (b -> a -> b) -> b -> V2 a -> b Source # foldl' :: (b -> a -> b) -> b -> V2 a -> b Source # foldr1 :: (a -> a -> a) -> V2 a -> a Source # foldl1 :: (a -> a -> a) -> V2 a -> a Source # toList :: V2 a -> [a] Source # length :: V2 a -> Int Source # elem :: Eq a => a -> V2 a -> Bool Source # maximum :: Ord a => V2 a -> a Source # minimum :: Ord a => V2 a -> a Source # | |
| Eq1 V2 | |
| Ord1 V2 | |
| Read1 V2 | |
Defined in Linear.V2 | |
| Show1 V2 | |
| Traversable V2 | |
| Applicative V2 | |
| Functor V2 | |
| Monad V2 | |
| Serial1 V2 | |
| Distributive V2 | |
| Foldable1 V2 | |
Defined in Linear.V2 Methods fold1 :: Semigroup m => V2 m -> m Source # foldMap1 :: Semigroup m => (a -> m) -> V2 a -> m Source # foldMap1' :: Semigroup m => (a -> m) -> V2 a -> m Source # toNonEmpty :: V2 a -> NonEmpty a Source # maximum :: Ord a => V2 a -> a Source # minimum :: Ord a => V2 a -> a Source # foldrMap1 :: (a -> b) -> (a -> b -> b) -> V2 a -> b Source # foldlMap1' :: (a -> b) -> (b -> a -> b) -> V2 a -> b Source # foldlMap1 :: (a -> b) -> (b -> a -> b) -> V2 a -> b Source # foldrMap1' :: (a -> b) -> (a -> b -> b) -> V2 a -> b Source # | |
| Hashable1 V2 | |
| Affine V2 | |
| Metric V2 | |
| Trace V2 | |
| Finite V2 | |
| R1 V2 | |
| R2 V2 | |
| Additive V2 | |
Defined in Linear.V2 | |
| Apply V2 | |
| Bind V2 | |
| Traversable1 V2 | |
| Generic1 V2 | |
| Num r => Coalgebra r (E V2) | |
| Unbox a => Vector Vector (V2 a) | |
Defined in Linear.V2 Methods basicUnsafeFreeze :: Mutable Vector s (V2 a) -> ST s (Vector (V2 a)) Source # basicUnsafeThaw :: Vector (V2 a) -> ST s (Mutable Vector s (V2 a)) Source # basicLength :: Vector (V2 a) -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector (V2 a) -> Vector (V2 a) Source # basicUnsafeIndexM :: Vector (V2 a) -> Int -> Box (V2 a) Source # basicUnsafeCopy :: Mutable Vector s (V2 a) -> Vector (V2 a) -> ST s () Source # | |
| Unbox a => MVector MVector (V2 a) | |
Defined in Linear.V2 Methods basicLength :: MVector s (V2 a) -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s (V2 a) -> MVector s (V2 a) Source # basicOverlaps :: MVector s (V2 a) -> MVector s (V2 a) -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s (V2 a)) Source # basicInitialize :: MVector s (V2 a) -> ST s () Source # basicUnsafeReplicate :: Int -> V2 a -> ST s (MVector s (V2 a)) Source # basicUnsafeRead :: MVector s (V2 a) -> Int -> ST s (V2 a) Source # basicUnsafeWrite :: MVector s (V2 a) -> Int -> V2 a -> ST s () Source # basicClear :: MVector s (V2 a) -> ST s () Source # basicSet :: MVector s (V2 a) -> V2 a -> ST s () Source # basicUnsafeCopy :: MVector s (V2 a) -> MVector s (V2 a) -> ST s () Source # basicUnsafeMove :: MVector s (V2 a) -> MVector s (V2 a) -> ST s () Source # basicUnsafeGrow :: MVector s (V2 a) -> Int -> ST s (MVector s (V2 a)) Source # | |
| Data a => Data (V2 a) | |
Defined in Linear.V2 Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> V2 a -> c (V2 a) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (V2 a) Source # toConstr :: V2 a -> Constr Source # dataTypeOf :: V2 a -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (V2 a)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V2 a)) Source # gmapT :: (forall b. Data b => b -> b) -> V2 a -> V2 a Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V2 a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V2 a -> r Source # gmapQ :: (forall d. Data d => d -> u) -> V2 a -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> V2 a -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> V2 a -> m (V2 a) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> V2 a -> m (V2 a) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> V2 a -> m (V2 a) Source # | |
| Storable a => Storable (V2 a) | |
Defined in Linear.V2 Methods sizeOf :: V2 a -> Int Source # alignment :: V2 a -> Int Source # peekElemOff :: Ptr (V2 a) -> Int -> IO (V2 a) Source # pokeElemOff :: Ptr (V2 a) -> Int -> V2 a -> IO () Source # peekByteOff :: Ptr b -> Int -> IO (V2 a) Source # pokeByteOff :: Ptr b -> Int -> V2 a -> IO () Source # | |
| Monoid a => Monoid (V2 a) | |
| Semigroup a => Semigroup (V2 a) | |
| Bounded a => Bounded (V2 a) | |
| Floating a => Floating (V2 a) | |
| Generic (V2 a) | |
| Ix a => Ix (V2 a) | |
Defined in Linear.V2 | |
| Num a => Num (V2 a) | |
| Read a => Read (V2 a) | |
| Fractional a => Fractional (V2 a) | |
| Show a => Show (V2 a) | |
| Binary a => Binary (V2 a) | |
| Serial a => Serial (V2 a) | |
| Serialize a => Serialize (V2 a) | |
| NFData a => NFData (V2 a) | |
| Eq a => Eq (V2 a) | |
| Ord a => Ord (V2 a) | |
| Hashable a => Hashable (V2 a) | |
| Ixed (V2 a) | |
| Epsilon a => Epsilon (V2 a) | |
| Random a => Random (V2 a) | |
| Unbox a => Unbox (V2 a) | |
Defined in Linear.V2 | |
| FoldableWithIndex (E V2) V2 | |
Defined in Linear.V2 Methods ifoldMap :: Monoid m => (E V2 -> a -> m) -> V2 a -> m Source # ifoldMap' :: Monoid m => (E V2 -> a -> m) -> V2 a -> m Source # ifoldr :: (E V2 -> a -> b -> b) -> b -> V2 a -> b Source # ifoldl :: (E V2 -> b -> a -> b) -> b -> V2 a -> b Source # | |
| FunctorWithIndex (E V2) V2 | |
| TraversableWithIndex (E V2) V2 | |
| Lift a => Lift (V2 a :: Type) | |
| Each (V2 a) (V2 b) a b | |
| Field1 (V2 a) (V2 a) a a | |
| Field2 (V2 a) (V2 a) a a | |
| type Rep V2 | |
| type Diff V2 | |
Defined in Linear.Affine | |
| type Size V2 | |
| type Rep1 V2 | |
Defined in Linear.V2 type Rep1 V2 = D1 ('MetaData "V2" "Linear.V2" "linear-1.22-1667eab2f2cd5289649209dbfe141e37d11497ebaa622eeb775018047bd531ed" 'False) (C1 ('MetaCons "V2" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1)) | |
| data MVector s (V2 a) | |
| type Rep (V2 a) | |
Defined in Linear.V2 type Rep (V2 a) = D1 ('MetaData "V2" "Linear.V2" "linear-1.22-1667eab2f2cd5289649209dbfe141e37d11497ebaa622eeb775018047bd531ed" 'False) (C1 ('MetaCons "V2" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a))) | |
| type Index (V2 a) | |
| type IxValue (V2 a) | |
| data Vector (V2 a) | |
A 3-dimensional vector
Constructors
| V3 !a !a !a |
Instances
| Representable V3 | |
| MonadFix V3 | |
| MonadZip V3 | |
| Foldable V3 | |
Defined in Linear.V3 Methods fold :: Monoid m => V3 m -> m Source # foldMap :: Monoid m => (a -> m) -> V3 a -> m Source # foldMap' :: Monoid m => (a -> m) -> V3 a -> m Source # foldr :: (a -> b -> b) -> b -> V3 a -> b Source # foldr' :: (a -> b -> b) -> b -> V3 a -> b Source # foldl :: (b -> a -> b) -> b -> V3 a -> b Source # foldl' :: (b -> a -> b) -> b -> V3 a -> b Source # foldr1 :: (a -> a -> a) -> V3 a -> a Source # foldl1 :: (a -> a -> a) -> V3 a -> a Source # toList :: V3 a -> [a] Source # length :: V3 a -> Int Source # elem :: Eq a => a -> V3 a -> Bool Source # maximum :: Ord a => V3 a -> a Source # minimum :: Ord a => V3 a -> a Source # | |
| Eq1 V3 | |
| Ord1 V3 | |
| Read1 V3 | |
Defined in Linear.V3 | |
| Show1 V3 | |
| Traversable V3 | |
| Applicative V3 | |
| Functor V3 | |
| Monad V3 | |
| Serial1 V3 | |
| Distributive V3 | |
| Foldable1 V3 | |
Defined in Linear.V3 Methods fold1 :: Semigroup m => V3 m -> m Source # foldMap1 :: Semigroup m => (a -> m) -> V3 a -> m Source # foldMap1' :: Semigroup m => (a -> m) -> V3 a -> m Source # toNonEmpty :: V3 a -> NonEmpty a Source # maximum :: Ord a => V3 a -> a Source # minimum :: Ord a => V3 a -> a Source # foldrMap1 :: (a -> b) -> (a -> b -> b) -> V3 a -> b Source # foldlMap1' :: (a -> b) -> (b -> a -> b) -> V3 a -> b Source # foldlMap1 :: (a -> b) -> (b -> a -> b) -> V3 a -> b Source # foldrMap1' :: (a -> b) -> (a -> b -> b) -> V3 a -> b Source # | |
| Hashable1 V3 | |
| Affine V3 | |
| Metric V3 | |
| Trace V3 | |
| Finite V3 | |
| R1 V3 | |
| R2 V3 | |
| R3 V3 | |
| Additive V3 | |
Defined in Linear.V3 | |
| Apply V3 | |
| Bind V3 | |
| Traversable1 V3 | |
| Generic1 V3 | |
| Num r => Coalgebra r (E V3) | |
| Unbox a => Vector Vector (V3 a) | |
Defined in Linear.V3 Methods basicUnsafeFreeze :: Mutable Vector s (V3 a) -> ST s (Vector (V3 a)) Source # basicUnsafeThaw :: Vector (V3 a) -> ST s (Mutable Vector s (V3 a)) Source # basicLength :: Vector (V3 a) -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector (V3 a) -> Vector (V3 a) Source # basicUnsafeIndexM :: Vector (V3 a) -> Int -> Box (V3 a) Source # basicUnsafeCopy :: Mutable Vector s (V3 a) -> Vector (V3 a) -> ST s () Source # | |
| Unbox a => MVector MVector (V3 a) | |
Defined in Linear.V3 Methods basicLength :: MVector s (V3 a) -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s (V3 a) -> MVector s (V3 a) Source # basicOverlaps :: MVector s (V3 a) -> MVector s (V3 a) -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s (V3 a)) Source # basicInitialize :: MVector s (V3 a) -> ST s () Source # basicUnsafeReplicate :: Int -> V3 a -> ST s (MVector s (V3 a)) Source # basicUnsafeRead :: MVector s (V3 a) -> Int -> ST s (V3 a) Source # basicUnsafeWrite :: MVector s (V3 a) -> Int -> V3 a -> ST s () Source # basicClear :: MVector s (V3 a) -> ST s () Source # basicSet :: MVector s (V3 a) -> V3 a -> ST s () Source # basicUnsafeCopy :: MVector s (V3 a) -> MVector s (V3 a) -> ST s () Source # basicUnsafeMove :: MVector s (V3 a) -> MVector s (V3 a) -> ST s () Source # basicUnsafeGrow :: MVector s (V3 a) -> Int -> ST s (MVector s (V3 a)) Source # | |
| Data a => Data (V3 a) | |
Defined in Linear.V3 Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> V3 a -> c (V3 a) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (V3 a) Source # toConstr :: V3 a -> Constr Source # dataTypeOf :: V3 a -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (V3 a)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V3 a)) Source # gmapT :: (forall b. Data b => b -> b) -> V3 a -> V3 a Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V3 a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V3 a -> r Source # gmapQ :: (forall d. Data d => d -> u) -> V3 a -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> V3 a -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> V3 a -> m (V3 a) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> V3 a -> m (V3 a) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> V3 a -> m (V3 a) Source # | |
| Storable a => Storable (V3 a) | |
Defined in Linear.V3 Methods sizeOf :: V3 a -> Int Source # alignment :: V3 a -> Int Source # peekElemOff :: Ptr (V3 a) -> Int -> IO (V3 a) Source # pokeElemOff :: Ptr (V3 a) -> Int -> V3 a -> IO () Source # peekByteOff :: Ptr b -> Int -> IO (V3 a) Source # pokeByteOff :: Ptr b -> Int -> V3 a -> IO () Source # | |
| Monoid a => Monoid (V3 a) | |
| Semigroup a => Semigroup (V3 a) | |
| Bounded a => Bounded (V3 a) | |
| Floating a => Floating (V3 a) | |
| Generic (V3 a) | |
| Ix a => Ix (V3 a) | |
Defined in Linear.V3 | |
| Num a => Num (V3 a) | |
| Read a => Read (V3 a) | |
| Fractional a => Fractional (V3 a) | |
| Show a => Show (V3 a) | |
| Binary a => Binary (V3 a) | |
| Serial a => Serial (V3 a) | |
| Serialize a => Serialize (V3 a) | |
| NFData a => NFData (V3 a) | |
| Eq a => Eq (V3 a) | |
| Ord a => Ord (V3 a) | |
| Hashable a => Hashable (V3 a) | |
| Ixed (V3 a) | |
| Epsilon a => Epsilon (V3 a) | |
| Random a => Random (V3 a) | |
| Unbox a => Unbox (V3 a) | |
Defined in Linear.V3 | |
| FoldableWithIndex (E V3) V3 | |
Defined in Linear.V3 Methods ifoldMap :: Monoid m => (E V3 -> a -> m) -> V3 a -> m Source # ifoldMap' :: Monoid m => (E V3 -> a -> m) -> V3 a -> m Source # ifoldr :: (E V3 -> a -> b -> b) -> b -> V3 a -> b Source # ifoldl :: (E V3 -> b -> a -> b) -> b -> V3 a -> b Source # | |
| FunctorWithIndex (E V3) V3 | |
| TraversableWithIndex (E V3) V3 | |
| Lift a => Lift (V3 a :: Type) | |
| Each (V3 a) (V3 b) a b | |
| Field1 (V3 a) (V3 a) a a | |
| Field2 (V3 a) (V3 a) a a | |
| Field3 (V3 a) (V3 a) a a | |
| type Rep V3 | |
| type Diff V3 | |
Defined in Linear.Affine | |
| type Size V3 | |
| type Rep1 V3 | |
Defined in Linear.V3 type Rep1 V3 = D1 ('MetaData "V3" "Linear.V3" "linear-1.22-1667eab2f2cd5289649209dbfe141e37d11497ebaa622eeb775018047bd531ed" 'False) (C1 ('MetaCons "V3" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1 :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1))) | |
| data MVector s (V3 a) | |
| type Rep (V3 a) | |
Defined in Linear.V3 type Rep (V3 a) = D1 ('MetaData "V3" "Linear.V3" "linear-1.22-1667eab2f2cd5289649209dbfe141e37d11497ebaa622eeb775018047bd531ed" 'False) (C1 ('MetaCons "V3" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)))) | |
| type Index (V3 a) | |
| type IxValue (V3 a) | |
| data Vector (V3 a) | |
A 4-dimensional vector.
Constructors
| V4 !a !a !a !a |