Struct AllPairs 

pub struct AllPairs<K>
where
    K: Eq + Hash,
{ /* private fields */ }

Check all pairs.

Prefer VecCell or HashCell when possible. In typical benchmarks, AllPairs outperforms VecCell only when the system size is less than 32 sites.

Trait Implementations

impl<K> Clone for AllPairs<K>

where K: Eq + Hash + Clone,

fn clone(&self) -> AllPairs<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K> Debug for AllPairs<K>

where K: Eq + Hash + Debug,

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

Formats the value using the given formatter.

impl<K> Default for AllPairs<K>

where K: Copy + Eq + Hash,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K> Deserialize<'de> for AllPairs<K>

where K: Eq + Hash + Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K> Display for AllPairs<K>

where K: Eq + Hash,

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

Formats the value using the given formatter.

impl<K> PartialEq for AllPairs<K>

where K: Eq + Hash + PartialEq,

fn eq(&self, other: &AllPairs<K>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<P, K> PointUpdate<P, K> for AllPairs<K>

where K: Copy + Eq + Hash,

fn insert(&mut self, key: K, _position: P)

Insert or update a point identified by a key.

fn remove(&mut self, key: &K)

Remove the point with the given key.

fn len(&self) -> usize

Get the number of points in the spatial data structure.

fn is_empty(&self) -> bool

Test if the spatial data structure is empty.

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

Test if the spatial data structure contains a key.

fn clear(&mut self)

Remove all points.

impl<P, K> PointsNearBall<P, K> for AllPairs<K>

where K: Copy + Eq + Hash,

fn points_near_ball( &self, _position: &P, _radius: f64, ) -> impl Iterator<Item = K>

Find all the points that might be in the given ball.

fn is_all_pairs() -> bool

Is this spatial data structures AllPairs?

impl<K> Serialize for AllPairs<K>

where K: Eq + Hash + Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<K> WithSearchRadius for AllPairs<K>

where K: Copy + Eq + Hash,

fn with_search_radius(_radius: PositiveReal) -> Self

Construct a spatial data structure that can search at least as far as the given radius.

impl<K> StructuralPartialEq for AllPairs<K>

where K: Eq + Hash,