math Namespace Reference

Classes
class	ECalcError
class	TCalculator
class	TDeriver
class	EMath
class	TExpander
class	TFunction
class	TConstant
class	ELibraryLookup
class	TLibrary
class	TMatchRegistry
class	TMatch
class	TNumMatch
class	TAnyMatch
class	T2Match
class	TPlusMatch
class	TMulMatch
class	TNegMatch
class	TDivMatch
class	TPowMatch
class	TMatcher
class	TNodeIterator
class	TOperandIter
class	TNode
class	TNumberNode
class	TSymbolNode
class	TParamNode
class	TUnaryNodeOp
class	TBinaryNodeOp
class	TPlusNode
class	TNegNode
class	TMulNode
class	TDivNode
class	TPowNode
class	TSqrtNode
class	TSinNode
class	TCosNode
class	TTanNode
class	TLnNode
class	TFuncNode
class	TIfNode
class	TEquNode
class	TUnEquNode
class	TGreaterNode
class	TLessNode
class	TGreaterEquNode
class	TLessEquNode
class	TPrinter
class	EReadError
class	TReader
class	TSimplifier
class	TNodeVisitor
Functions
template<typename T>
bool	operator== (const TNodeIterator< T > &a, const TNodeIterator< T > &b)
template<typename T>
bool	operator!= (const TNodeIterator< T > &a, const TNodeIterator< T > &b)
template<typename T>
bool	operator== (const TOperandIter< T > &a, const TOperandIter< T > &b)
template<typename T>
bool	operator!= (const TOperandIter< T > &a, const TOperandIter< T > &b)
template<typename T>
bool	operator== (const TNode< T > &, const TNode< T > &)
template<typename T>
bool	operator!= (const TNode< T > &, const TNode< T > &)
bool	isPrime (unsigned ANumber)
unsigned	primeCount (unsigned long long ANumber, unsigned long long APrime)
unsigned	factorize (unsigned long long ANumber, std::vector< std::pair< unsigned long long, unsigned long long > > &AResult)
std::string	factorize (unsigned long long ANumber)
template<class T>
T	calculate (const std::string &AExpression)
template<class T>
T	calculate (const std::string &AExpression, const TLibrary< T > &)
template<class T>
TNode< T > *	derive (const TNode< T > *AExpression, unsigned ACount=1)
template<class T>
TNode< T > *	simplify (const TNode< T > *AExpression)
template<class T>
TNode< T > *	expand (const TNode< T > *AExpression)
template<class T>
TNode< T > *	copyOf (const TNode< T > *AExpression)
template<class T>
TNode< T > *	createTree (const std::string &AExprStr)
template<class T>
TNode< T > *	umkehrfunktion (const TNode< T > *ATree)
template<class T>
TNode< T > *	integral (const TNode< T > *ATree)

---

Function Documentation

template<class T> T math::calculate (  const std::string &  AExpression, const TLibrary< T > &  )

Simply returns calculates expression (AExpression).

template<class T> T math::calculate (  const std::string &  AExpression  )

Simply returns calculates expression (AExpression) without usage of any library.

template<class T> TNode<T>* math::copyOf (  const TNode< T > *  AExpression  )

clones given expression by calling its clone routine

template<class T> TNode<T>* math::createTree (  const std::string &  AExprStr  )

Creates an expression tree equivalent to given input.

template<class T> TNode<T>* math::derive (  const TNode< T > *  AExpression, unsigned  ACount = 1 )

This method derivates given expression, AExpression, ACount times. and returns its result.

template<class T> TNode<T>* math::expand (  const TNode< T > *  AExpression  )

expands an expression. example: 3x^4-2x^2+1 = x*x*x*x + x*x*x*x + x*x*x*x - x*x - x*x + 1

std::string math::factorize (  unsigned long long  ANumber  )

Factorizes the given number (ANumber) and returns its result as a well formatted string.

unsigned math::factorize (  unsigned long long  ANumber, std::vector< std::pair< unsigned long long, unsigned long long > > &  AResult )

calculates the prim factors for given number (ANumber). as result it is returns the number of prim factors in the given numbers and stored in the AResult vector. The result structure is designed as follows: first value of a pair is the prim factor. second value of a pair is the number of occurence.

template<class T> TNode<T>* math::integral (  const TNode< T > *  ATree  )

Creates the integral of given input tree.

bool math::isPrime (  unsigned  ANumber  )

isPrime returns true if ANumber is a prime number, otherwise false

unsigned math::primeCount (  unsigned long long  ANumber, unsigned long long  APrime )

primeCount returns the number of primes (APrime) in ANumber. If APrime isn't any prime number then it's returns 0 otherwise the count.

template<class T> TNode<T>* math::simplify (  const TNode< T > *  AExpression  )

simplifies given expression example: x*x + 2*pi + x*pi = x^2 + pi * (x + 2)

template<class T> TNode<T>* math::umkehrfunktion (  const TNode< T > *  ATree  )

Creates the "umkehrfunktion" of given input tree.

---