Struct traitgraph_algo::dijkstra::performance_counters::DijkstraPerformanceCounter

source · [−]

pub struct DijkstraPerformanceCounter {
    pub iterations: u64,
    pub unnecessary_heap_elements: u64,
}

Expand description

A simple performance counter for Dijkstra’s algorithm, keeping all supported counts.

Fields

iterations: u64

The number of iterations of the main loop of Dijkstra’s algorithm.

unnecessary_heap_elements: u64

The number of unnecessary heap elements.

Trait Implementations

source

impl Add<DijkstraPerformanceCounter> for DijkstraPerformanceCounter

type Output = DijkstraPerformanceCounter

The resulting type after applying the + operator.

source

fn add(self, rhs: Self) -> Self::Output

Performs the + operation. Read more

source

impl AddAssign<DijkstraPerformanceCounter> for DijkstraPerformanceCounter

source

fn add_assign(&mut self, rhs: Self)

Performs the += operation. Read more

source

impl Clone for DijkstraPerformanceCounter

source

fn clone(&self) -> DijkstraPerformanceCounter

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl Debug for DijkstraPerformanceCounter

source

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

Formats the value using the given formatter. Read more

source

impl Default for DijkstraPerformanceCounter

source

fn default() -> DijkstraPerformanceCounter

Returns the “default value” for a type. Read more

source

impl DijkstraPerformanceData for DijkstraPerformanceCounter

source

fn add_iteration(&mut self)

Increment the number of iterations of the main loop of Dijkstra’s algorithm.

source

fn add_unnecessary_heap_element(&mut self)

Increment the number of heap elements that already have a lower weight than what was stored in the heap. These are wasted cycles because our heap does not support the decrease_key operation. Read more

source

fn iterations(&self) -> Option<u64>

Get the number of iterations of the main loop of Dijkstra’s algorithm.

source

fn unnecessary_heap_elements(&self) -> Option<u64>

Get the number of unnecessary heap elements that were inserted during Dijkstra’s algorithm.

source

impl PartialEq<DijkstraPerformanceCounter> for DijkstraPerformanceCounter

source

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

This method tests for self and other values to be equal, and is used by ==. Read more

source

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

This method tests for !=.

source

impl Eq for DijkstraPerformanceCounter

source

impl StructuralEq for DijkstraPerformanceCounter

source

impl StructuralPartialEq for DijkstraPerformanceCounter

Auto Trait Implementations

impl RefUnwindSafe for DijkstraPerformanceCounter

impl Send for DijkstraPerformanceCounter

impl Sync for DijkstraPerformanceCounter

impl Unpin for DijkstraPerformanceCounter

impl UnwindSafe for DijkstraPerformanceCounter

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct traitgraph_algo::dijkstra::performance_counters::DijkstraPerformanceCounter

Fields

Trait Implementations

impl Add<DijkstraPerformanceCounter> for DijkstraPerformanceCounter

type Output = DijkstraPerformanceCounter

fn add(self, rhs: Self) -> Self::Output

impl AddAssign<DijkstraPerformanceCounter> for DijkstraPerformanceCounter

fn add_assign(&mut self, rhs: Self)

impl Clone for DijkstraPerformanceCounter

fn clone(&self) -> DijkstraPerformanceCounter

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

impl Debug for DijkstraPerformanceCounter

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

impl Default for DijkstraPerformanceCounter

fn default() -> DijkstraPerformanceCounter

impl DijkstraPerformanceData for DijkstraPerformanceCounter

fn add_iteration(&mut self)

fn add_unnecessary_heap_element(&mut self)

fn iterations(&self) -> Option<u64>

fn unnecessary_heap_elements(&self) -> Option<u64>

impl PartialEq<DijkstraPerformanceCounter> for DijkstraPerformanceCounter

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

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

impl Eq for DijkstraPerformanceCounter

impl StructuralEq for DijkstraPerformanceCounter

impl StructuralPartialEq for DijkstraPerformanceCounter

Auto Trait Implementations

impl RefUnwindSafe for DijkstraPerformanceCounter

impl Send for DijkstraPerformanceCounter

impl Sync for DijkstraPerformanceCounter

impl Unpin for DijkstraPerformanceCounter

impl UnwindSafe for DijkstraPerformanceCounter

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<Q, K> Equivalent<K> for Q where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where V: MultiLane<T>,

fn vzip(self) -> V

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,