MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert Class Reference

information about just reached vertex (with final metric value) Generated from class MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert. This is the non-const half of the class. More...

Inheritance diagram for MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert:

Public Member Functions
unsafe	ReachedVert ()
	Constructs an empty (default-constructed) instance.
unsafe	ReachedVert (MR.VertId v, MR.EdgeId backward, float penalty, float metric)
	Constructs MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert elementwise.
unsafe	ReachedVert (MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert _other)
	Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert.ReachedVert.
	ReachedVert (ReachedVert _other)
	Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert.ReachedVert.
unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert	assign (MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert _other)
	Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::ReachedVert::operator=.
Public Member Functions inherited from MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert
virtual void	Dispose ()
unsafe	Const_ReachedVert ()
	Constructs an empty (default-constructed) instance.
unsafe	Const_ReachedVert (MR.VertId v, MR.EdgeId backward, float penalty, float metric)
	Constructs MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert elementwise.
unsafe	Const_ReachedVert (MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert _other)
	Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert.ReachedVert.
	Const_ReachedVert (ReachedVert _other)
	Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert.ReachedVert.

Properties
new unsafe ref MR.VertId	v [get]
new unsafe ref MR.EdgeId	backward [get]
	edge from this vertex to its predecessor in the forest (if this vertex is not start)
new unsafe ref float	penalty [get]
	not reached vertices are ordered in priority queue by their penalty (with the smallest value on top); penalty is equal to metric in ordinary Dijkstra, or equal to (metric + target distance lower bound) in A*
new unsafe ref float	metric [get]
	summed metric to reach this vertex
Properties inherited from MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert
unsafe ref readonly MR.VertId	v [get]
unsafe ref readonly MR.EdgeId	backward [get]
	edge from this vertex to its predecessor in the forest (if this vertex is not start)
unsafe float	penalty [get]
	not reached vertices are ordered in priority queue by their penalty (with the smallest value on top); penalty is equal to metric in ordinary Dijkstra, or equal to (metric + target distance lower bound) in A*
unsafe float	metric [get]
	summed metric to reach this vertex

Additional Inherited Members
Protected Member Functions inherited from MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert
virtual unsafe void	Dispose (bool disposing)
Protected Attributes inherited from MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert
unsafe MR.VertId *	__ref_storage_v
unsafe MR.EdgeId *	__ref_storage_backward
unsafe float *	__ref_storage_penalty
unsafe float *	__ref_storage_metric

Detailed Description

information about just reached vertex (with final metric value) Generated from class MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert. This is the non-const half of the class.

Constructor & Destructor Documentation

ReachedVert() [1/4]

unsafe MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.ReachedVert ( )

inline

Constructs an empty (default-constructed) instance.

ReachedVert() [2/4]

unsafe MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.ReachedVert ( MR.VertId v, MR.EdgeId backward, float penalty, float metric )

inline

Constructs MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert elementwise.

ReachedVert() [3/4]

unsafe MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.ReachedVert ( MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert _other )

inline

Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert.ReachedVert.

ReachedVert() [4/4]

MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.ReachedVert ( ReachedVert _other )

inline

Generated from constructor MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>ReachedVert.ReachedVert.

Member Function Documentation

assign()

unsafe MR.EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.assign ( MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert _other )

inline

Generated from method MR::EdgePathsBuilderT<MR.MetricToAStarPenalty>::ReachedVert::operator=.

Property Documentation

backward

new unsafe ref MR.EdgeId MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.backward

get

edge from this vertex to its predecessor in the forest (if this vertex is not start)

metric

new unsafe ref float MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.metric

get

summed metric to reach this vertex

penalty

new unsafe ref float MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.penalty

get

not reached vertices are ordered in priority queue by their penalty (with the smallest value on top); penalty is equal to metric in ordinary Dijkstra, or equal to (metric + target distance lower bound) in A*

v

new unsafe ref MR.VertId MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.ReachedVert.v

get

---

The documentation for this class was generated from the following file:

• MREdgePathsBuilder.cs