Struct Reversed 

pub struct Reversed<S>(pub S);

Lift a strategy for (A, B) into the same strategy concept for (B, A).

Mirrors boost::geometry::reverse_dispatch<Geometry1, Geometry2> from core/reverse_dispatch.hpp:33-64. Boost consults the ordering trait from each algorithm’s dispatch specialisation; Rust implements each strategy concept on this single wrapper instead.

Tuple Fields

0: S

Trait Implementations

impl<S: Clone> Clone for Reversed<S>

fn clone(&self) -> Reversed<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Copy> Copy for Reversed<S>

impl<S: Debug> Debug for Reversed<S>

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

Formats the value using the given formatter.

impl<S: Default> Default for Reversed<S>

fn default() -> Reversed<S>

Returns the “default value” for a type.

impl<A, B, S> DistanceStrategy<B, A> for Reversed<S>

where A: Geometry, B: Geometry, S: DistanceStrategy<A, B>,

type Out = <S as DistanceStrategy<A, B>>::Out

The output scalar type. Typically the promoted scalar of A and B. Mirrors services::return_type<Strategy, P1, P2>::type from strategies/distance/services.hpp.

type Comparable = Reversed<<S as DistanceStrategy<A, B>>::Comparable>

The “skip the sqrt” form of this strategy.

fn distance(&self, b: &B, a: &A) -> S::Out

Compute the distance between a and b.

fn comparable(&self) -> Self::Comparable

Return the comparable-form companion of this strategy.

impl<A, B, S> IntersectsStrategy<B, A> for Reversed<S>

where S: IntersectsStrategy<A, B>,

fn intersects(&self, b: &B, a: &A) -> bool

true iff a and b share at least one point.