LATS-0.4.1: Linear Algebra on Typed Spaces

Safe HaskellNone
LanguageHaskell2010

LinearAlgebra.TypedSpaces.Classes

Synopsis

Documentation

class Isomorphism a b where Source

Methods

fw :: a -> b Source

bw :: b -> a Source

class CFunctor f => CZippable f where Source

Methods

czipWith :: (CFun f a, CFun f b, CFun f c) => (a -> b -> c) -> f a -> f b -> f c Source

czipWith3 :: (CFun f a, CFun f b, CFun f c, CFun f d) => (a -> b -> c -> d) -> f a -> f b -> f c -> f d Source

czipWith4 :: (CFun f a, CFun f b, CFun f c, CFun f d, CFun f e) => (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e Source

Instances

class CFunctor f => CIndexed f i | f -> i where Source

Methods

(!) :: CFun f a => f a -> i -> a Source

Instances

class IsList l where

The IsList class and its methods are intended to be used in conjunction with the OverloadedLists extension.

Since: 4.7.0.0

Minimal complete definition

fromList, toList

Associated Types

type Item l :: *

The Item type function returns the type of items of the structure l.

Methods

fromList :: [Item l] -> l

The fromList function constructs the structure l from the given list of Item l

fromListN :: Int -> [Item l] -> l

The fromListN function takes the input list's length as a hint. Its behaviour should be equivalent to fromList. The hint can be used to construct the structure l more efficiently compared to fromList. If the given hint does not equal to the input list's length the behaviour of fromListN is not specified.

toList :: l -> [Item l]

The toList function extracts a list of Item l from the structure l. It should satisfy fromList . toList = id.

Instances

IsList Version

Since: 4.8.0.0

IsList IntSet 
IsList [a] 
IsList (IntMap a) 
Ord a => IsList (Set a) 
IsList (Seq a) 
Storable a => IsList (Vector a) 
IsList (NonEmpty a) 
(Eq a, Hashable a) => IsList (HashSet a) 
Ord k => IsList (Map k v) 
(Eq k, Hashable k) => IsList (HashMap k v) 
Storable a => IsList (Vector i a)