goal-geometry-0.1: Scientific computing on geometric objects

Safe HaskellNone
LanguageHaskell2010

Goal.Geometry.Map

Contents

Description

The Map module provides tools for developing function space Manifolds. A map is a Manifold where the Points of the Manifold represent parametric functions between Manifolds. The defining feature of Maps is that they have a particular Domain and Codomain, which themselves are Manifolds.

Synopsis

Maps

class Manifold m => Map m where Source

Function Charts help track Charts on the Domain and Codomain. The first Chart corresponds to the Domains chart.

Associated Types

type Domain m :: * Source

type Codomain m :: * Source

Methods

domain :: m -> Domain m Source

codomain :: m -> Codomain m Source

Instances

(Manifold m, Manifold n) => Map (Tensor m n) Source 
(Manifold m, Manifold n) => Map (Affine m n) Source 

class Map m => Apply c d m where Source

Minimal complete definition

Nothing

Methods

(>.>) :: (Function c d :#: m) -> (c :#: Domain m) -> d :#: Codomain m infix 8 Source

Map application.

(>$>) :: (Function c d :#: m) -> [c :#: Domain m] -> [d :#: Codomain m] infix 8 Source

Map list application. May sometimes have a more efficient implementation than simply list-mapping (>.>).

Instances

(Manifold m, Manifold n) => Apply c d (Affine m n) Source 
(Manifold m, Manifold n) => Apply c d (Tensor m n) Source 

Map Charts

data Function c d Source

Constructors

Function c d