Struct RiRadixTree

Source

pub struct RiRadixTree { /* private fields */ }

Expand description

A Radix Tree for efficient route matching.

This implementation provides O(k) lookup time where k is the path length, making it significantly faster than linear search for large numbers of routes.

Implementations§

Source §

impl RiRadixTree

Source

pub fn new() -> Self

Creates a new empty radix tree.

§Returns

A new RiRadixTree instance

Source

pub fn parse_path(path: &str) -> Vec<PathSegment>

Parses a path into segments.

§Parameters

path: The path to parse

§Returns

A vector of PathSegment instances

Source

pub fn insert(&self, route: RiRoute)

Inserts a route into the tree.

§Parameters

route: The route to insert

Source

pub fn find(&self, path: &str) -> Option<RouteMatch>

Finds a matching route for the given path.

§Parameters

path: The path to match

§Returns

An Option<RouteMatch> containing the matched route and extracted parameters

Source

pub fn remove(&self, path: &str) -> bool

Removes a route from the tree.

§Parameters

path: The path of the route to remove

§Returns

true if the route was removed, false if it wasn’t found

Source

pub fn route_count(&self) -> usize

Returns the number of routes in the tree.

§Returns

The number of routes

Source

pub fn clear(&self)

Clears all routes from the tree.

Trait Implementations§

Source §

impl Default for RiRadixTree

Source §

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl UnwindSafe for RiRadixTree

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more

§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §