Enum GraphPathAlgorithm 

#[repr(i32)]
pub enum GraphPathAlgorithm {
    GraphPathDijkstra = 0,
    GraphPathAstar = 1,
}

Pathfinding algorithm. A* currently shares Dijkstra’s relaxation (no spatial heuristic is available for arbitrary node ids), so it behaves as Dijkstra but is accepted for forward compatibility.

Variants

GraphPathDijkstra = 0

GraphPathAstar = 1

Implementations

impl GraphPathAlgorithm

pub fn is_valid(value: i32) -> bool

Returns true if value is a variant of GraphPathAlgorithm.

pub fn from_i32(value: i32) -> Option<GraphPathAlgorithm>

👎Deprecated:

Use the TryFrom<i32> implementation instead

Converts an i32 to a GraphPathAlgorithm, or None if value is not a valid variant.

impl GraphPathAlgorithm

pub fn as_str_name(&self) -> &'static str

String value of the enum field names used in the ProtoBuf definition.

The values are not transformed in any way and thus are considered stable (if the ProtoBuf definition does not change) and safe for programmatic use.

pub fn from_str_name(value: &str) -> Option<Self>

Creates an enum from field names used in the ProtoBuf definition.

Trait Implementations

impl Clone for GraphPathAlgorithm

fn clone(&self) -> GraphPathAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for GraphPathAlgorithm

impl Debug for GraphPathAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for GraphPathAlgorithm

fn default() -> GraphPathAlgorithm

Returns the “default value” for a type.

impl Eq for GraphPathAlgorithm

impl From<GraphPathAlgorithm> for i32

fn from(value: GraphPathAlgorithm) -> i32

Converts to this type from the input type.

impl Hash for GraphPathAlgorithm

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for GraphPathAlgorithm

fn cmp(&self, other: &GraphPathAlgorithm) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for GraphPathAlgorithm

fn eq(&self, other: &GraphPathAlgorithm) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for GraphPathAlgorithm

fn partial_cmp(&self, other: &GraphPathAlgorithm) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for GraphPathAlgorithm

impl TryFrom<i32> for GraphPathAlgorithm

type Error = UnknownEnumValue

The type returned in the event of a conversion error.

fn try_from(value: i32) -> Result<GraphPathAlgorithm, UnknownEnumValue>

Performs the conversion.