expr.h File Reference
Namespaces
Classes
Defines
- #define ITER(a) a.begin()
- #define BINOP_AA(operator, op)
- Define the global binary functions/operators for ltl::MArray expressions, version for 2 MArray operands, overloaded versions below.
- #define BINOP_EA(operator, op)
- Expression MArray.
- #define BINOP_AE(operator, op)
- MArray - Expression.
- #define BINOP_EE(operator, op)
- Expression - Expression.
- #define BINOP_AL(operator, op, lit_type)
- MArray - Literal.
- #define BINOP_EL(operator, op, lit_type)
- Expression - Literal.
- #define BINOP_LA(operator, op, lit_type)
- Literal - MArray.
- #define BINOP_LE(operator, op, lit_type)
- Literal - Expression.
- #define UNOP_A(operator, op)
- Define the global unary operators, overloaded versions for marray operand.
- #define UNOP_E(operator, op)
- Define the global unary operators, overloaded versions for marray operand.
- #define DECLARE_BINOP(operation, opname)
- Make a binary (built-in) operator available to expression templates.
- #define DECLARE_BINOP_RET(operation, ret_type, opname)
- Make a binary (built-in) operator available to expression templates.
- #define DECLARE_UNOP(operation, opname)
- Make a unary (built-in) operator available to expression templates.
- #define DECLARE_BINARY_FUNC_(function, ret_type)
- Make any binary function available to expression templates.
- #define DECLARE_UNARY_FUNC_(function, ret_type)
- Make any unary function available to expression templates.
- #define DECLARE_BINARY_FUNC(function, ret_type)
- Make any user-defined binary function available to expression templates.
- #define DECLARE_UNARY_FUNC(function, ret_type)
- Make any user-defined unary function available to expression templates.
Functions
- template<class A, class B> const Shape< A::dims > * ltl::_expr_getshape (const A &a, const B &b)
- Determine the
shape
of an expression by returning the ltl::Shape objects on one of the ltl::MArray operatnds.
- template<class A, class T, int N> const Shape< N > * ltl::_expr_getshape (const ExprNode< A, N > &a, const ExprLiteralNode< T > &l)
- template<class A, class T, int N> const Shape< N > * ltl::_expr_getshape (const MArrayIterConst< A, N > &a, const ExprLiteralNode< T > &l)
- template<class T, class A, int N> const Shape< N > * ltl::_expr_getshape (const ExprLiteralNode< T > &l, const ExprNode< A, N > &a)
- template<class T, class A, int N> const Shape< N > * ltl::_expr_getshape (const ExprLiteralNode< T > &l, const MArrayIterConst< A, N > &a)
- template<class A, class B> int ltl::_expr_getalign (const A &a, const B &b)
- Determine the alignment (w.r.t. natural vector boundaries) of the operands in an expression.
- template<class A, class T, int N> int ltl::_expr_getalign (const ExprNode< A, N > &a, const ExprLiteralNode< T > &l)
- template<class A, class T, int N> int ltl::_expr_getalign (const MArrayIterConst< A, N > &a, const ExprLiteralNode< T > &l)
- template<class T, class A, int N> int ltl::_expr_getalign (const ExprLiteralNode< T > &l, const ExprNode< A, N > &a)
- template<class T, class A, int N> int ltl::_expr_getalign (const ExprLiteralNode< T > &l, const MArrayIterConst< A, N > &a)
Detailed Description
This file defines expression template parse tree nodes and macors for creating global unary and binary operators/functions.
Define Documentation
#define ITER |
( |
a |
|
) |
a.begin() |
Generated on Wed Mar 11 17:44:35 2009 for LTL by
1.5.3