fst 0.1.0

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

#![feature(test)]

extern crate fst;
extern crate test;

use fst::raw::{Builder, Fst};
use test::Bencher;

const WORDS: &'static str = include_str!("./../data/words-10000");

fn get_words() -> Vec<String> {
    WORDS.lines().map(|s| s.to_owned()).collect()
}

#[bench]
fn search_fst_one(b: &mut Bencher) {
    let words = get_words();
    let mut bfst = Builder::memory();
    for word in &words {
        bfst.add(word).unwrap();
    }
    let fst = Fst::from_bytes(bfst.into_inner().unwrap()).unwrap();
    let mut i = 0;
    b.iter(|| {
        i = (i + 1) % words.len();
        assert!(fst.find(&words[i]).is_some());
    })
}