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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

use crate::sais::saisxx;
use crate::types::{SArray, StringT, SuffixError};
use std::convert::TryInto;

fn suffixtree(
    string: &StringT,
    suffix_array: &mut SArray,
    left: &mut SArray,
    right: &mut SArray,
    depth: &mut SArray,
    n: usize,
) -> usize {
    if n == 0 {
        return 0;
    }

    // Psi = l
    left[suffix_array[0]] = suffix_array[n - 1];
    for i in 1..n {
        left[suffix_array[i]] = suffix_array[i - 1];
    }
    // Compare at most 2n log n charcters. Practically fastest
    // "Permuted Longest-Common-Prefix Array", Juha Karkkainen, CPM 09
    // PLCP = r
    let mut h = 0;
    for i in 0..n {
        let j = left[i];
        while i + h < n && j + h < n && string[i + h] == string[j + h] {
            h += 1;
        }
        right[i] = h;
        h = h.saturating_sub(1);
    }

    // H = l
    for i in 0..n {
        left[i] = right[suffix_array[i]];
    }
    // TODO XXX: i32 necessary
    // l[0] = -1;

    let mut s: Vec<(i32, i32)> = vec![(-1, -1)];
    let mut node_num = 0;
    let mut i: usize = 0;
    loop {
        let mut cur: (i32, i32) = (i as i32, if i == n { -1 } else { left[i] as i32 });
        let mut cand = s[s.len() - 1];
        while cand.1 > cur.1 {
            if (i as i32) - cand.0 > 1 {
                left[node_num] = cand.0.try_into().unwrap();
                right[node_num] = i;
                depth[node_num] = cand.1.try_into().unwrap();
                node_num += 1;
                if node_num >= n {
                    break;
                }
            }
            cur.0 = cand.0;
            s.pop();
            cand = s[s.len() - 1];
        }
        if cand.1 < cur.1 {
            s.push(cur);
        }
        if i == n {
            break;
        }
        s.push((
            i.try_into().unwrap(),
            (n - suffix_array[i] + 1).try_into().unwrap(),
        ));
        i += 1;
    }
    node_num
}

pub(crate) fn esaxx_rs(
    string: &StringT,
    suffix_array: &mut SArray,
    left: &mut SArray,
    right: &mut SArray,
    depth: &mut SArray,
    k: usize,
) -> Result<usize, SuffixError> {
    let n = string.len();
    saisxx(string, suffix_array, n, k)?;
    let node_num = suffixtree(string, suffix_array, left, right, depth, n);
    Ok(node_num)
}