Struct Trie

pub struct Trie { /* private fields */ }

Implementations

impl Trie

pub fn new(char_size: usize) -> Self

pub fn with_capacity(char_size: usize, capacity: usize) -> Self

pub fn insert_once_at(&mut self, node: usize, ch: usize) -> usize

Examples found in repository

crates/competitive/src/data_structure/trie.rs (line 43)

    pub fn insert_at<I>(&mut self, mut node: usize, iter: I) -> Vec<usize>
    where
        I: IntoIterator<Item = usize>,
    {
        let mut path = Vec::new();
        for ch in iter.into_iter() {
            path.push(node);
            node = self.insert_once_at(node, ch);
        }
        path.push(node);
        path
    }

pub fn insert_at<I>(&mut self, node: usize, iter: I) -> Vec<usize>

where I: IntoIterator<Item = usize>,

Examples found in repository

crates/competitive/src/data_structure/trie.rs (line 52)

    pub fn insert<I>(&mut self, iter: I) -> Vec<usize>
    where
        I: IntoIterator<Item = usize>,
    {
        self.insert_at(0, iter)
    }

pub fn insert<I>(&mut self, iter: I) -> Vec<usize>

where I: IntoIterator<Item = usize>,

pub fn find_at<I>(&self, node: usize, iter: I) -> Result<usize, usize>

where I: IntoIterator<Item = usize>,

Examples found in repository

crates/competitive/src/data_structure/trie.rs (line 71)

    pub fn find<I>(&self, iter: I) -> Result<usize, usize>
    where
        I: IntoIterator<Item = usize>,
    {
        self.find_at(0, iter)
    }

pub fn find<I>(&self, iter: I) -> Result<usize, usize>

where I: IntoIterator<Item = usize>,

pub fn next_node(&self, node: usize, ch: usize) -> Option<usize>

Examples found in repository

crates/competitive/src/data_structure/trie.rs (line 89)

    pub fn edges(&self) -> Vec<(usize, usize)> {
        let mut edges = Vec::with_capacity(self.node_size - 1);
        let mut stack = vec![0usize];
        while let Some(node) = stack.pop() {
            for ch in (0..self.char_size).rev() {
                if let Some(nnode) = self.next_node(node, ch) {
                    edges.push((node, nnode));
                    stack.push(nnode);
                }
            }
        }
        edges
    }

pub fn node_size(&self) -> usize

pub fn edges(&self) -> Vec<(usize, usize)>

pub fn build_failure<M>(&mut self, dp: &mut [M::T])

where M: Monoid,

Trait Implementations

impl Clone for Trie

fn clone(&self) -> Trie

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Trie

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.