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

use crate::data_store::intersection::Intersection;
use crate::data_store::transition::TransitionRef;
use crate::training::intersection_calculation::SegmentID;
use actix::prelude::*;
use actix_telepathy::prelude::*;
use ndarray::{Array1, Array2};
use serde::{Deserialize, Serialize};
use serde_with::serde_as;
use std::collections::HashMap;

pub(crate) struct IntersectionTask {
    pub transition: TransitionRef,
    pub segment_id: usize,
    pub line_points: Array2<f32>,
    pub plane_points: Array2<f32>,
}

#[derive(Message)]
#[rtype(Result = "()")]
pub(crate) struct IntersectionTaskMessage {
    pub tasks: Vec<IntersectionTask>,
    pub source: Recipient<IntersectionResultMessage>,
}

pub(crate) struct IntersectionResult {
    pub transition: TransitionRef,
    pub segment_id: usize,
    pub intersection: Array1<f32>,
}

#[derive(Message)]
#[rtype(Result = "()")]
pub(crate) struct IntersectionResultMessage {
    pub results: Vec<IntersectionResult>,
}

#[serde_as]
#[derive(RemoteMessage, Serialize, Deserialize, Default, Debug, Clone)]
pub(crate) struct IntersectionRotationMessage {
    #[serde_as(as = "Vec<(_, _)>")]
    pub intersection_coords_by_segment: HashMap<SegmentID, Vec<Intersection>>,
}

#[derive(Message)]
#[rtype(Result = "()")]
pub struct IntersectionCalculationDone;