pub struct Model {
pub a: (Location, Vec<NeutralLoss>),
pub b: (Location, Vec<NeutralLoss>),
pub c: (Location, Vec<NeutralLoss>),
pub d: (Location, Vec<NeutralLoss>),
pub v: (Location, Vec<NeutralLoss>),
pub w: (Location, Vec<NeutralLoss>),
pub x: (Location, Vec<NeutralLoss>),
pub y: (Location, Vec<NeutralLoss>),
pub z: (Location, Vec<NeutralLoss>),
pub precursor: Vec<NeutralLoss>,
pub ppm: MassOverCharge,
pub glycan_fragmentation: Option<Vec<NeutralLoss>>,
}Expand description
A model for the fragmentation, allowing control over what theoretical fragments to generate.
Fields§
§a: (Location, Vec<NeutralLoss>)a series ions
b: (Location, Vec<NeutralLoss>)b series ions
c: (Location, Vec<NeutralLoss>)c series ions
d: (Location, Vec<NeutralLoss>)d series ions (side chain fragmentation from a)
v: (Location, Vec<NeutralLoss>)v series ions (full side chain broken off)
w: (Location, Vec<NeutralLoss>)w series ions (side chain fragmentation from z)
x: (Location, Vec<NeutralLoss>)x series ions
y: (Location, Vec<NeutralLoss>)y series ions
z: (Location, Vec<NeutralLoss>)z series ions
precursor: Vec<NeutralLoss>precursor ions
ppm: MassOverChargeThe matching tolerance
glycan_fragmentation: Option<Vec<NeutralLoss>>If some search for glycan with the given neutral losses
Implementations§
source§impl Model
impl Model
sourcepub fn ions(&self, index: usize, length: usize) -> PossibleIons<'_>
pub fn ions(&self, index: usize, length: usize) -> PossibleIons<'_>
Give all possible ions for the given position
sourcepub fn new(
a: (Location, Vec<NeutralLoss>),
b: (Location, Vec<NeutralLoss>),
c: (Location, Vec<NeutralLoss>),
d: (Location, Vec<NeutralLoss>),
v: (Location, Vec<NeutralLoss>),
w: (Location, Vec<NeutralLoss>),
x: (Location, Vec<NeutralLoss>),
y: (Location, Vec<NeutralLoss>),
z: (Location, Vec<NeutralLoss>),
precursor: Vec<NeutralLoss>,
ppm: MassOverCharge,
glycan_fragmentation: Option<Vec<NeutralLoss>>
) -> Self
pub fn new( a: (Location, Vec<NeutralLoss>), b: (Location, Vec<NeutralLoss>), c: (Location, Vec<NeutralLoss>), d: (Location, Vec<NeutralLoss>), v: (Location, Vec<NeutralLoss>), w: (Location, Vec<NeutralLoss>), x: (Location, Vec<NeutralLoss>), y: (Location, Vec<NeutralLoss>), z: (Location, Vec<NeutralLoss>), precursor: Vec<NeutralLoss>, ppm: MassOverCharge, glycan_fragmentation: Option<Vec<NeutralLoss>> ) -> Self
Build a new model
Trait Implementations§
source§impl PartialEq for Model
impl PartialEq for Model
impl StructuralPartialEq for Model
Auto Trait Implementations§
impl RefUnwindSafe for Model
impl Send for Model
impl Sync for Model
impl Unpin for Model
impl UnwindSafe for Model
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
§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.