#unicode #canonical #class #no-std #combining

no-std unicode-canonical-combining-class

Fast lookup of the Canonical Combining Class property

5 releases (breaking)

new 0.5.0 Sep 19, 2022
0.4.0 Jul 14, 2022
0.3.0 Jul 6, 2022
0.2.0 Jan 25, 2022
0.1.0 Jun 4, 2021

#411 in Text processing

Download history 283/week @ 2022-06-02 408/week @ 2022-06-09 243/week @ 2022-06-16 278/week @ 2022-06-23 339/week @ 2022-06-30 436/week @ 2022-07-07 183/week @ 2022-07-14 341/week @ 2022-07-21 326/week @ 2022-07-28 324/week @ 2022-08-04 192/week @ 2022-08-11 156/week @ 2022-08-18 179/week @ 2022-08-25 176/week @ 2022-09-01 230/week @ 2022-09-08 207/week @ 2022-09-15

798 downloads per month
Used in 4 crates (2 directly)

Apache-2.0

48KB
932 lines

unicode-canonical-combining-class


Fast lookup of the Unicode Canonical Combining Class property for char in Rust using Unicode 15.0 data. This crate is no-std compatible.

Usage

use unicode_canonical_combining_class::{get_canonical_combining_class, CanonicalCombiningClass};

fn main() {
    assert_eq!(get_canonical_combining_class(''), CanonicalCombiningClass::CCC129);
}

Performance & Implementation Notes

ucd-generate is used to generate tables.rs. A build script (build.rs) compiles this into a two level look up table. The look up time is constant as it is just indexing into two arrays.

The two level approach maps a code point to a block, then to a position within a block. This allows the second level block to be deduplicated, saving space. The code is parameterised over the block size, which must be a power of 2. The value in the build script is optimal for the data set.

This approach trades off some space for faster lookups. The tables take up about 24.5KiB. Benchmarks showed this approach to be ~5–10× faster than the typical binary search approach.

It's possible there are further optimisations that could be made to eliminate some runs of repeated values in the first level array.

No runtime deps