ucd-generate 0.2.13

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

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

use ucd_parse::{self, UnicodeData};

use crate::args::ArgMatches;
use crate::error::Result;
use crate::util::{print_property_values, PropertyValues};

pub fn command(args: ArgMatches<'_>) -> Result<()> {
    let dir = args.ucd_dir()?;
    let propvals = PropertyValues::from_ucd_dir(&dir)?;
    let rows: Vec<UnicodeData> = ucd_parse::parse(&dir)?;
    let ccc_name = |ccc: u8| {
        propvals.canonical("canonicalcombiningclass", &ccc.to_string())
    };

    // If we were tasked with listing the available categories, then do that
    // and quit.
    if args.is_present("list-classes") {
        return print_property_values(&propvals, "Canonical_Combining_Class");
    }

    // Collect each canonical combining class into an ordered set.
    let mut name_map: BTreeMap<isize, String> = BTreeMap::new();
    let mut by_name: BTreeMap<String, BTreeSet<u32>> = BTreeMap::new();
    let mut assigned = BTreeSet::new();
    for row in rows {
        assigned.insert(row.codepoint.value());
        let ccc_value = row.canonical_combining_class;
        let ccc_name = ccc_name(ccc_value)?;
        name_map.entry(ccc_value as isize).or_insert_with(|| ccc_name.clone());
        by_name
            .entry(ccc_name)
            .or_insert(BTreeSet::new())
            .insert(row.codepoint.value());
    }

    // Process the codepoints that are not listed as per the note in
    // DerivedCombiningClass.txt (UCD 13.0):
    //
    // - All code points not explicitly listed for Canonical_Combining_Class
    //   have the value Not_Reordered (0).
    let not_reordered_name = ccc_name(0)?;
    for cp in 0..=0x10FFFF {
        if !assigned.contains(&cp) {
            by_name.get_mut(&not_reordered_name).unwrap().insert(cp);
        }
    }

    let mut wtr = args.writer("canonical_combining_class")?;
    if args.is_present("enum") {
        wtr.ranges_to_enum(args.name(), &by_name)?;
    } else if args.is_present("rust-enum") {
        wtr.ranges_to_rust_enum_with_custom_discriminants(
            args.name(),
            &name_map,
            &by_name,
        )?;
    } else {
        wtr.names(by_name.keys())?;
        for (name, set) in by_name {
            wtr.ranges(&name, &set)?;
        }
    }

    Ok(())
}