Struct SimBox 

pub struct SimBox { /* private fields */ }

Simulation box: triclinic cell with origin and per-axis PBC mask

Implementations

impl SimBox

pub fn new(h: F3x3, origin: F3, pbc: Pbc3) -> Result<Self, BoxError>

Construct from triclinic cell matrix H, origin O, and per-axis PBC flags

pub fn new_cell( h: F3x3, origin: F3, pbc: Pbc3, cell_defined: bool, ) -> Result<Self, BoxError>

Construct a box, explicitly marking whether the cell is geometrically defined. Pass cell_defined = false for a “no-cell” box (undefined / zero-volume): supply the identity matrix so geometry ops degrade to no-ops, and volume / is_cell_defined reflect the undefined cell.

pub fn is_cell_defined(&self) -> bool

Whether the cell is geometrically defined (false ⇒ a no-cell box of undefined / zero volume). Distinct from periodicity (is_free).

pub fn try_new(h: F3x3, origin: F3, pbc: Pbc3) -> Result<Self, BoxError>

pub fn cube(a: F, origin: F3, pbc: Pbc3) -> Result<Self, BoxError>

Factory: cubic box with edge length a and origin O

pub fn ortho(lengths: F3, origin: F3, pbc: Pbc3) -> Result<Self, BoxError>

Factory: ortho box with lengths (ax, ay, az) and origin O

pub fn free(points: FNx3View<'_>, padding: F) -> Result<Self, BoxError>

Create a non-periodic (free-boundary) box enclosing all points.

Computes the axis-aligned bounding box of points and adds padding on each side. The resulting box has pbc = [false, false, false].

padding should be >= the neighbor cutoff distance so that all particles sit well inside the box for correct cell assignment.

Errors

Returns BoxError if padding is non-positive or the resulting box is degenerate.

Panics

Panics if padding <= 0.

pub fn h_view(&self) -> FNx3View<'_>

View of the cell matrix

pub fn inv_view(&self) -> FNx3View<'_>

View of the inverse cell matrix

pub fn origin_view(&self) -> F3View<'_>

View of the origin

pub fn pbc_view(&self) -> ArrayView1<'_, bool>

View of the PBC flags

pub fn pbc(&self) -> Pbc3

Per-axis PBC flags

pub fn volume(&self) -> F

Cell volume (|det(H)|)

pub fn is_free(&self) -> bool

true when the box is free (non-periodic on every axis).

pub fn style(&self) -> &'static str

Geometry style label: "free" (no periodic axis), "orthogonal" (diagonal H), or "triclinic".

pub fn tilts(&self) -> F3

Off-diagonal tilts [xy, xz, yz] of the cell matrix

pub fn lengths(&self) -> F3

Lattice vector lengths

pub fn nearest_plane_distance(&self) -> F3

Nearest plane distance (half the box size along each axis) For triclinic boxes, this is the perpendicular distance to each face

pub fn kind(&self) -> &BoxKind

pub fn lattice(&self, index: usize) -> F3

Lattice vector by index (0,1,2) — columns of H

pub fn make_fractional(&self, r: F3View<'_>) -> F3

Convert Cartesian coordinates to fractional coordinates [0, 1)

pub fn make_fractional_fast(&self, r: F3View<'_>) -> F3

Fractional coordinates with ortho fast-path

pub fn make_fractional_fast_arr(&self, r: F3View<'_>) -> [F; 3]

Fractional coordinates returned as [F; 3] (zero-alloc hot path).

Equivalent to make_fractional_fast but avoids the Array1<F> heap allocation by returning a stack array. Use in tight inner loops (neighbor-list cell assignment, etc.).

pub fn make_cartesian(&self, frac: F3View<'_>) -> F3

Convert fractional coordinates to Cartesian coordinates

pub fn shortest_vector(&self, r1: F3View<'_>, r2: F3View<'_>) -> F3

Minimum image displacement vector from r1 to r2 (returns r2 − r1).

Ergonomic ndarray-flavoured API: takes views and returns an owned Array1<F>. Inside hot loops prefer shortest_vector_impl — it avoids the heap allocation for the output (~70% faster per call).

pub fn shortest_vector_impl(&self, a: [F; 3], b: [F; 3]) -> [F; 3]

Zero-allocation MIC displacement from a to b (returns b − a).

Stack-array in / out; the canonical hot-loop entry point. Used by LinkCell, BruteForce, and AabbQuery inner loops.

pub fn calc_distance2(&self, a: F3View<'_>, b: F3View<'_>) -> F

Calculate squared distance using MIC.

pub fn to_frac(&self, xyz: FNx3View<'_>) -> FNx3

Convert Cartesian points to fractional coordinates (N×3)

pub fn to_cart(&self, frac: FNx3View<'_>) -> FNx3

Convert fractional coordinates to Cartesian points (N×3)

pub fn isin(&self, xyz: FNx3View<'_>) -> Array1<bool>

Check if points lie within [0,1) in fractional space.

pub fn delta_out( &self, xyzu1: FNx3View<'_>, xyzu2: FNx3View<'_>, out: &mut FNx3, minimum_image: bool, )

Batched displacement vectors row-wise (N×3). Writes result into out to avoid allocation.

pub fn delta( &self, xyzu1: FNx3View<'_>, xyzu2: FNx3View<'_>, minimum_image: bool, ) -> FNx3

Batched displacement vectors row-wise (N×3)

pub fn wrap(&self, xyz: FNx3View<'_>) -> FNx3

Wrap Cartesian points into the unit cell according to PBC

pub fn get_corners(&self) -> FNx3

Trait Implementations

impl Clone for SimBox

fn clone(&self) -> SimBox

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SimBox

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

Formats the value using the given formatter.

impl Region for SimBox

fn bounds(&self) -> FNx3

Returns the axis-aligned bounding box of the region.

fn contains(&self, points: &FNx3) -> Array1<bool>

Batched containment test for a set of 3D points.

fn contains_point(&self, point: &[F; 3]) -> bool

Single-point containment test.