afl Namespace Reference

Classes

class AnalyticInterpolator

class BasisInterpolator_1

class BasisInterpolator_2

class BasisInterpolator_3

class BasisInterpolator_4

class Boundary

class Boundary_1

class Boundary_2

class Boundary_3

class Boundary_4

class BoundaryFactory

class BoundaryTree_1

class BoundaryTree_2

class BoundaryTree_3

class BoundaryTree_4

class CompositeField

class DelaunayLinear_2

class DelaunayLinear_3

class DelaunayLinear_4

class DerivationFactory

class Derivator

class Derivator_1

class Derivator_2

class Derivator_3

class Derivator_4

class Element

class Field

class Field_1

class Field_2

class Field_3

class Field_4

class FieldBoundary_2

class FieldFactory

class FunctionIterator

class Function

class FieldFn

class Negate

class Argument

class BasisArgument

class BasisArgument_1

class BasisArgument_2

class BasisArgument_3

class BasisArgument_4

class KsiBasisArgument_1

class KsiBasisArgument_2

class KsiBasisArgument_3

class KsiBasisArgument_4

class Constant

class Sum

class Subtract

class Multiply

class Divide

class Power

class OnTopOf

class Sin

class ArcSin

class Cos

class ArcCos

class Tan

class ArcTan

class Cot

class Ln

class Exp

class Sqrt

class Abs

class Min

class Max

class HermiteCubic_1

class IntegrationFactory

class Integrator

class Integrator_1

class Integrator_2

class Integrator_3

class Integrator_4

class InterpolationFactory

class Interpolator

class Interpolator_1

class Interpolator_2

class Interpolator_3

class Interpolator_4

class Iterator

class LagrangeLinear_1

class LagrangeQuadratic_1

class MonteCarloIntegrator_1

class MonteCarloIntegrator_2

class MonteCarloIntegrator_3

class MonteCarloIntegrator_4

class PointT

class Locator

class SimpleBoundary_2

class SimpleBoundary_3

class SimpleBoundary_4

class Simplex

class ValueT

class XercesParser

class XercesXMLNode

class XMLNode

class XMLParser

Typedefs

typedef ddf::data_t data_t

typedef char *** aspectid_t

typedef char **** interp_t

typedef ValueT< data_t > Value

typedef ValueT< Function * > FnValue

typedef PointT< Value > Derivative

typedef PointT< data_t > Point

typedef char troolean

typedef std::map< std::string,
std::string > Parameters

Functions

Function * parseFunction (const std::string &expression)

Function * parseFunction (const std::string &expression, const CompositeField *cntxt)

Function * parseFunction (const std::string &expression, const BasisInterpolator_1 *cntxt)

Function * parseFunction (const std::string &expression, const BasisInterpolator_2 *cntxt)

Function * parseFunction (const std::string &expression, const BasisInterpolator_3 *cntxt)

Function * parseFunction (const std::string &expression, const BasisInterpolator_4 *cntxt)

Iterator operator+ (ptrdiff_t a, const Iterator &i)

template<size_t D>

void triangulate (const ddf::Property *xs, std::vector< Element< D > > &elems, std::vector< std::set< size_t > > &cells)

template<size_t D>

Element< D > findElement (const ddf::Property *xs, const Point &p)

Variables

data_t nan

data_t epsillon

const troolean outside = -1

const troolean boundary = 0

const troolean inside = 1

const bool red = true

const bool black = false

const size_t boundaryParts = 50

const interp_t I_NONE = interp_t(0)

const interp_t I_LINEAR = interp_t(1)

const interp_t I_QUADRATIC = interp_t(2)

const interp_t I_CUBIC = interp_t(3)

const aspectid_t FIELD_NONE = aspectid_t(0)

const aspectid_t FIELD_X = aspectid_t(101)

const aspectid_t FIELD_Y = aspectid_t(102)

const aspectid_t FIELD_Z = aspectid_t(103)

const aspectid_t FIELD_T = aspectid_t(104)

const aspectid_t FIELD_DX = aspectid_t(105)

const aspectid_t FIELD_DY = aspectid_t(106)

const aspectid_t FIELD_DZ = aspectid_t(107)

const aspectid_t FIELD_DT = aspectid_t(108)

data_t nan

data_t epsilon

Detailed Description

class PropertySet

Typedef Documentation

typedef char*** afl::aspectid_t

an aspect or axis, starts with FIELD_ (e.g. FIELD_X)

typedef ddf::data_t afl::data_t

the fundamental numeric primitive

typedef PointT<Value> afl::Derivative

Derivative is the derivative information for a field. It is a Value along each axis depending on the dimension of the field.

typedef ValueT<Function*> afl::FnValue

FnValue is a value of a field represented in analytic functions

typedef char**** afl::interp_t

an interpolation type, starts with I_ (e.g. I_LINEAR)

typedef std::map<std::string,std::string> afl::Parameters

parameters passed on to operator classes at construction time and back at serialisation

typedef PointT<data_t> afl::Point

a Point in 1, 2, 3 or 4 dimension space. A point can't change its dimensions once it is created.

typedef char afl::troolean

troolean is a value that can have one of three values

typedef ValueT<data_t> afl::Value

Value represents the value of a field, which could be a scalra, a 2 or 3 dimensions vector or 2 or 3 dimensions tensor

Function Documentation

template<size_t D>

Element<D> afl::findElement ( const ddf::Property * xs,

const Point & p

)

finds an element in a delaunay trinagulation of 2, 3 or 4 dimensions. Note: It is better to use triangulate which allows you to store the triangulation and then search through it more efficiently (in constant expected time) and without retriangulating
Parameters:

xs the points that define the triangulation

p array of coordinates for each point

Returns:
an element that contains the indices of the verices of the hyperfacet that contains p

Exceptions:

ddf::OutOfBoundsException if p is outside the triangulation

ddf::GeometryException if xs can't be triangulated

Deprecated:

Iterator afl::operator+ ( ptrdiff_t a,

const Iterator & i

)

produce a new iterator that is more advanced than another
Parameters:

a how many positions more advanced will the iterator be

i the iterator the new iterator will be more advanced than

Returns:
a new iterator more advanced by a than i

Function* afl::parseFunction ( const std::string & expression,

const BasisInterpolator_4 * cntxt

)

parses an expression into a function tree, used in 4D basis interpolation
Parameters:

expression the string representation of the expression that will be parsed

cntxt the basis interpolator that is defined by the expression

Returns:
the function tree from the expression

Exceptions:

ddf::ParseException if the expression is not valid

Function* afl::parseFunction ( const std::string & expression,

const BasisInterpolator_3 * cntxt

)

parses an expression into a function tree, used in 3D basis interpolation
Parameters:

expression the string representation of the expression that will be parsed

cntxt the basis interpolator that is defined by the expression

Returns:
the function tree from the expression

Exceptions:

ddf::ParseException if the expression is not valid

Function* afl::parseFunction ( const std::string & expression,

const BasisInterpolator_2 * cntxt

)

parses an expression into a function tree, used in 2D basis interpolation
Parameters:

expression the string representation of the expression that will be parsed

cntxt the basis interpolator that is defined by the expression

Returns:
the function tree from the expression

Exceptions:

ddf::ParseException if the expression is not valid

Function* afl::parseFunction ( const std::string & expression,

const BasisInterpolator_1 * cntxt

)

parses an expression into a function tree, used in 1D basis interpolation
Parameters:

expression the string representation of the expression that will be parsed

cntxt the basis interpolator that is defined by the expression

Returns:
the function tree from the expression

Exceptions:

ddf::ParseException if the expression is not valid

Function* afl::parseFunction ( const std::string & expression,

const CompositeField * cntxt

)

parses an expression into a function tree, used in composite fields
Parameters:

expression the string representation of the expression that will be parsed

cntxt the composite fields this expression defines

Returns:
the function tree from the expression

Exceptions:

ddf::ParseException if the expression is not valid

Function* afl::parseFunction ( const std::string & expression )

parses an expression into a function tree
Parameters:

expression the string representation of the expression that will be parsed

Returns:
the function tree from the expression

Exceptions:

ddf::ParseException if the expression is not valid

template<size_t D>

void afl::triangulate ( const ddf::Property * xs,

std::vector< Element< D > > & elems,

std::vector< std::set< size_t > > & cells

)

populates an element vector with delaunay simplices
Parameters:

xs the points that define the triangulation

elems a container that holds the elements. It will be cleared by this function

cells the D-dimension data structure that holds indecis of elements stored in elems.

Exceptions:

ddf::GeometryException if xs can't be triangulated

Variable Documentation

const bool afl::black = false

labels a segment as a hole

const troolean afl::boundary = 0

signifies that something is on the boundary or boundary segment

const size_t afl::boundaryParts = 50

the number of parts a field boundary is approximated by, and the number of parts each part is divided into if recursice approximation is used.

data_t afl::epsillon

the default allowable error

data_t afl::epsilon

the default allowable error

const aspectid_t afl::FIELD_DT = aspectid_t(108)

DT aspect

const aspectid_t afl::FIELD_DX = aspectid_t(105)

DX aspect

const aspectid_t afl::FIELD_DY = aspectid_t(106)

DY aspect

const aspectid_t afl::FIELD_DZ = aspectid_t(107)

DZ aspect

const aspectid_t afl::FIELD_NONE = aspectid_t(0)

no aspect or aspect not set

const aspectid_t afl::FIELD_T = aspectid_t(104)

T aspect

const aspectid_t afl::FIELD_X = aspectid_t(101)

X aspect

const aspectid_t afl::FIELD_Y = aspectid_t(102)

Y aspect

const aspectid_t afl::FIELD_Z = aspectid_t(103)

Z aspect

const interp_t afl::I_CUBIC = interp_t(3)

cubic interpolation

const interp_t afl::I_LINEAR = interp_t(1)

linear interpolation

const interp_t afl::I_NONE = interp_t(0)

no interpolation

const interp_t afl::I_QUADRATIC = interp_t(2)

quadratic interpolation

const troolean afl::inside = 1

signifies that something is inside the domain or boundary segment

data_t afl::nan

the primitive value of NaV

data_t afl::nan

the primitive representation of NaV

const troolean afl::outside = -1

signifies that something is outside the domain or boundary segment

const bool afl::red = true

labels a segment as an island

Generated on Fri Dec 22 07:17:51 2006 for afl by

1.4.6


Classes
class	AnalyticInterpolator
class	BasisInterpolator_1
class	BasisInterpolator_2
class	BasisInterpolator_3
class	BasisInterpolator_4
class	Boundary
class	Boundary_1
class	Boundary_2
class	Boundary_3
class	Boundary_4
class	BoundaryFactory
class	BoundaryTree_1
class	BoundaryTree_2
class	BoundaryTree_3
class	BoundaryTree_4
class	CompositeField
class	DelaunayLinear_2
class	DelaunayLinear_3
class	DelaunayLinear_4
class	DerivationFactory
class	Derivator
class	Derivator_1
class	Derivator_2
class	Derivator_3
class	Derivator_4
class	Element
class	Field
class	Field_1
class	Field_2
class	Field_3
class	Field_4
class	FieldBoundary_2
class	FieldFactory
class	FunctionIterator
class	Function
class	FieldFn
class	Negate
class	Argument
class	BasisArgument
class	BasisArgument_1
class	BasisArgument_2
class	BasisArgument_3
class	BasisArgument_4
class	KsiBasisArgument_1
class	KsiBasisArgument_2
class	KsiBasisArgument_3
class	KsiBasisArgument_4
class	Constant
class	Sum
class	Subtract
class	Multiply
class	Divide
class	Power
class	OnTopOf
class	Sin
class	ArcSin
class	Cos
class	ArcCos
class	Tan
class	ArcTan
class	Cot
class	Ln
class	Exp
class	Sqrt
class	Abs
class	Min
class	Max
class	HermiteCubic_1
class	IntegrationFactory
class	Integrator
class	Integrator_1
class	Integrator_2
class	Integrator_3
class	Integrator_4
class	InterpolationFactory
class	Interpolator
class	Interpolator_1
class	Interpolator_2
class	Interpolator_3
class	Interpolator_4
class	Iterator
class	LagrangeLinear_1
class	LagrangeQuadratic_1
class	MonteCarloIntegrator_1
class	MonteCarloIntegrator_2
class	MonteCarloIntegrator_3
class	MonteCarloIntegrator_4
class	PointT
class	Locator
class	SimpleBoundary_2
class	SimpleBoundary_3
class	SimpleBoundary_4
class	Simplex
class	ValueT
class	XercesParser
class	XercesXMLNode
class	XMLNode
class	XMLParser
Typedefs
typedef ddf::data_t	data_t
typedef char ***	aspectid_t
typedef char ****	interp_t
typedef ValueT< data_t >	Value
typedef ValueT< Function * >	FnValue
typedef PointT< Value >	Derivative
typedef PointT< data_t >	Point
typedef char	troolean
typedef std::map< std::string, std::string >	Parameters
Functions
Function *	parseFunction (const std::string &expression)
Function *	parseFunction (const std::string &expression, const CompositeField *cntxt)
Function *	parseFunction (const std::string &expression, const BasisInterpolator_1 *cntxt)
Function *	parseFunction (const std::string &expression, const BasisInterpolator_2 *cntxt)
Function *	parseFunction (const std::string &expression, const BasisInterpolator_3 *cntxt)
Function *	parseFunction (const std::string &expression, const BasisInterpolator_4 *cntxt)
Iterator	operator+ (ptrdiff_t a, const Iterator &i)
template<size_t D>
void	triangulate (const ddf::Property *xs, std::vector< Element< D > > &elems, std::vector< std::set< size_t > > &cells)
template<size_t D>
Element< D >	findElement (const ddf::Property *xs, const Point &p)
Variables
data_t	nan
data_t	epsillon
const troolean	outside = -1
const troolean	boundary = 0
const troolean	inside = 1
const bool	red = true
const bool	black = false
const size_t	boundaryParts = 50
const interp_t	I_NONE = interp_t(0)
const interp_t	I_LINEAR = interp_t(1)
const interp_t	I_QUADRATIC = interp_t(2)
const interp_t	I_CUBIC = interp_t(3)
const aspectid_t	FIELD_NONE = aspectid_t(0)
const aspectid_t	FIELD_X = aspectid_t(101)
const aspectid_t	FIELD_Y = aspectid_t(102)
const aspectid_t	FIELD_Z = aspectid_t(103)
const aspectid_t	FIELD_T = aspectid_t(104)
const aspectid_t	FIELD_DX = aspectid_t(105)
const aspectid_t	FIELD_DY = aspectid_t(106)
const aspectid_t	FIELD_DZ = aspectid_t(107)
const aspectid_t	FIELD_DT = aspectid_t(108)
data_t	nan
data_t	epsilon