Struct rstar::primitives::CachedEnvelope

pub struct CachedEnvelope<T: RTreeObject> { /* private fields */ }

An RTreeObject with an inner geometry whose envelope is cached to improve efficiency.

For complex geometry like polygons, computing the envelope can become a bottleneck during tree construction and querying. Hence this combinator computes it once during creation, stores it and then returns a copy.

Note: the container itself implements RTreeObject and inner geometry T can be accessed via an implementation of Deref<Target=T>.

Implementations

impl<T: RTreeObject> CachedEnvelope<T>

pub fn new(inner: T) -> Self

Create a new CachedEnvelope struct using the provided geometry.

Trait Implementations

impl<T: Clone + RTreeObject> Clone for CachedEnvelope<T>

where T::Envelope: Clone,

fn clone(&self) -> CachedEnvelope<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + RTreeObject> Debug for CachedEnvelope<T>

where T::Envelope: Debug,

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

Formats the value using the given formatter.

impl<T: Default + RTreeObject> Default for CachedEnvelope<T>

where T::Envelope: Default,

fn default() -> CachedEnvelope<T>

Returns the “default value” for a type.

impl<T: RTreeObject> Deref for CachedEnvelope<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Hash + RTreeObject> Hash for CachedEnvelope<T>

where T::Envelope: Hash,

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<T: Ord + RTreeObject> Ord for CachedEnvelope<T>

where T::Envelope: Ord,

fn cmp(&self, other: &CachedEnvelope<T>) -> 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 + PartialOrd,

Restrict a value to a certain interval.

impl<T: PartialEq + RTreeObject> PartialEq for CachedEnvelope<T>

where T::Envelope: PartialEq,

fn eq(&self, other: &CachedEnvelope<T>) -> bool

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialOrd + RTreeObject> PartialOrd for CachedEnvelope<T>

where T::Envelope: PartialOrd,

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

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<T: PointDistance> PointDistance for CachedEnvelope<T>

fn distance_2( &self, point: &<Self::Envelope as Envelope>::Point ) -> <<Self::Envelope as Envelope>::Point as Point>::Scalar

Returns the squared distance between an object and a point.

fn contains_point(&self, p: &<Self::Envelope as Envelope>::Point) -> bool

Returns true if a point is contained within this object.

fn distance_2_if_less_or_equal( &self, point: &<Self::Envelope as Envelope>::Point, max_distance_2: <<Self::Envelope as Envelope>::Point as Point>::Scalar ) -> Option<<<Self::Envelope as Envelope>::Point as Point>::Scalar>

Returns the squared distance to this object, or None if the distance is larger than a given maximum value.

impl<T: RTreeObject> RTreeObject for CachedEnvelope<T>

where T::Envelope: Clone,

type Envelope = <T as RTreeObject>::Envelope

The object’s envelope type. Usually, AABB will be the right choice. This type also defines the object’s dimensionality.

fn envelope(&self) -> Self::Envelope

Returns the object’s envelope.

impl<T: Copy + RTreeObject> Copy for CachedEnvelope<T>

where T::Envelope: Copy,

impl<T: Eq + RTreeObject> Eq for CachedEnvelope<T>

where T::Envelope: Eq,

impl<T: RTreeObject> StructuralPartialEq for CachedEnvelope<T>