[go: up one dir, main page]

fst 0.1.9

Use finite state transducers to compactly represents sets or maps of many strings (> 1 billion is possible).
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

use std::error;
use std::fmt;

/// An error that occurred while building a Levenshtein automaton.
#[derive(Debug)]
pub enum Error {
    /// If construction of the automaton reaches some hard-coded limit
    /// on the number of states, then this error is returned.
    ///
    /// The number given is the limit that was exceeded.
    TooManyStates(usize),
}

impl fmt::Display for Error {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        use self::Error::*;
        match *self {
            TooManyStates(size_limit) => {
                write!(f, "Levenshtein automaton exceeds size limit of \
                           {} states", size_limit)
            }
        }
    }
}

impl error::Error for Error {
    fn description(&self) -> &str {
        use self::Error::*;
        match *self {
            TooManyStates(_) => "levenshtein automaton has too many states",
        }
    }

    fn cause(&self) -> Option<&error::Error> {
        None
    }
}