Struct Posvol
pub struct Posvol {
pub dimensions: Dimensions,
pub cells: Vec<i32>,
}
Expand description
Representation of data in a UKAEA CuV posvol file
The byte layout is very simple. The 6 dimension values in the first block are stored as Dimensions.
<block byte length>
<resolution i> <resolution j> <resolution k>
<iints+1> <jints+1> <kints+1>
<block byte length>
The second block contains all cell data in a continuous array, and is stored
as a vector of cell values (Vec<i32>
).
<block byte length>
<voxel 0, subvoxel 0> <voxel 0, subvoxel 1> <voxel 0, subvoxel 2> ...
<voxel 1, subvoxel 0> <voxel 1, subvoxel 1> <voxel 1, subvoxel 2> ...
... and so on
<block byte length>
Fields§
§dimensions: Dimensions
The dimensions given in the first block of data
cells: Vec<i32>
List of dominant cells for every subvoxel
Implementations§
§impl Posvol
impl Posvol
pub fn subvoxels(&self) -> Vec<&[i32]>
pub fn subvoxels(&self) -> Vec<&[i32]>
Vector of subvoxel cell groups
Extremely common to iterate over the voxels in chunks of subvoxel cells.
pub fn number_of_voxels(&self) -> usize
pub fn number_of_voxels(&self) -> usize
Number of voxels expected in the file
pub fn number_of_subvoxels(&self) -> usize
pub fn number_of_subvoxels(&self) -> usize
Number of samples per voxel expected in the file
pub fn number_of_cells(&self) -> usize
pub fn number_of_cells(&self) -> usize
Total number of cells expected in the file
Trait Implementations§
§impl Serialize for Posvol
impl Serialize for Posvol
§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
Auto Trait Implementations§
impl Freeze for Posvol
impl RefUnwindSafe for Posvol
impl Send for Posvol
impl Sync for Posvol
impl Unpin for Posvol
impl UnwindSafe for Posvol
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
Mutably borrows from an owned value. Read more
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>
Converts
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>
Converts
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§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.