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
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

pub mod tree_item;

use std::fmt;
use core::fmt::{Debug, Display};
use std::hash::Hash;
use itertools::Itertools;
use serde::{Serialize, Deserialize};
use crate::data::tree_item::{TreeItem as OtherTreeItem, Character};
use crate::suffix_node::node::NodeID;

#[derive(Debug, Hash, Eq, PartialEq, Clone, Serialize, Deserialize)]
pub struct TreeItem<T, U>
where
    T: Display + Debug + PartialEq + PartialOrd,
    U: Display + Debug + PartialEq + Hash
{
    string: Vec<Character<T>>,
    id: U,
    nodes: Vec<NodeID>,
}


impl<T, U> OtherTreeItem<T, U> for TreeItem<T, U> 
where
    T: Display + Debug + Eq + PartialEq + PartialOrd,
    U: Display + Debug + Eq + PartialEq + Hash
{
    fn new(k: U, v: Vec<T>)->Self{
        TreeItem { string: v.into_iter().map(|x| Character::Char(x)).collect_vec(), id: k , nodes: vec![]}
    }

    fn get_string(&self) -> &[Character<T>]{
        self.string.as_slice()
    }

    fn get_id(&self) -> &U{
        &self.id
    }

    fn get_nodes(&self) -> impl ExactSizeIterator<Item= &NodeID>{
        self.nodes.iter()
    }

    fn add_data_to_node(&mut self, node_id: &NodeID) {
        self.nodes.push(*node_id)
    }
}


impl<T, U> Display for TreeItem<T, U> 
where
    T: Display + Debug + Eq + PartialEq + PartialOrd + Hash,
    U: Display + Debug + Eq + PartialEq + Hash
{
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        writeln!(f, "String ID: {}", self.get_id())?;
        write!(f, "String: ")?;
        for v in self.get_string() {
            write!(f, "{}", v)?;
        }
        writeln!(f)?;
        Ok(())
    }

}