Skip to main content

AmberDcd

Struct AmberDcd 

Source
pub struct AmberDcd {
    pub frames: Vec<Vec<f32>>,
    pub n_atoms: usize,
}
Expand description

Simplified DCD trajectory writer (CHARMM/NAMD binary format).

Writes a self-contained binary header on construction, then one frame at a time via AmberDcd::write_frame. The output is a valid DCD (little-endian FORTRAN record format) readable by MDAnalysis / VMD.

Note: this implementation writes a simplified 84-byte header without the full CHARMM title block; it is intended for testing and round-trip verification in OxiPhysics.

Fields§

§frames: Vec<Vec<f32>>

Accumulated frame data (flat x, y, z per frame, f32 LE).

§n_atoms: usize

Number of atoms (fixed across frames).

Implementations§

Source§

impl AmberDcd

Source

pub fn new(n_atoms: usize) -> Self

Create a new DCD trajectory writer for n_atoms atoms.

Source

pub fn write_frame(&mut self, positions: &[[f64; 3]]) -> Result<(), String>

Append one frame of coordinates.

positions must have length n_atoms; returns an error otherwise.

Source

pub fn n_frames(&self) -> usize

Number of frames written.

Source

pub fn get_position( &self, frame_idx: usize, atom_idx: usize, ) -> Option<[f32; 3]>

Get position of atom atom_idx in frame frame_idx as f32.

Source

pub fn to_bytes(&self) -> Vec<u8>

Serialize to a simplified DCD binary representation.

Layout (little-endian):

  • 4 bytes: n_atoms (u32)
  • 4 bytes: n_frames (u32)
  • For each frame: 4 bytes record_len (u32), then n_atoms34 bytes (f32 LE)
Source

pub fn from_bytes(data: &[u8]) -> Result<Self, String>

Deserialize from the simplified DCD binary representation produced by AmberDcd::to_bytes.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.