keymaps 1.2.0

A rust crate which provides a standardized encoding for key codes
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

// keymaps - A rust crate which provides a standardized encoding for key codes
//
// Copyright (C) 2025 Benedikt Peetz <benedikt.peetz@b-peetz.de>
// SPDX-License-Identifier: LGPL-3.0-or-later
//
// This file is part of the keymaps crate.
//
// You should have received a copy of the License along with this program.
// If not, see <https://www.gnu.org/licenses/lgpl-3.0.txt>.

use super::{Node, NodeValue, Trie};

impl<K, V> Trie<K, V>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    pub fn iter(&self) -> NodeIterator<K, V> {
        self.into_iter()
    }
}
impl<'a, K, V> IntoIterator for &'a Trie<K, V>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    type Item = <&'a Node<K, V> as IntoIterator>::Item;

    type IntoIter = <&'a Node<K, V> as IntoIterator>::IntoIter;

    fn into_iter(self) -> Self::IntoIter {
        Node::iter(&self.root)
    }
}

#[derive(Debug)]
#[allow(clippy::module_name_repetitions)]
pub struct NodeIterator<K, V>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    children: Vec<(Vec<K>, V)>,
}

impl<K, V> NodeIterator<K, V>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    pub fn new(root: &Node<K, V>) -> Self {
        let children = extract_child(vec![], root);

        Self { children }
    }
}
impl<K, V> Node<K, V>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    pub fn iter(&self) -> NodeIterator<K, V> {
        NodeIterator::new(self)
    }
}
impl<K, V> IntoIterator for &Node<K, V>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    type Item = (Vec<K>, V);

    type IntoIter = NodeIterator<K, V>;

    fn into_iter(self) -> Self::IntoIter {
        Node::iter(self)
    }
}

fn extract_child<K, V>(current_key: Vec<K>, node: &Node<K, V>) -> Vec<(Vec<K>, V)>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    match &node.value {
        NodeValue::Parent { children } => children
            .iter()
            .flat_map(|(key, value)| {
                let mut new_key = current_key.clone();
                new_key.push(key.to_owned());

                extract_child(new_key, value)
            })
            .collect(),
        NodeValue::Child { value: path } => {
            vec![(current_key, path.to_owned())]
        }
    }
}

impl<K, V> Iterator for NodeIterator<K, V>
where
    K: Clone + Eq + std::hash::Hash + std::fmt::Debug,
    V: Clone + PartialEq + std::fmt::Debug,
{
    type Item = (Vec<K>, V);

    fn next(&mut self) -> Option<Self::Item> {
        self.children.pop()
    }
}