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

mod independent;

use crate::data_store::intersection::IntersectionRef;
pub(crate) use crate::data_store::node::independent::IndependentNode;
use std::fmt::{Display, Formatter};
use std::sync::Arc;

#[derive(Clone, Debug)]
pub(crate) struct Node {
    intersection: IntersectionRef,
    cluster: usize,
}

impl Node {
    pub fn new(intersection: IntersectionRef, cluster: usize) -> Self {
        Self {
            intersection,
            cluster,
        }
    }

    pub fn to_independent(&self) -> IndependentNode {
        IndependentNode::new(
            self.get_segment_id(),
            self.get_cluster(),
            self.get_intersection().get_from_id(),
        )
    }

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

    pub fn get_intersection(&self) -> IntersectionRef {
        self.intersection.clone()
    }

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

pub(crate) type NodeRef = Arc<IndependentNode>;

impl Display for Node {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}_{}", self.get_segment_id(), self.get_cluster())
    }
}