s2gpp 1.0.2

Algorithm for Highly Efficient Detection of Correlation Anomalies in Multivariate Time Series
Documentation 
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

use crate::data_store::node::NodeRef;
use serde::{Deserialize, Serialize};
use std::hash::{Hash, Hasher};

#[derive(Serialize, Deserialize, Clone, Debug)]
pub(crate) struct IndependentNode {
    segment: usize,
    cluster: usize,
    from_point_id: usize,
}

impl IndependentNode {
    pub fn new(segment: usize, cluster: usize, from_point_id: usize) -> Self {
        Self {
            segment,
            cluster,
            from_point_id,
        }
    }

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

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

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

    pub fn into_ref(self) -> NodeRef {
        NodeRef::new(self)
    }
}

impl PartialEq<Self> for IndependentNode {
    fn eq(&self, other: &Self) -> bool {
        self.segment.eq(&other.segment) & self.cluster.eq(&other.cluster)
    }
}

impl Hash for IndependentNode {
    fn hash<H: Hasher>(&self, state: &mut H) {
        self.segment.hash(state);
        self.cluster.hash(state);
    }
}

impl Eq for IndependentNode {}