ucd-generate 0.2.1

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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138

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

use regex_automata::{dense, RegexBuilder};

pub fn command_dfa(args: ArgMatches) -> Result<()> {
    let mut wtr = args.dfa_writer(args.name())?;
    let pattern = match args.value_of("pattern") {
        None => return err!("missing regex pattern"),
        Some(pattern) => pattern,
    };

    let dfa = dfa_builder(&args).build(&pattern)?;
    if args.is_present("sparse") {
        match state_size(&args) {
            1 => {
                let dfa = dfa.to_u8()?.to_sparse()?;
                wtr.sparse_dfa(args.name(), &dfa)?;
            }
            2 => {
                let dfa = dfa.to_u16()?.to_sparse()?;
                wtr.sparse_dfa(args.name(), &dfa)?;
            }
            4 => {
                let dfa = dfa.to_u32()?.to_sparse()?;
                wtr.sparse_dfa(args.name(), &dfa)?;
            }
            8 => {
                let dfa = dfa.to_u64()?.to_sparse()?;
                wtr.sparse_dfa(args.name(), &dfa)?;
            }
            _ => unreachable!(),
        }
    } else {
        match state_size(&args) {
            1 => {
                let dfa = dfa.to_u8()?;
                wtr.dense_dfa(args.name(), &dfa)?;
            }
            2 => {
                let dfa = dfa.to_u16()?;
                wtr.dense_dfa(args.name(), &dfa)?;
            }
            4 => {
                let dfa = dfa.to_u32()?;
                wtr.dense_dfa(args.name(), &dfa)?;
            }
            8 => {
                let dfa = dfa.to_u64()?;
                wtr.dense_dfa(args.name(), &dfa)?;
            }
            _ => unreachable!(),
        }
    }
    Ok(())
}

pub fn command_regex(args: ArgMatches) -> Result<()> {
    let mut wtr = args.dfa_writer(args.name())?;
    let pattern = match args.value_of("pattern") {
        None => return err!("missing regex pattern"),
        Some(pattern) => pattern,
    };

    let builder = regex_builder(&args);
    if args.is_present("sparse") {
        match state_size(&args) {
            1 => {
                let re = builder.build_with_size_sparse::<u8>(&pattern)?;
                wtr.sparse_regex(args.name(), &re)?;
            }
            2 => {
                let re = builder.build_with_size_sparse::<u16>(&pattern)?;
                wtr.sparse_regex(args.name(), &re)?;
            }
            4 => {
                let re = builder.build_with_size_sparse::<u32>(&pattern)?;
                wtr.sparse_regex(args.name(), &re)?;
            }
            8 => {
                let re = builder.build_with_size_sparse::<u64>(&pattern)?;
                wtr.sparse_regex(args.name(), &re)?;
            }
            _ => unreachable!(),
        }
    } else {
        match state_size(&args) {
            1 => {
                let re = builder.build_with_size::<u8>(&pattern)?;
                wtr.dense_regex(args.name(), &re)?;
            }
            2 => {
                let re = builder.build_with_size::<u16>(&pattern)?;
                wtr.dense_regex(args.name(), &re)?;
            }
            4 => {
                let re = builder.build_with_size::<u32>(&pattern)?;
                wtr.dense_regex(args.name(), &re)?;
            }
            8 => {
                let re = builder.build_with_size::<u64>(&pattern)?;
                wtr.dense_regex(args.name(), &re)?;
            }
            _ => unreachable!(),
        }
    }
    Ok(())
}

fn regex_builder(args: &ArgMatches) -> RegexBuilder {
    let mut builder = RegexBuilder::new();
    builder
        .minimize(args.is_present("minimize"))
        .anchored(args.is_present("anchored"))
        .byte_classes(args.is_present("classes"))
        .premultiply(args.is_present("premultiply"))
        .allow_invalid_utf8(args.is_present("no-utf8"));
    builder
}

fn dfa_builder(args: &ArgMatches) -> dense::Builder {
    let mut builder = dense::Builder::new();
    builder
        .minimize(args.is_present("minimize"))
        .anchored(args.is_present("anchored"))
        .byte_classes(args.is_present("classes"))
        .premultiply(args.is_present("premultiply"))
        .allow_invalid_utf8(args.is_present("no-utf8"))
        .longest_match(args.is_present("longest"))
        .reverse(args.is_present("reverse"));
    builder
}

fn state_size(args: &ArgMatches) -> u8 {
    // These unwraps are OK because clap should verify that there exists a
    // value and it must be 1, 2, 4 or 8.
    args.value_of("state-size").unwrap().parse().unwrap()
}