proseg 3.0.12

Probabilistic cell segmentation for in situ spatial transcriptomics
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133

// This is barrowing from the `rle_vec` crate, but with some additional features:
// - Generic on run length type (our runs will always fit in u32s, so we want to
// save space)

use num::cast::AsPrimitive;
use num::{Integer, NumCast};
use std::iter::Iterator;
use std::ops::{AddAssign, SubAssign};

#[derive(Debug)]
pub struct Run<I, T> {
    pub len: I,
    pub value: T,
}

pub struct RunVec<I, T> {
    pub runs: Vec<Run<I, T>>,
    pub len: usize,
}

pub struct RunVecIter<'a, I, T> {
    it: std::slice::Iter<'a, Run<I, T>>,
    value: Option<&'a T>,
    count: I,
}

impl<'a, I, T> Iterator for RunVecIter<'a, I, T>
where
    I: Integer + NumCast + AddAssign + SubAssign + Copy,
    T: PartialEq,
{
    type Item = &'a T;
    fn next(&mut self) -> Option<&'a T> {
        if self.count.is_zero() {
            if let Some(next_value) = self.it.next() {
                self.count = next_value.len;
                self.value = Some(&next_value.value);
                self.next()
            } else {
                None
            }
        } else {
            self.count -= I::one();
            self.value
        }
    }
}

impl<I, T> RunVec<I, T>
where
    I: Integer + NumCast + AddAssign + SubAssign + Copy + AsPrimitive<usize>,
    T: Copy + PartialEq,
{
    pub fn new() -> Self {
        RunVec {
            runs: Vec::new(),
            len: 0,
        }
    }

    pub fn with_run_capacity(nruns: usize) -> Self {
        RunVec {
            runs: Vec::with_capacity(nruns),
            len: 0,
        }
    }

    pub fn push(&mut self, value: T) {
        if let Some(last) = self.runs.last_mut() {
            if last.value == value {
                last.len += I::one();
                self.len += 1;
                return;
            }
        }

        self.runs.push(Run {
            len: I::one(),
            value,
        });
        self.len += 1;
    }

    pub fn push_run(&mut self, value: T, len: I) {
        if let Some(last) = self.runs.last_mut() {
            if last.value == value {
                last.len += len;
                self.len += len.as_();
                return;
            }
        }

        self.runs.push(Run { len, value });
        self.len += len.as_();
    }

    pub fn len(&self) -> usize {
        self.len
    }

    // pub fn nruns(&self) -> usize {
    //     self.runs.len()
    // }

    pub fn iter_runs(&self) -> impl Iterator<Item = &Run<I, T>> {
        self.runs.iter()
    }

    pub fn iter_runs_mut(&mut self) -> impl Iterator<Item = &mut Run<I, T>> {
        self.runs.iter_mut()
    }

    pub fn iter(&self) -> RunVecIter<I, T> {
        RunVecIter {
            it: self.runs.iter(),
            value: None,
            count: I::zero(),
        }
    }

    pub fn retain_masked(&mut self, mask: &Vec<bool>) {
        let mut newruns: RunVec<I, T> = RunVec::new();

        for (value, m) in self.iter().zip(mask) {
            if *m {
                newruns.push(*value);
            }
        }

        self.len = newruns.len;
        self.runs = newruns.runs;
    }
}