| Copyright | (C) 2012-2015 Edward Kmett |
|---|---|
| License | BSD-style (see the file LICENSE) |
| Maintainer | Edward Kmett <ekmett@gmail.com> |
| Stability | experimental |
| Portability | non-portable |
| Safe Haskell | Trustworthy |
| Language | Haskell2010 |
Linear.V2
Description
2-D Vectors
Documentation
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 Source # | |
| MonadFix V2 Source # | |
| MonadZip V2 Source # | |
| Foldable V2 Source # | |
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 Source # | |
| Ord1 V2 Source # | |
| Read1 V2 Source # | |
Defined in Linear.V2 | |
| Show1 V2 Source # | |
| Traversable V2 Source # | |
| Applicative V2 Source # | |
| Functor V2 Source # | |
| Monad V2 Source # | |
| Serial1 V2 Source # | |
| Distributive V2 Source # | |
| Hashable1 V2 Source # | |
| Affine V2 Source # | |
| Metric V2 Source # | |
| Trace V2 Source # | |
| Finite V2 Source # | |
| R1 V2 Source # | |
| R2 V2 Source # | |
| Additive V2 Source # | |
Defined in Linear.V2 | |
| Apply V2 Source # | |
| Bind V2 Source # | |
| Foldable1 V2 Source # | |
| Traversable1 V2 Source # | |
| Num r => Coalgebra r (E V2) Source # | |
| Lift a => Lift (V2 a :: Type) Source # | |
| Unbox a => Vector Vector (V2 a) Source # | |
Defined in Linear.V2 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V2 a) -> m (Vector (V2 a)) Source # basicUnsafeThaw :: PrimMonad m => Vector (V2 a) -> m (Mutable Vector (PrimState m) (V2 a)) Source # basicLength :: Vector (V2 a) -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector (V2 a) -> Vector (V2 a) Source # basicUnsafeIndexM :: Monad m => Vector (V2 a) -> Int -> m (V2 a) Source # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V2 a) -> Vector (V2 a) -> m () Source # | |
| Unbox a => MVector MVector (V2 a) Source # | |
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 :: PrimMonad m => Int -> m (MVector (PrimState m) (V2 a)) Source # basicInitialize :: PrimMonad m => MVector (PrimState m) (V2 a) -> m () Source # basicUnsafeReplicate :: PrimMonad m => Int -> V2 a -> m (MVector (PrimState m) (V2 a)) Source # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> m (V2 a) Source # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> V2 a -> m () Source # basicClear :: PrimMonad m => MVector (PrimState m) (V2 a) -> m () Source # basicSet :: PrimMonad m => MVector (PrimState m) (V2 a) -> V2 a -> m () Source # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V2 a) -> MVector (PrimState m) (V2 a) -> m () Source # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V2 a) -> MVector (PrimState m) (V2 a) -> m () Source # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> m (MVector (PrimState m) (V2 a)) Source # | |
| Data a => Data (V2 a) Source # | |
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) Source # | |
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) Source # | |
| Semigroup a => Semigroup (V2 a) Source # | |
| Bounded a => Bounded (V2 a) Source # | |
| Floating a => Floating (V2 a) Source # | |
| Generic (V2 a) Source # | |
| Ix a => Ix (V2 a) Source # | |
Defined in Linear.V2 | |
| Num a => Num (V2 a) Source # | |
| Read a => Read (V2 a) Source # | |
| Fractional a => Fractional (V2 a) Source # | |
| Show a => Show (V2 a) Source # | |
| Binary a => Binary (V2 a) Source # | |
| Serial a => Serial (V2 a) Source # | |
| Serialize a => Serialize (V2 a) Source # | |
| NFData a => NFData (V2 a) Source # | |
| Eq a => Eq (V2 a) Source # | |
| Ord a => Ord (V2 a) Source # | |
| Hashable a => Hashable (V2 a) Source # | |
| Ixed (V2 a) Source # | |
| Epsilon a => Epsilon (V2 a) Source # | |
| Random a => Random (V2 a) Source # | |
| Unbox a => Unbox (V2 a) Source # | |
Defined in Linear.V2 | |
| Generic1 V2 Source # | |
| FoldableWithIndex (E V2) V2 Source # | |
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 Source # | |
| TraversableWithIndex (E V2) V2 Source # | |
| Each (V2 a) (V2 b) a b Source # | |
| Field1 (V2 a) (V2 a) a a Source # | |
| Field2 (V2 a) (V2 a) a a Source # | |
| type Rep V2 Source # | |
| type Diff V2 Source # | |
Defined in Linear.Affine | |
| type Size V2 Source # | |
| data MVector s (V2 a) Source # | |
| type Rep (V2 a) Source # | |
Defined in Linear.V2 type Rep (V2 a) = D1 ('MetaData "V2" "Linear.V2" "linear-1.21.10-BWYLNa1VYXoLpBTdl1DQBL" '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) Source # | |
| type IxValue (V2 a) Source # | |
| data Vector (V2 a) Source # | |
| type Rep1 V2 Source # | |
Defined in Linear.V2 type Rep1 V2 = D1 ('MetaData "V2" "Linear.V2" "linear-1.21.10-BWYLNa1VYXoLpBTdl1DQBL" 'False) (C1 ('MetaCons "V2" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1)) | |
A space that has at least 1 basis vector _x.
class R1 t => R2 t where Source #
Minimal complete definition
Methods
>>>V2 1 2 ^._y2
>>>V2 1 2 & _y .~ 3V2 1 3