molframe-spatial 0.6.4

Deterministic spatial indices and neighbour search for molframe
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

//! Struct-of-arrays form of a pair list, ready to hand to column consumers.

use super::NeighborPair;
use crate::CrossPair;

/// A pair list split into index columns and Euclidean distances.
#[derive(Clone, Debug, Default, PartialEq)]
pub struct PairColumns {
    /// Lower atom index of every pair.
    pub first: Vec<u32>,
    /// Higher atom index of every pair.
    pub second: Vec<u32>,
    /// Euclidean separation of every pair, in ångström.
    pub distance: Vec<f32>,
}

impl PairColumns {
    /// Splits `pairs` into columns, taking the square root of each distance.
    #[must_use]
    pub fn from_pairs(pairs: &[NeighborPair]) -> Self {
        let mut columns = Self {
            first: Vec::with_capacity(pairs.len()),
            second: Vec::with_capacity(pairs.len()),
            distance: Vec::with_capacity(pairs.len()),
        };
        for pair in pairs {
            columns.first.push(pair.first);
            columns.second.push(pair.second);
            columns.distance.push(pair.distance_squared.sqrt());
        }
        columns
    }

    /// Splits cross-set `pairs` into columns; indices stay local to each set.
    #[must_use]
    pub fn from_cross(pairs: &[CrossPair]) -> Self {
        let mut columns = Self {
            first: Vec::with_capacity(pairs.len()),
            second: Vec::with_capacity(pairs.len()),
            distance: Vec::with_capacity(pairs.len()),
        };
        for pair in pairs {
            columns.first.push(pair.first);
            columns.second.push(pair.second);
            columns.distance.push(pair.distance_squared.sqrt());
        }
        columns
    }
}