Skip to main content

PeptideDb

Struct PeptideDb 

Source
pub struct PeptideDb {
    pub peptides: Vec<TheoPeptide>,
    pub n_targets: usize,
    pub n_decoys: usize,
}
Expand description

Mass-sorted peptide database with binary-search candidate lookup.

Fields§

§peptides: Vec<TheoPeptide>

Sorted ascending by mass.

§n_targets: usize§n_decoys: usize

Implementations§

Source§

impl PeptideDb

Source

pub fn build(fasta_path: impl AsRef<Path>, cfg: &DigestConfig) -> Result<Self>

Build the database from a FASTA file using the given digest config.

Examples found in repository?
examples/export_quant_digest.rs (line 14)
6fn main() -> Result<()> {
7    let args: Vec<_> = std::env::args().skip(1).collect();
8    ensure!(
9        args.len() == 3,
10        "usage: export_quant_digest FASTA DIGEST_CONFIG_JSON OUTPUT_TSV"
11    );
12    let mut config: DigestConfig = serde_json::from_str(&std::fs::read_to_string(&args[1])?)?;
13    config.generate_decoys = false;
14    let db = PeptideDb::build(&args[0], &config)?;
15    let mut peptides: Vec<_> = db.peptides.iter().filter(|p| !p.decoy).collect();
16    peptides.sort_by(|a, b| {
17        a.sequence
18            .cmp(&b.sequence)
19            .then_with(|| a.mass.total_cmp(&b.mass))
20    });
21    let file = std::fs::OpenOptions::new()
22        .write(true)
23        .create_new(true)
24        .open(&args[2])?;
25    let mut out = std::io::BufWriter::new(file);
26    writeln!(out, "sequence\tmass\tproteins")?;
27    for p in &peptides {
28        let mut proteins: Vec<_> = p.proteins.iter().map(|x| x.as_ref()).collect();
29        proteins.sort();
30        proteins.dedup();
31        writeln!(out, "{}\t{}\t{}", p.sequence, p.mass, proteins.join(";"))?;
32    }
33    out.flush()?;
34    eprintln!("{} target peptide entries", peptides.len());
35    Ok(())
36}
Source

pub fn len(&self) -> usize

Source

pub fn is_empty(&self) -> bool

Source

pub fn candidates(&self, lo: f64, hi: f64) -> &[TheoPeptide]

Candidate peptides whose mass falls in [lo, hi] (inclusive), as a slice of the sorted vector.

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> 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> 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> 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, 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<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V