MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert Class Reference

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

Inheritance diagram for MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert:

Classes
struct	_Underlying

Public Member Functions
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.TrivialMetricToPenalty>ReachedVert elementwise.
unsafe	Const_ReachedVert (MR.EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert _other)
	Generated from constructor MR::EdgePathsBuilderT<MR.TrivialMetricToPenalty>ReachedVert.ReachedVert.
	Const_ReachedVert (ReachedVert _other)
	Generated from constructor MR::EdgePathsBuilderT<MR.TrivialMetricToPenalty>ReachedVert.ReachedVert.

Protected Member Functions
virtual unsafe void	Dispose (bool disposing)

Protected Attributes
unsafe MR.VertId *	__ref_storage_v
unsafe MR.EdgeId *	__ref_storage_backward
unsafe float *	__ref_storage_penalty
unsafe float *	__ref_storage_metric

Properties
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

Detailed Description

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

Constructor & Destructor Documentation

Const_ReachedVert() [1/4]

unsafe MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.Const_ReachedVert ( )

inline

Constructs an empty (default-constructed) instance.

Const_ReachedVert() [2/4]

unsafe MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.Const_ReachedVert ( MR.VertId v, MR.EdgeId backward, float penalty, float metric )

inline

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

Const_ReachedVert() [3/4]

unsafe MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.Const_ReachedVert ( MR.EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert _other )

inline

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

Const_ReachedVert() [4/4]

MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.Const_ReachedVert ( ReachedVert _other )

inline

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

Member Function Documentation

Dispose() [1/2]

virtual void MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.Dispose ( )

inlinevirtual

Dispose() [2/2]

virtual unsafe void MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.Dispose ( bool disposing )

inlineprotectedvirtual

Member Data Documentation

__ref_storage_backward

unsafe MR.EdgeId* MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.__ref_storage_backward

protected

__ref_storage_metric

unsafe float* MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.__ref_storage_metric

protected

__ref_storage_penalty

unsafe float* MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.__ref_storage_penalty

protected

__ref_storage_v

unsafe MR.VertId* MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.__ref_storage_v

protected

Property Documentation

backward

unsafe ref readonly MR.EdgeId MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.backward

get

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

metric

unsafe float MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.metric

get

summed metric to reach this vertex

penalty

unsafe float MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_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

unsafe ref readonly MR.VertId MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert.v

get

---

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

• MREdgePathsBuilder.cs