ucd-generate 0.2.2

A program for generating packed representations of the Unicode character database that can be efficiently searched. 
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78

use std::collections::{BTreeMap, BTreeSet};

use ucd_parse::{self, GraphemeClusterBreak, SentenceBreak, WordBreak};

use args::ArgMatches;
use error::Result;

pub fn grapheme_cluster(args: ArgMatches) -> Result<()> {
    let ucd_dir = args.ucd_dir()?;
    let vals: Vec<GraphemeClusterBreak> = ucd_parse::parse(&ucd_dir)?;

    let mut byval: BTreeMap<String, BTreeSet<u32>> = BTreeMap::new();
    for x in &vals {
        byval
            .entry(x.value.clone())
            .or_insert(BTreeSet::new())
            .extend(x.codepoints.into_iter().map(|c| c.value()));
    }

    let mut wtr = args.writer("grapheme_cluster_break")?;
    if args.is_present("enum") {
        wtr.ranges_to_enum(args.name(), &byval)?;
    } else {
        wtr.names(byval.keys())?;
        for (val, set) in byval {
            wtr.ranges(&val, &set)?;
        }
    }
    Ok(())
}

pub fn word(args: ArgMatches) -> Result<()> {
    let ucd_dir = args.ucd_dir()?;
    let vals: Vec<WordBreak> = ucd_parse::parse(&ucd_dir)?;

    let mut byval: BTreeMap<String, BTreeSet<u32>> = BTreeMap::new();
    for x in &vals {
        byval
            .entry(x.value.clone())
            .or_insert(BTreeSet::new())
            .extend(x.codepoints.into_iter().map(|c| c.value()));
    }

    let mut wtr = args.writer("word_break")?;
    if args.is_present("enum") {
        wtr.ranges_to_enum(args.name(), &byval)?;
    } else {
        wtr.names(byval.keys())?;
        for (val, set) in byval {
            wtr.ranges(&val, &set)?;
        }
    }
    Ok(())
}

pub fn sentence(args: ArgMatches) -> Result<()> {
    let ucd_dir = args.ucd_dir()?;
    let vals: Vec<SentenceBreak> = ucd_parse::parse(&ucd_dir)?;

    let mut byval: BTreeMap<String, BTreeSet<u32>> = BTreeMap::new();
    for x in &vals {
        byval
            .entry(x.value.clone())
            .or_insert(BTreeSet::new())
            .extend(x.codepoints.into_iter().map(|c| c.value()));
    }

    let mut wtr = args.writer("sentence_break")?;
    if args.is_present("enum") {
        wtr.ranges_to_enum(args.name(), &byval)?;
    } else {
        wtr.names(byval.keys())?;
        for (val, set) in byval {
            wtr.ranges(&val, &set)?;
        }
    }
    Ok(())
}