proseg 3.2.0

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

use ahash::AHashMap as HashMap;
use rand::Rng;
use rand::rngs::ThreadRng;
use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::hash::Hash;

// A set you can sample random elements from.
// Inspired by this solution: https://stackoverflow.com/a/53773240
#[derive(Clone)]
pub struct SampleSet<T> {
    set: HashMap<T, usize>,
    vec: Vec<T>,
}

impl<T> PartialEq for SampleSet<T>
where
    T: Eq + Hash,
{
    fn eq(&self, other: &Self) -> bool {
        self.set.len() == other.set.len() && self.set.keys().all(|k| other.set.contains_key(k))
    }
}

impl<T> Eq for SampleSet<T> where T: Eq + Hash {}

impl<T> SampleSet<T>
where
    T: Eq + Hash + Copy,
{
    pub fn new() -> Self {
        SampleSet {
            set: HashMap::new(),
            vec: Vec::new(),
        }
    }

    pub fn len(&self) -> usize {
        assert!(self.set.len() == self.vec.len());
        self.vec.len()
    }

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    // pub fn clear(&mut self) {
    //     self.set.clear();
    //     self.vec.clear();
    // }

    pub fn insert(&mut self, value: T) -> bool {
        if let Vacant(entry) = self.set.entry(value) {
            entry.insert(self.vec.len());
            self.vec.push(value);
            true
        } else {
            false
        }
    }

    pub fn remove(&mut self, value: T) -> bool {
        if let Occupied(entry) = self.set.entry(value) {
            let index = *entry.get();
            self.vec.swap_remove(index);
            self.set.remove(&value);
            // update the index that we just swapped
            if index < self.vec.len() {
                self.set.insert(self.vec[index], index);
            }
            true
        } else {
            false
        }
    }

    pub fn choose(&self, rng: &mut ThreadRng) -> Option<&T> {
        if self.is_empty() {
            return None;
        }
        let index = rng.random_range(0..self.len());
        Some(&self.vec[index])
    }

    pub fn clear(&mut self) {
        self.set.clear();
        self.vec.clear();
    }

    pub fn extend<'a, I>(&mut self, other: I)
    where
        I: IntoIterator<Item = &'a T>,
        T: 'a,
    {
        for value in other.into_iter() {
            self.insert(*value);
        }
    }

    pub fn iter(&self) -> std::slice::Iter<T> {
        self.vec.iter()
    }

    // fn contains(&self, value: &T) -> bool {
    //     return self.set.contains_key(value);
    // }

    // pub fn iter(&self) -> std::slice::Iter<T> {
    //     return self.vec.iter();
    // }
}