the class is responsible for finding smallest metric edge paths on a mesh Generated from class MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>. Derived classes: Direct: (non-virtual) MR.EdgePathsAStarBuilder This is the non-const half of the class.
More...
the class is responsible for finding smallest metric edge paths on a mesh Generated from class MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>. Derived classes: Direct: (non-virtual) MR.EdgePathsAStarBuilder This is the non-const half of the class.
◆ EdgePathsBuilderT_MRMetricToAStarPenalty() [1/5]
| unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.EdgePathsBuilderT_MRMetricToAStarPenalty |
( |
MR._ByValue_EdgePathsBuilderT_MRMetricToAStarPenalty | _other | ) |
|
|
inline |
◆ EdgePathsBuilderT_MRMetricToAStarPenalty() [2/5]
| MR.EdgePathsBuilderT_MRMetricToAStarPenalty.EdgePathsBuilderT_MRMetricToAStarPenalty |
( |
Const_EdgePathsBuilderT_MRMetricToAStarPenalty | _other | ) |
|
|
inline |
◆ EdgePathsBuilderT_MRMetricToAStarPenalty() [3/5]
◆ EdgePathsBuilderT_MRMetricToAStarPenalty() [4/5]
| unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.EdgePathsBuilderT_MRMetricToAStarPenalty |
( |
MR.Const_MeshTopology | topology, |
|
|
MR.Std.Const_Function_FloatFuncFromMREdgeId | metric ) |
|
inline |
◆ EdgePathsBuilderT_MRMetricToAStarPenalty() [5/5]
| unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.EdgePathsBuilderT_MRMetricToAStarPenalty |
( |
MR.Const_MeshTopology | topology | ) |
|
|
inline |
◆ addOrgRingSteps()
| unsafe bool MR.EdgePathsBuilderT_MRMetricToAStarPenalty.addOrgRingSteps |
( |
MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert | rv | ) |
|
|
inline |
adds steps for all origin ring edges of the reached vertex; returns true if at least one step was added Generated from method MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::addOrgRingSteps.
◆ addStart()
| unsafe bool MR.EdgePathsBuilderT_MRMetricToAStarPenalty.addStart |
( |
MR.VertId | startVert, |
|
|
float | startMetric ) |
|
inline |
compares proposed metric with best value known for startVert; if proposed metric is smaller then adds it in the queue and returns true Generated from method MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::addStart.
◆ growOneEdge()
| unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert MR.EdgePathsBuilderT_MRMetricToAStarPenalty.growOneEdge |
( |
| ) |
|
|
inline |
◆ reachNext()
| unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert MR.EdgePathsBuilderT_MRMetricToAStarPenalty.reachNext |
( |
| ) |
|
|
inline |
include one more vertex in the final forest, returning vertex-info for the newly reached vertex; returns invalid VertId in v-field if no more vertices left Generated from method MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::reachNext.
◆ reset()
| unsafe void MR.EdgePathsBuilderT_MRMetricToAStarPenalty.reset |
( |
MR.Std.Const_Function_FloatFuncFromMREdgeId | metric | ) |
|
|
inline |
clears everything without freeing memory, and sets new metric Generated from method MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::reset.
The documentation for this class was generated from the following file: