actiondb 0.7.0

A safe and efficient unstructured text (log) parsing library.
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148

use super::impls::SuffixTable;
use super::interface::{SuffixArray, LiteralEntry};
use parsers::IntParser;
use matcher::compiled_pattern::CompiledPatternBuilder;
use parsers::SetParser;
use matcher::pattern::Pattern;
use matcher::Matcher;

use std::iter::FromIterator;
use std::collections::BTreeMap;

fn create_populated_suffix_table() -> SuffixTable {
    let mut root = SuffixTable::new();
    let cp_1 = CompiledPatternBuilder::new()
                .literal("app")
                .parser(Box::new(SetParser::from_str("middle", "01234")))
                .literal("letree")
                .parser(Box::new(SetParser::from_str("end", "012")))
                .build();
    let cp_2 = CompiledPatternBuilder::new()
                .literal("app")
                .parser(Box::new(SetParser::from_str("middle", "01234")))
                .literal("letree")
                .parser(Box::new(SetParser::from_str("end", "0123")))
                .build();
    let cp_3 = CompiledPatternBuilder::new()
                .literal("bamboo")
                .build();
    let cp_4 = CompiledPatternBuilder::new()
                .literal("bamba")
                .build();

    let mut pattern_1 = Pattern::with_random_uuid();
    pattern_1.set_pattern(cp_1);
    let mut pattern_2 = Pattern::with_random_uuid();
    pattern_2.set_pattern(cp_2);
    let mut pattern_3 = Pattern::with_random_uuid();
    pattern_3.set_pattern(cp_3);
    let mut pattern4 = Pattern::with_random_uuid();
    pattern4.set_pattern(cp_4);

    root.insert(pattern_1);
    root.insert(pattern_2);
    root.insert(pattern_3);
    root.insert(pattern4);

    root
}

#[test]
fn test_given_parser_trie_when_a_parser_is_not_matched_then_the_parser_stack_is_unwind_so_an_untried_parser_is_tried() {
    let root = create_populated_suffix_table();
    println!("root: {:?}", &root);
    {
        let result = root.parse("app42letree123");
        let expected = BTreeMap::from_iter(vec![("end", "123"), ("middle", "42")].into_iter());

        assert_eq!(&expected, result.expect("Failed to get result").values());
    }
}

#[test]
fn test_given_suffix_array_when_a_parser_entry_is_inserted_it_is_only_added_if_it_is_a_new_parser() {
    let mut root = SuffixTable::new();
    let cp_1 = CompiledPatternBuilder::new()
                .parser(Box::new(IntParser::new()))
                .build();
    let cp_2 = CompiledPatternBuilder::new()
                .parser(Box::new(IntParser::new()))
                .build();

    let mut pattern_1 = Pattern::with_random_uuid();
    pattern_1.set_pattern(cp_1);
    root.insert(pattern_1);

    let mut pattern_2 = Pattern::with_random_uuid();
    pattern_2.set_pattern(cp_2);
    root.insert(pattern_2);

    assert_eq!(true, root.parse("42").is_some());
}

#[test]
fn test_given_suffix_array_when_there_is_no_match_then_the_parsing_is_unsuccessful() {
    let mut root = SuffixTable::new();
    let cp_1 = CompiledPatternBuilder::new()
                .literal("app")
                .parser(Box::new(IntParser::new()))
                .build();
    let mut pattern = Pattern::with_random_uuid();
    pattern.set_pattern(cp_1);
    root.insert(pattern);

    assert_eq!(true, root.parse("XYZ").is_none());
}

#[test]
fn test_given_suffix_array_when_the_match_is_too_short_then_we_dont_panic() {
    let mut root = SuffixTable::new();
    let cp_1 = CompiledPatternBuilder::new()
                .literal("app")
                .parser(Box::new(IntParser::new()))
                .build();
    let mut pattern = Pattern::with_random_uuid();
    pattern.set_pattern(cp_1);
    root.insert(pattern);

    assert_eq!(true, root.parse("XYZ").is_none());
}

#[test]
fn test_given_suffix_array_when_during_parsing_the_parsed_value_is_not_empty_but_we_cant_go_forward_then_the_parsing_is_unsuccessful() {
    let mut root = SuffixTable::new();
    let cp_1 = CompiledPatternBuilder::new()
                .literal("app")
                .build();
    let mut pattern = Pattern::with_random_uuid();
    pattern.set_pattern(cp_1);
    root.insert(pattern);

    assert_eq!(true, root.parse("apple").is_none());
}

#[test]
fn test_given_suffix_array_when_a_literal_entry_is_found_then_it_is_returned() {
    let mut root = SuffixTable::new();
    let cp_1 = CompiledPatternBuilder::new()
                .literal("app")
                .build();
    let mut pattern = Pattern::with_random_uuid();
    pattern.set_pattern(cp_1);
    root.insert(pattern);

    assert_eq!(true, root.parse("app").is_some());
}

#[test]
fn test_given_suffix_array_when_literals_are_inserted_then_it_can_find_the_string_with_the_longest_common_prefix() {
    let mut root = SuffixTable::new();
    let cp_1 = CompiledPatternBuilder::new()
                .literal("app")
                .build();
    let mut pattern = Pattern::with_random_uuid();
    pattern.set_pattern(cp_1);
    root.insert(pattern);

    assert_eq!("app", root.longest_common_prefix("app42").unwrap().literal());
}