Copyright	(c) Justus Sagemüller 2016
License	GPL v3
Maintainer	(@) sagemueller $ geo.uni-koeln.de
Stability	experimental
Portability	portable
Safe Haskell	None
Language	Haskell2010

Data.VectorSpace.Free.Sequence

Description

Synopsis

Documentation

type Sequence = GSequence Vector Source #

type BoxSequence = GSequence Vector Source #

data GSequence array n Source #

The space of possibly-infinite sequences, isomorphic to the space of all lists but implemented more efficiently (with exponentially-growing chunks of unboxed data, so the overhead is amortised). In other words, this is a type of spine-lazy but element-strict arrays.

This space is dual to FinSuppSeq, which is completely strict.

Constructors

Sequence
Fields sequenceHeads :: !(array n) Length must be at most `minimumChunkSize` in the outer constructor and double in each deeper layer. (Specification subject to future change!) If the length at depth 𝑑 is less than 2^𝑑, the remaining entries are treated as zeroes. sequenceRemain :: GSequence array n
SoloChunk
Fields chunkOffset :: !Int soloChunk :: !(array n) Length plus offset must be at most `minimumChunkSize` if this is the outer constructor and can double in each deeper layer.

Instances

(Unbox n, Num n) => IsList (Sequence n) Source #
Associated Types type Item (Sequence n) :: * # Methods fromList :: [Item (Sequence n)] -> Sequence n # fromListN :: Int -> [Item (Sequence n)] -> Sequence n # toList :: Sequence n -> [Item (Sequence n)] #
Functor (GSequence Vector) Source #
Methods fmap :: (a -> b) -> GSequence Vector a -> GSequence Vector b # (<$) :: a -> GSequence Vector b -> GSequence Vector a #
(Unbox n, Show n, Num n) => Show (Sequence n) Source #
Methods showsPrec :: Int -> Sequence n -> ShowS # show :: Sequence n -> String # showList :: [Sequence n] -> ShowS #
(Num n, Unbox n) => AffineSpace (Sequence n) Source #
Associated Types type Diff (Sequence n) :: * # Methods (.-.) :: Sequence n -> Sequence n -> Diff (Sequence n) # (.+^) :: Sequence n -> Diff (Sequence n) -> Sequence n #
(Num n, Unbox n) => HasBasis (Sequence n) Source #
Associated Types type Basis (Sequence n) :: * # Methods basisValue :: Basis (Sequence n) -> Sequence n # decompose :: Sequence n -> [(Basis (Sequence n), Scalar (Sequence n))] # decompose' :: Sequence n -> Basis (Sequence n) -> Scalar (Sequence n) #
(Num n, Unbox n) => VectorSpace (Sequence n) Source #
Associated Types type Scalar (Sequence n) :: * # Methods (*^) :: Scalar (Sequence n) -> Sequence n -> Sequence n #
(Num n, Unbox n) => AdditiveGroup (Sequence n) Source #
Methods zeroV :: Sequence n # (^+^) :: Sequence n -> Sequence n -> Sequence n # negateV :: Sequence n -> Sequence n # (^-^) :: Sequence n -> Sequence n -> Sequence n #
type Item (Sequence n) Source #
type Item (Sequence n) = n
type Diff (Sequence n) Source #
type Diff (Sequence n) = Sequence n
type Basis (Sequence n) Source #
type Basis (Sequence n) = Int
type Scalar (Sequence n) Source #
type Scalar (Sequence n) = n

minimumChunkSize :: Int Source #