abbrev-tree 0.1.1

highly inefficient data structure for text completion
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

use abbrev_tree::AbbrevTree;
use std::io::{
    BufRead,
    stdin,
};

fn main() {
    let s = stdin();
    let sl = s.lock();
    let mut t = AbbrevTree::new();

    for line in sl.lines() {
        match line {
            Ok(line) => t.add(&line, ()),
            Err(e) => panic!("{}", e),
        }
    }
    println!("{:?}", t);
}