Skip to main content

BinaryArrayMap

Struct BinaryArrayMap 

Source
pub struct BinaryArrayMap {
    pub byte_buffer_map: HashMap<ArrayType, DataArray>,
}
Expand description

A collection of DataArrays that are identified by name.

§Examples

use mzdata_bindata::{ArrayType, BinaryArrayMap, BinaryDataArrayType, DataArray};

let mut map = BinaryArrayMap::new();
assert!(!map.has_array(&ArrayType::MZArray));

let array = DataArray::from_name_and_type(&ArrayType::MZArray, BinaryDataArrayType::Float64);
map.add(array);

assert!(map.has_array(&ArrayType::MZArray));
assert_eq!(map.len(), 1);

Fields§

§byte_buffer_map: HashMap<ArrayType, DataArray>

Implementations§

Source§

impl BinaryArrayMap

Source

pub fn new() -> BinaryArrayMap

Source

pub fn len(&self) -> usize

Get the number of arrays in the map

Source

pub fn is_empty(&self) -> bool

Source

pub fn has_ion_mobility(&self) -> bool

Check if there is an ion mobility array present

Examples found in repository?
examples/mzinfo.rs (line 76)
49    pub fn handle_scan(&mut self, scan: MultiLayerSpectrum) {
50        let time = scan.start_time();
51        self.start_time = self.start_time.min(time);
52        self.end_time = self.end_time.max(time);
53        let level = scan.ms_level();
54        *self.level_table.entry(level).or_default() += 1;
55        *self.spectrum_types.entry(scan.spectrum_type()).or_default() += 1;
56        if level > 1 {
57            if let Some(charge) = scan.precursor().unwrap().ion().and_then(|i| i.charge()) {
58                *self.charge_table.entry(charge).or_default() += 1;
59            } else {
60                *self.charge_table.entry(0).or_default() += 1;
61            }
62        }
63        *self
64            .peak_mode_table
65            .entry(scan.signal_continuity())
66            .or_default() += scan.peaks().len();
67
68        let has_charge = match scan.peaks() {
69            RefPeakDataLevel::Missing => false,
70            RefPeakDataLevel::RawData(arrays) => arrays.charges().is_ok(),
71            RefPeakDataLevel::Centroid(_) => false,
72            RefPeakDataLevel::Deconvoluted(_) => true,
73        };
74
75        let has_ion_mobility = match scan.peaks() {
76            RefPeakDataLevel::RawData(arrays) => arrays.has_ion_mobility(),
77            _ => false,
78        } || scan.has_ion_mobility();
79        self.has_ion_mobility |= has_ion_mobility;
80
81        if has_charge {
82            let deconv_scan: DeconvolutedSpectrum = scan.try_into().unwrap();
83            deconv_scan.deconvoluted_peaks.iter().for_each(|p| {
84                *(*self
85                    .peak_charge_table
86                    .entry(deconv_scan.ms_level())
87                    .or_default())
88                .entry(p.charge)
89                .or_default() += 1;
90                assert!((p.index as usize) < deconv_scan.deconvoluted_peaks.len())
91            })
92        }
93    }
Source

pub fn iter(&self) -> Iter<'_, ArrayType, DataArray> ⓘ

Iterate over references to the key-value pairs of this map

Source

pub fn iter_mut(&mut self) -> IterMut<'_, ArrayType, DataArray> ⓘ

Iterate over mutable references to the key-value pairs of this map

Source

pub fn encode_array( &mut self, array_type: &ArrayType, compression: BinaryCompressionType, ) -> Result<(), ArrayRetrievalError>

Compress a specific DataArray with the compression scheme provided, if it is present.

This method may fail if the compression fails or if the array type is missing.

§See Also

DataArray::store_compressed

Source

pub fn decode_all_arrays(&mut self) -> Result<(), ArrayRetrievalError>

Decode all DataArray in this map if they have not been decoded already so that they are ready for use. If there are many arrays and the parallelism feature is enabled, arrays may be decoded in parallel.

§Examples
use mzdata_bindata::{ArrayType, BinaryArrayMap, BinaryCompressionType, BinaryDataArrayType, DataArray};

let mut mz_array = DataArray::from_name_and_type(&ArrayType::MZArray, BinaryDataArrayType::Float64);
mz_array.extend(&[1.0f64, 2.0, 3.0]).unwrap();
mz_array.store_compressed(BinaryCompressionType::Zlib).unwrap();

let mut map = BinaryArrayMap::new();
map.add(mz_array);
assert_eq!(map.get(&ArrayType::MZArray).unwrap().compression, BinaryCompressionType::Zlib);

map.decode_all_arrays().unwrap();
assert_eq!(map.get(&ArrayType::MZArray).unwrap().compression, BinaryCompressionType::Decoded);
Source

pub fn decode_array( &mut self, array_type: &ArrayType, ) -> Result<(), ArrayRetrievalError>

Decode a specific DataArray if it is present.

This method may fail if decoding fails or if the array type is missing.

See DataArray::decode_and_store

Source

pub fn add(&mut self, array: DataArray)

Add a DataArray to the map by its ArrayType name

Source

pub fn get(&self, array_type: &ArrayType) -> Option<&DataArray>

Get a reference to a specific DataArray if present

Source

pub fn get_mut(&mut self, array_type: &ArrayType) -> Option<&mut DataArray>

Get a mutable reference to a specific DataArray if present

Source

pub fn has_array(&self, array_type: &ArrayType) -> bool

Check whether a specific ArrayType is present

Source

pub fn clear(&mut self)

Clear the map, discarding any array data

Source

pub fn search(&self, query: f64, error_tolerance: Tolerance) -> Option<usize>

Search for a specific m/z within a specified Tolerance.

This effectively calls BinaryArrayMap::mzs to get the m/z array and then performs a binary search to find the best index within range, if one exists.

Source

pub fn mzs(&self) -> Result<Cow<'_, [f64]>, ArrayRetrievalError>

Get a reference to the m/z array if it is present

§Examples
use mzdata_bindata::{ArrayType, BinaryArrayMap, BinaryDataArrayType, DataArray};

let mut mz_array = DataArray::from_name_and_type(&ArrayType::MZArray, BinaryDataArrayType::Float64);
mz_array.extend(&[100.0f64, 200.0, 300.0]).unwrap();

let mut map = BinaryArrayMap::new();
map.add(mz_array);

assert_eq!(&*map.mzs().unwrap(), &[100.0f64, 200.0, 300.0][..]);
Examples found in repository?
examples/get_scan_by.rs (line 47)
7fn main() -> io::Result<()> {
8    env_logger::init();
9    let mut args = env::args().skip(1);
10
11    let path = path::PathBuf::from(args.next().expect("Please pass an MS data file path"));
12
13    let key = args
14        .next()
15        .expect("Please provide a key type, \"id\", \"index\" or \"time\"");
16    let key_value = args
17        .next()
18        .expect("Please provide a key value matching the key type");
19
20    info!("Opening {}", path.display());
21    let mut reader = MZReader::open_path(path)?;
22    info!("{} spectra detected", reader.len());
23    let spectrum = match key.as_str() {
24        "id" => reader.get_spectrum_by_id(&key_value).unwrap(),
25        "index" => reader
26            .get_spectrum_by_index(key_value.parse().unwrap())
27            .unwrap(),
28        "time" => reader
29            .get_spectrum_by_time(key_value.parse().unwrap())
30            .unwrap(),
31        _ => {
32            panic!("Unknown key type {}", key);
33        }
34    };
35
36    // dbg!(spectrum);
37    println!(
38        "ID: {}; Index: {}; Time: {}",
39        spectrum.id(),
40        spectrum.index(),
41        spectrum.start_time()
42    );
43    println!(
44        "Num data points: {}",
45        spectrum
46            .raw_arrays()
47            .and_then(|r| Some(r.mzs().ok()?.len()))
48            .unwrap_or_default()
49    );
50    if spectrum.signal_continuity().is_centroid() && spectrum.raw_arrays().is_none() {
51        println!("Num peaks: {}", spectrum.peaks().len());
52    }
53    Ok(())
54}
Source

pub fn sort_from_indices( &mut self, mask: Vec<usize>, ) -> Result<(), ArrayRetrievalError>

Re-order all arrays of matching length with respect to the provided index mask operating on the decoded native value states.

The mask would be created using an indirect sort from another array:

let vals = self.mzs().unwrap();
let n = vals.len();
let mut mask: Vec<usize> = (0..n).into_iter().collect();
mask.sort_by(|i, j| {
    let a = vals[*i];
    let b = vals[*j];
    a.total_cmp(&b)
});
drop(vals);
self.sort_from_indices(mask)
Source

pub fn sort_by_array( &mut self, name: &ArrayType, ) -> Result<(), ArrayRetrievalError>

Sort all the arrays in the map by name if they are the same length. This operates on the decoded state directly.

This builds the sorting mask and then leaves Self::sort_from_indices to perform the re-ordering.

Not supported for BinaryDataArrayType::ASCII and BinaryDataArrayType::Unknown.

Source

pub fn mzs_mut(&mut self) -> Result<&mut [f64], ArrayRetrievalError>

Get a mutable reference to the m/z array if it is present.

This method obtains the m/z array, calls DataArray::decode_and_store to force the data to be stored natively in memory, and forces the storage to be BinaryDataArrayType::Float64 if not already. Finally it returns a mutable view of that decoded dataas &mut [f64]

Source

pub fn intensities(&self) -> Result<Cow<'_, [f32]>, ArrayRetrievalError>

Get a reference to the intensity array if it is present

Source

pub fn intensities_mut(&mut self) -> Result<&mut [f32], ArrayRetrievalError>

Get a mutable reference to the intensity array if it is present.

See BinaryArrayMap::mzs_mut for an explanation of the intermediate steps, save that the forced storage type is [BinaryArrayDataType::Float32].

Source

pub fn charges(&self) -> Result<Cow<'_, [i32]>, ArrayRetrievalError>

Get a reference to the charge array if it is present

Examples found in repository?
examples/mzinfo.rs (line 70)
49    pub fn handle_scan(&mut self, scan: MultiLayerSpectrum) {
50        let time = scan.start_time();
51        self.start_time = self.start_time.min(time);
52        self.end_time = self.end_time.max(time);
53        let level = scan.ms_level();
54        *self.level_table.entry(level).or_default() += 1;
55        *self.spectrum_types.entry(scan.spectrum_type()).or_default() += 1;
56        if level > 1 {
57            if let Some(charge) = scan.precursor().unwrap().ion().and_then(|i| i.charge()) {
58                *self.charge_table.entry(charge).or_default() += 1;
59            } else {
60                *self.charge_table.entry(0).or_default() += 1;
61            }
62        }
63        *self
64            .peak_mode_table
65            .entry(scan.signal_continuity())
66            .or_default() += scan.peaks().len();
67
68        let has_charge = match scan.peaks() {
69            RefPeakDataLevel::Missing => false,
70            RefPeakDataLevel::RawData(arrays) => arrays.charges().is_ok(),
71            RefPeakDataLevel::Centroid(_) => false,
72            RefPeakDataLevel::Deconvoluted(_) => true,
73        };
74
75        let has_ion_mobility = match scan.peaks() {
76            RefPeakDataLevel::RawData(arrays) => arrays.has_ion_mobility(),
77            _ => false,
78        } || scan.has_ion_mobility();
79        self.has_ion_mobility |= has_ion_mobility;
80
81        if has_charge {
82            let deconv_scan: DeconvolutedSpectrum = scan.try_into().unwrap();
83            deconv_scan.deconvoluted_peaks.iter().for_each(|p| {
84                *(*self
85                    .peak_charge_table
86                    .entry(deconv_scan.ms_level())
87                    .or_default())
88                .entry(p.charge)
89                .or_default() += 1;
90                assert!((p.index as usize) < deconv_scan.deconvoluted_peaks.len())
91            })
92        }
93    }
Source

pub fn charge_mut(&mut self) -> Result<&mut [i32], ArrayRetrievalError>

Get a mutable reference to the charge array if it is present.

See BinaryArrayMap::mzs_mut for an explanation of the intermediate steps, save that the forced storage type is [BinaryArrayDataType::Int32].

Source

pub fn ion_mobility( &self, ) -> Result<(Cow<'_, [f64]>, ArrayType), ArrayRetrievalError>

Get a reference to the ion mobility array if it is present

Source

pub fn ion_mobility_mut( &mut self, ) -> Result<(&mut [f64], ArrayType), ArrayRetrievalError>

Get a mutable reference to the ion mobility array if it is present.

See BinaryArrayMap::mzs_mut for an explanation of the intermediate steps.

Source

pub fn stack_ion_mobility(self) -> Result<BinaryArrayMap3D, ArrayRetrievalError>

Split an array map along the ion mobility dimension if it is present.

This function will fail if there is no ion mobility dimension.

Trait Implementations§

Source§

impl Clone for BinaryArrayMap

Source§

fn clone(&self) -> BinaryArrayMap

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for BinaryArrayMap

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for BinaryArrayMap

Source§

fn default() -> BinaryArrayMap

Returns the “default value” for a type. Read more
Source§

impl<'de> Deserialize<'de> for BinaryArrayMap

Source§

fn deserialize<__D>( __deserializer: __D, ) -> Result<BinaryArrayMap, <__D as Deserializer<'de>>::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl From<&PeakSetVec<CentroidPeak, MZ>> for BinaryArrayMap

Source§

fn from(peaks: &PeakSetVec<CentroidPeak, MZ>) -> BinaryArrayMap

Converts to this type from the input type.
Source§

impl From<&PeakSetVec<DeconvolutedPeak, Mass>> for BinaryArrayMap

Source§

fn from(peaks: &PeakSetVec<DeconvolutedPeak, Mass>) -> BinaryArrayMap

Converts to this type from the input type.
Source§

impl From<ArrayPair<'_>> for BinaryArrayMap

Source§

fn from(value: ArrayPair<'_>) -> BinaryArrayMap

Converts to this type from the input type.
Source§

impl IntoIterator for BinaryArrayMap

Source§

type Item = (ArrayType, DataArray)

The type of the elements being iterated over.
Source§

type IntoIter = <HashMap<ArrayType, DataArray> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?
Source§

fn into_iter(self) -> <BinaryArrayMap as IntoIterator>::IntoIter

Creates an iterator from a value. Read more
Source§

impl Serialize for BinaryArrayMap

Source§

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
Source§

impl TryFrom<&BinaryArrayMap3D> for BinaryArrayMap

Source§

type Error = ArrayRetrievalError

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

fn try_from( value: &BinaryArrayMap3D, ) -> Result<BinaryArrayMap, <BinaryArrayMap as TryFrom<&BinaryArrayMap3D>>::Error>

Performs the conversion.
Source§

impl<C, D> TryFrom<&BinaryArrayMap> for PeakDataLevel<C, D>

Source§

type Error = ArrayRetrievalError

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

fn try_from( value: &BinaryArrayMap, ) -> Result<PeakDataLevel<C, D>, <PeakDataLevel<C, D> as TryFrom<&BinaryArrayMap>>::Error>

Performs the conversion.
Source§

impl TryFrom<&BinaryArrayMap> for BinaryArrayMap3D

Source§

type Error = ArrayRetrievalError

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

fn try_from( value: &BinaryArrayMap, ) -> Result<BinaryArrayMap3D, <BinaryArrayMap3D as TryFrom<&BinaryArrayMap>>::Error>

Performs the conversion.
Source§

impl TryFrom<BinaryArrayMap3D> for BinaryArrayMap

Source§

type Error = ArrayRetrievalError

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

fn try_from( value: BinaryArrayMap3D, ) -> Result<BinaryArrayMap, <BinaryArrayMap as TryFrom<BinaryArrayMap3D>>::Error>

Performs the conversion.
Source§

impl TryFrom<BinaryArrayMap> for BinaryArrayMap3D

Source§

fn try_from( value: BinaryArrayMap, ) -> Result<BinaryArrayMap3D, <BinaryArrayMap3D as TryFrom<BinaryArrayMap>>::Error>

A wrapper around BinaryArrayMap3D::stack

Source§

type Error = ArrayRetrievalError

The type returned in the event of a conversion error.

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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

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
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

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

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

type Error = !

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

fn try_from(value: U) -> Result<T, !>

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.
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more