tklog 0.3.0

Lightweight and efficient rust structured log library with support for log level, file shred, compressed archive
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

// Copyright (c) 2024, donnie4w <donnie4w@gmail.com>
// All rights reserved.
// https://github.com/donnie4w/tklog
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

use std::collections::HashMap;

struct TrieNode<V> {
    children: HashMap<String, TrieNode<V>>,
    module: Option<V>,
}

impl<V> TrieNode<V> {
    fn new() -> Self {
        TrieNode {
            children: HashMap::new(),
            module: None,
        }
    }
}

pub struct Trie<V> {
    root: TrieNode<V>,
    count: i32,
    cache: HashMap<String, Option<V>>, 
}

impl<V: Clone> Trie<V> {
    pub fn new() -> Self {
        Trie {
            root: TrieNode::new(),
            count: 0,
            cache: HashMap::new(),  
        }
    }

    pub fn len(&self) -> i32 {
        self.count
    }

    pub fn insert(&mut self, pattern: &str, module: V) {
        let segments: Vec<&str> = pattern.split("::").collect();
        let mut node = &mut self.root;
        for segment in segments {
            node = node.children.entry(segment.to_string()).or_insert_with(TrieNode::new);
        }
        node.module = Some(module);
        self.count += 1;
    }

    pub fn get(&mut self, input: &str) -> Option<&V> {
        if self.cache.contains_key(input) {
            return  self.cache.get(input).and_then(|opt|opt.as_ref());
        }
        let segments: Vec<&str> = input.split("::").collect();
        let mut node = &self.root;
        let mut last_matched_module: Option<&V> = None;
        for segment in segments {
            if let Some(child) = node.children.get("*") {
                if let Some(ref module) = child.module {
                    last_matched_module = Some(module);
                }
            }
            if let Some(child) = node.children.get(segment) {
                node = child;
                if let Some(ref module) = node.module {
                    last_matched_module = Some(module);
                }
            } else {
                break;
            }
        }
        if let Some(v) = last_matched_module {
            self.cache.insert(input.to_string(), Some(v.clone()));
        }
        self.cache.get(input).and_then(|opt| opt.as_ref())
    }
}