pub struct ReplicaList { /* private fields */ }Expand description
Shared candidate list and one filtered frame per bead.
Implementations§
Source§impl ReplicaList
impl ReplicaList
Sourcepub fn build(
xyz: &[[f64; 3]],
beads: usize,
cell: Cell,
cutoff: f64,
skin: f64,
half: bool,
) -> Result<Self, Error>
pub fn build( xyz: &[[f64; 3]], beads: usize, cell: Cell, cutoff: f64, skin: f64, half: bool, ) -> Result<Self, Error>
Build the shared list and filter every bead.
xyz is bead-major, beads * atoms points, atoms = xyz.len() / beads.
Sourcepub fn bead(&self, b: usize) -> Result<&PairColumns, Error>
pub fn bead(&self, b: usize) -> Result<&PairColumns, Error>
Filtered rows of bead b from the last build or update.
Sourcepub fn sparsity(&self) -> Vec<(u32, u32)>
pub fn sparsity(&self) -> Vec<(u32, u32)>
Unique unordered atom pairs in the shared candidate list.
Self-images (i == j) are omitted. This is the spatial sparsity
pattern of a ring-polymer potential: every bead’s cutoff pairs are
a subset, and the spring terms along the ring do not add atom pairs.
Sourcepub fn filter_all(&mut self) -> Result<(), Error>
pub fn filter_all(&mut self) -> Result<(), Error>
Filter every stored bead from the shared candidate list.
One pass loads each candidate once and gathers every bead’s coordinates into the same lanes. A shift that does not fit the packed code falls back to a pass per bead.
Sourcepub fn update_bead(
&mut self,
b: usize,
xyz: &[[f64; 3]],
) -> Result<&PairColumns, Error>
pub fn update_bead( &mut self, b: usize, xyz: &[[f64; 3]], ) -> Result<&PairColumns, Error>
Replace bead b and return its filtered rows.
A move inside the skin only filters that bead. A larger move rebuilds the shared candidates and every bead’s rows.
Auto Trait Implementations§
impl Freeze for ReplicaList
impl RefUnwindSafe for ReplicaList
impl Send for ReplicaList
impl Sync for ReplicaList
impl Unpin for ReplicaList
impl UnsafeUnpin for ReplicaList
impl UnwindSafe for ReplicaList
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more