the vertices in the queue are ordered by the sum of their metric from a start location and the lower bound of a path till target point (A* heuristic) Generated from class MR.MetricToAStarPenalty. This is the const half of the class. More...
Classes | |
| struct | _Underlying |
Public Member Functions | |
| virtual void | Dispose () |
| unsafe | Const_MetricToAStarPenalty () |
| Constructs an empty (default-constructed) instance. | |
| unsafe | Const_MetricToAStarPenalty (MR.Const_VertCoords? points, MR.Vector3f target) |
| Constructs MR.MetricToAStarPenalty elementwise. | |
| unsafe | Const_MetricToAStarPenalty (MR.Const_MetricToAStarPenalty _other) |
| Generated from constructor MR.MetricToAStarPenalty.MetricToAStarPenalty. | |
| Const_MetricToAStarPenalty (MetricToAStarPenalty _other) | |
| Generated from constructor MR.MetricToAStarPenalty.MetricToAStarPenalty. | |
| unsafe float | call (float metric, MR.VertId v) |
| Generated from method MR::MetricToAStarPenalty::operator(). | |
Protected Member Functions | |
| virtual unsafe void | Dispose (bool disposing) |
Protected Attributes | |
| unsafe MR.Const_VertCoords._Underlying ** | __ptr_storage_points |
| unsafe MR.Vector3f * | __ref_storage_target |
Properties | |
| unsafe MR.? Const_VertCoords | points [get] |
| unsafe ref readonly MR.Vector3f | target [get] |
the vertices in the queue are ordered by the sum of their metric from a start location and the lower bound of a path till target point (A* heuristic) Generated from class MR.MetricToAStarPenalty. This is the const half of the class.
|
inline |
Constructs an empty (default-constructed) instance.
|
inline |
Constructs MR.MetricToAStarPenalty elementwise.
|
inline |
Generated from constructor MR.MetricToAStarPenalty.MetricToAStarPenalty.
|
inline |
Generated from constructor MR.MetricToAStarPenalty.MetricToAStarPenalty.
|
inline |
Generated from method MR::MetricToAStarPenalty::operator().
|
inlinevirtual |
|
inlineprotectedvirtual |
|
protected |
|
protected |
|
get |
|
get |