Struct matchit::Node

pub struct Node<V> { /* fields omitted */ }

A node in radix tree ordered by priority.

Priority is just the number of values registered in sub nodes (children, grandchildren, and so on..).

Implementations

impl<V> Node<V>

pub fn insert(&mut self, path: &str, value: V)

Insert a Node with the given value to the path.

pub fn match_path(&self, path: &str) -> Result<Match<'_, V>, bool>

Returns the value registered with the given path. If no value can be found, an Err(bool) is returned which represents a TSR (trailing slash redirect) recommendation.

let mut matcher = Node::default();
matcher.insert("/home", "Welcome!");

if let Err(matched) = matcher.match_path("/home/") {
    assert_eq!(matched, true);
}

pub fn find_case_insensitive_path(
    &self,
    path: &str,
    fix_trailing_slash: bool
) -> Option<String>

Makes a case-insensitive match of the given path and tries to find a handler. It can optionally also fix trailing slashes. It returns the case-corrected path and a bool indicating whether the match was successful.

let mut matcher = Node::default();
matcher.insert("/home", "Welcome!");

let path = matcher.find_case_insensitive_path("/HoMe/", true).unwrap();
assert_eq!(path, "/home");

Trait Implementations

impl<V> Default for Node<V>

pub fn default() -> Self

Returns the "default value" for a type.