A common ancestor for the paths we construct that contains the DescribePath function. More...
#include <DynamicallyConstructedPath.h>
Public Member Functions | |
DynamicallyConstructedPath (void) | |
Default Constructor. | |
~DynamicallyConstructedPath (void) | |
Default Destructor. | |
LIE | DescribePath (const dyadic_interval &increment, const int accuracy) const |
Describe the path over a dyadic interval. | |
Protected Types | |
typedef DataTree::iterator | Iterator |
The DataTree Iterator. | |
typedef DataTree::const_iterator | ConstIterator |
Protected Member Functions | |
virtual void | ComputeChildLieIncrements (Increment< my_alg_type > &nvLeft, Increment< my_alg_type > &nvRight, ConstIterator itLeafAbove) const |
virtual void | MakeNeighborRootLieIncrement (LIE &ans, const Iterator &OldRoot) const |
virtual LIE | MakeRootLieIncrement (const dyadic_interval &increment) const |
Returns the Lie element for the dyadic_interval increment. |
A common ancestor for the paths we construct that contains the DescribePath function.
Gives a dynamic construction of DescibePath. We describe the path over an increment based on what we have already computed about the path on other increments and the properties of the path that will be given in their specific files.
virtual void DynamicallyConstructedPath< my_alg_type >::ComputeChildLieIncrements | ( | Increment< my_alg_type > & | nvLeft, | |
Increment< my_alg_type > & | nvRight, | |||
ConstIterator | itLeafAbove | |||
) | const [inline, protected, virtual] |
Given the Lie increment of a dyadic interval, itLeafAbove, and two increments nvLeft and nvRight, calculates the Lie elments of the increments corresponding to the children of itLeafAbove.
Reimplemented in BrownianPath< my_alg_type >, FractBrownianPath< my_alg_type >, and NonLinearSolutionPath< my_alg_type_IN, my_alg_type_OUT >.