Struct transition_table::Entry

pub struct Entry<K, V> { /* private fields */ }

Trie generator.

const KEYWORDS: [(&'static str, i8); 3] = [
    ("A", 1),
    ("BB", 2),
    ("BBC", 3),
];

let tree = Entry::<char, _>::new(KEYWORDS.iter());
let tbl: Vec<Transition<_, _, _>> = tree.into();
let mut it = tbl.iter();

assert_eq!(it.next().unwrap(), &('C', 0usize, 0usize, 2usize));
assert_eq!(it.next().unwrap(), &('B', 0usize, 1usize, 1usize));
assert_eq!(it.next().unwrap(), &('A', 0usize, 0usize, 0usize));
assert_eq!(it.next().unwrap(), &('B', 1usize, 2usize, !0usize));
assert_eq!(it.next().unwrap(), &('\u{0}', 2usize, 4usize, !0usize));
assert!(it.next().is_none());

Implementations

impl Entry<char, usize>

pub fn new<'a, I, S, V>(src: I) -> Self where
    I: Iterator<Item = &'a (S, V)>,
    S: 'a + AsRef<str>,
    V: 'a, 

Reading const array, then creating tree structure to generate trie.

impl Entry<u8, usize>

pub fn new<'a, I, S, V>(src: I) -> Self where
    I: Iterator<Item = &'a (S, V)>,
    S: 'a + AsRef<str>,
    V: 'a, 

Reading const array, then creating tree structure to generate trie.

impl<K, V> Entry<K, V> where
    K: Copy + Ord,
    V: Optional, 

pub fn push<I>(&mut self, key: I, v: V::Inner) where
    I: IntoIterator<Item = K>, 

Pushing a single entry.

pub fn push_to(
    &self,
    tbl: &mut Vec<Transition<K, usize, V>>
) -> Transition<K, usize, V>

Generating trie.

Trait Implementations

impl<K, V> Default for Entry<K, V> where
    K: Default,
    V: Optional, 

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> Into<Vec<(K, usize, usize, V), Global>> for Entry<K, V> where
    K: Copy + Ord,
    V: Optional, 

fn into(self) -> Vec<Transition<K, usize, V>>

Performs the conversion.