wayfind 0.9.1

A speedy, flexible router.
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

use crate::node::Node;

/// Precomputed path length bounds for pruning during search.
#[derive(Clone, Debug)]
pub(crate) struct Bounds {
    /// Minimum remaining path bytes to reach any match.
    shortest: usize,
    /// Maximum remaining path bytes that could still match.
    longest: usize,
}

impl Default for Bounds {
    fn default() -> Self {
        Self {
            shortest: usize::MAX,
            longest: 0,
        }
    }
}

impl Bounds {
    pub(crate) fn new<S, T>(node: &Node<S, T>) -> Self {
        Self {
            shortest: Self::compute_shortest(node),
            longest: Self::compute_longest(node),
        }
    }

    pub(crate) const fn shortest(&self) -> usize {
        self.shortest
    }

    pub(crate) const fn longest(&self) -> usize {
        self.longest
    }

    fn compute_shortest<S, T>(node: &Node<S, T>) -> usize {
        // A node with data can match here with 0 remaining bytes.
        if node.data.is_some() {
            return 0;
        }

        // An end-wildcard needs at least 1 byte.
        if node.end_wildcard.is_some() {
            return 1;
        }

        let mut shortest = usize::MAX;

        for child in &node.static_children {
            let length = child
                .state
                .prefix
                .len()
                .saturating_add(child.bounds.shortest);

            shortest = shortest.min(length);
        }

        for child in &node.dynamic_children {
            let length = child.bounds.shortest.saturating_add(1);
            shortest = shortest.min(length);
        }

        for child in &node.wildcard_children {
            let length = child.bounds.shortest.saturating_add(1);
            shortest = shortest.min(length);
        }

        shortest
    }

    fn compute_longest<S, T>(node: &Node<S, T>) -> usize {
        // Dynamic and wildcard parameters can consume any input.
        if !node.dynamic_children.is_empty()
            || !node.wildcard_children.is_empty()
            || node.end_wildcard.is_some()
        {
            return usize::MAX;
        }

        let mut longest = 0;

        for child in &node.static_children {
            let length = child
                .state
                .prefix
                .len()
                .saturating_add(child.bounds.longest);

            longest = longest.max(length);
        }

        longest
    }
}