redirectionio 3.1.0

Redirection IO Library to handle matching rule, redirect and filtering headers and body.
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

use std::collections::hash_map::{Values, ValuesMut};

use crate::regex_radix_tree::item::Item;

pub struct ItemIter<'a, V> {
    pub(crate) children: &'a [Item<V>],
    pub(crate) parent: Option<Box<ItemIter<'a, V>>>,
    pub(crate) values: Option<Values<'a, String, V>>,
}

pub struct ItemIterMut<'a, V> {
    pub(crate) children: &'a mut [Item<V>],
    pub(crate) parent: Option<Box<ItemIterMut<'a, V>>>,
    pub(crate) values: Option<ValuesMut<'a, String, V>>,
}

impl<It> Default for ItemIter<'_, It> {
    fn default() -> Self {
        ItemIter {
            children: &[],
            parent: None,
            values: None,
        }
    }
}

impl<It> Default for ItemIterMut<'_, It> {
    fn default() -> Self {
        ItemIterMut {
            children: &mut [],
            parent: None,
            values: None,
        }
    }
}

impl<'a, V> Iterator for ItemIter<'a, V> {
    type Item = &'a V;

    fn next(&mut self) -> Option<Self::Item> {
        match &mut self.values {
            None => match self.children.first() {
                None => match self.parent.take() {
                    Some(parent) => {
                        // continue with the parent node
                        *self = *parent;
                        self.next()
                    }
                    None => None,
                },
                Some(Item::Empty(_)) => {
                    self.children = &self.children[1..];
                    self.next()
                }
                Some(Item::Leaf(item)) => {
                    self.children = &self.children[1..];
                    self.values = Some(item.values.values());

                    self.next()
                }
                Some(Item::Node(children)) => {
                    self.children = &self.children[1..];

                    // start iterating the child trees
                    *self = ItemIter {
                        children: children.children.as_slice(),
                        parent: Some(Box::new(std::mem::take(self))),
                        values: None,
                    };

                    self.next()
                }
            },
            Some(values) => match values.next() {
                None => {
                    self.values = None;
                    self.next()
                }
                Some(value) => Some(value),
            },
        }
    }
}

impl<'a, V> Iterator for ItemIterMut<'a, V> {
    type Item = &'a mut V;

    fn next(&mut self) -> Option<Self::Item> {
        match &mut self.values {
            None => {
                let children = std::mem::take(&mut self.children);

                match children.split_first_mut() {
                    None => match self.parent.take() {
                        Some(parent) => {
                            // continue with the parent node
                            *self = *parent;
                            self.next()
                        }
                        None => None,
                    },
                    Some((Item::Empty(_), children)) => {
                        self.children = children;
                        self.next()
                    }
                    Some((Item::Leaf(item), children)) => {
                        self.children = children;
                        self.values = Some(item.values.values_mut());

                        self.next()
                    }
                    Some((Item::Node(item), children)) => {
                        self.children = children;

                        // start iterating the child trees
                        *self = ItemIterMut {
                            children: item.children.as_mut_slice(),
                            parent: Some(Box::new(std::mem::take(self))),
                            values: None,
                        };

                        self.next()
                    }
                }
            }
            Some(values) => match values.next() {
                None => {
                    self.values = None;
                    self.next()
                }
                Some(value) => Some(value),
            },
        }
    }
}