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...
Public Member Functions | |
| unsafe | EdgePathsBuilderT_MRMetricToAStarPenalty (MR._ByValue_EdgePathsBuilderT_MRMetricToAStarPenalty _other) |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| EdgePathsBuilderT_MRMetricToAStarPenalty (Const_EdgePathsBuilderT_MRMetricToAStarPenalty _other) | |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| EdgePathsBuilderT_MRMetricToAStarPenalty (EdgePathsBuilderT_MRMetricToAStarPenalty _other) | |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| unsafe | EdgePathsBuilderT_MRMetricToAStarPenalty (MR.Const_MeshTopology topology, MR.Std.Const_Function_Float_From_MREdgeId metric) |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| unsafe | EdgePathsBuilderT_MRMetricToAStarPenalty (MR.Const_MeshTopology topology) |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| unsafe void | reset (MR.Std.Const_Function_Float_From_MREdgeId metric) |
| clears everything without freeing memory, and sets new metric Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>reset. | |
| unsafe bool | addStart (MR.VertId startVert, float startMetric) |
| 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. | |
| unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert | reachNext () |
| 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. | |
| unsafe bool | addOrgRingSteps (MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert rv) |
| 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. | |
| unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert | growOneEdge () |
| the same as reachNext() + addOrgRingSteps() Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>growOneEdge. | |
| Public Member Functions inherited from MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty | |
| virtual void | Dispose () |
| unsafe | Const_EdgePathsBuilderT_MRMetricToAStarPenalty (MR._ByValue_EdgePathsBuilderT_MRMetricToAStarPenalty _other) |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| Const_EdgePathsBuilderT_MRMetricToAStarPenalty (Const_EdgePathsBuilderT_MRMetricToAStarPenalty _other) | |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| Const_EdgePathsBuilderT_MRMetricToAStarPenalty (EdgePathsBuilderT_MRMetricToAStarPenalty _other) | |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| unsafe | Const_EdgePathsBuilderT_MRMetricToAStarPenalty (MR.Const_MeshTopology topology, MR.Std.Const_Function_Float_From_MREdgeId metric) |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| unsafe | Const_EdgePathsBuilderT_MRMetricToAStarPenalty (MR.Const_MeshTopology topology) |
| Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT. | |
| unsafe bool | done () |
| returns true if further edge forest growth is impossible Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>done. | |
| unsafe float | doneDistance () |
| returns path length till the next candidate vertex or maximum float value if all vertices have been reached Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>doneDistance. | |
| unsafe MR.Phmap.Const_FlatHashMap_MRVertId_MRVertPathInfo | vertPathInfoMap () |
| gives read access to the map from vertex to path to it Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>vertPathInfoMap. | |
| unsafe MR.? Const_VertPathInfo | getVertInfo (MR.VertId v) |
| returns one element from the map (or nullptr if the element is missing) Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>getVertInfo. | |
| unsafe MR.Std.Vector_MREdgeId | getPathBack (MR.VertId backpathStart) |
| returns the path in the forest from given vertex to one of start vertices Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>getPathBack. | |
| unsafe MR.VertId | trackPathBack (MR.VertId v, MR.Std.Vector_MREdgeId? res=null) |
| tracks back path in the forest from the given vertex to one of start vertices, which is returned; optionally appends tracked path (res) Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>trackPathBack. | |
Additional Inherited Members | |
| Protected Member Functions inherited from MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty | |
| virtual unsafe void | Dispose (bool disposing) |
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.
|
inline |
Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT.
|
inline |
Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT.
|
inline |
Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT.
|
inline |
Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT.
|
inline |
Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::EdgePathsBuilderT.
|
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.
|
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.
|
inline |
the same as reachNext() + addOrgRingSteps() Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>growOneEdge.
|
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.
|
inline |
clears everything without freeing memory, and sets new metric Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>reset.