kgst 1.0.0

A library containing the implementation of a K-Truncated Generalized Suffix Tree using Ukkonen's Algorithm.
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

use serde::{Serialize, Deserialize};
use std::hash::Hash;
use std::fmt::{Display, Debug};
use std::collections::HashMap;

#[derive(Debug, Serialize, Deserialize)]
pub struct Enode<T, U>
where
    T: Display + Debug + Eq + PartialEq + Hash + Clone,
    U: Display + Debug + Eq + PartialEq + Hash + Clone,
{
    children: HashMap<T, usize>,
    data: Vec<U>,
    node_id: usize,
    slink: Option<usize>
}

impl<T, U> Enode<T, U>
where
    T: Display + Debug + Eq + PartialEq + Hash + Clone + Serialize,
    U: Display + Debug + Eq + PartialEq + Hash + Clone + Serialize,
{
    pub fn new(children: HashMap<T, usize>,
                data: Vec<U>,
                slink: Option<usize>,
                node_id: usize) -> Enode<T, U>{
            Enode{
                children,
                data,
                node_id,
                slink
            }
        }
}