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...
|
|
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.
|
| |
|
unsafe float | call (float metric, MR.VertId v) |
| | Generated from method MR.MetricToAStarPenalty.operator().
|
| |
|
|
virtual unsafe void | Dispose (bool disposing) |
| |
|
|
unsafe MR.? Const_VertCoords | points [get] |
| |
|
unsafe ref readonly MR.Vector3f | target [get] |
| |
|
virtual bool | _IsOwning [get] |
| | Returns true if this is an owning instance, and when disposed, will destroy the underlying C++ instance. If false, we assume that the underlying C++ instance will live long enough.
|
| |
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.
The documentation for this class was generated from the following file: