ucharsetversion Documentation on ocaml.org

Character classes for Unicode-aware lexers and regex engines

A faster, smaller Set.Make(Uchar). Cost follows the run count, not the cardinal: the Alphabetic property is 147,421 codepoints in 761 runs, held in 12KB against 5.6MB, and the whole codespace is 40 bytes against 42.4MB. Alongside the usual set algebra there is a builder for accumulating a class from many fragments, a compiled two-level bitmap trie for membership in an inner loop, partition refinement for derivative classes during DFA construction, and a stable packed encoding for embedding generated tables in source. Surrogates are excluded by construction.

Tags unicode charset codepoint interval set regex lexer dfa
AuthorMichael Thomas <mthomas180@gmail.com>
LicenseMIT
Published
Homepagehttps://github.com/enetsee/ucharset
Issue Trackerhttps://github.com/enetsee/ucharset/issues
Documentationhttps://enetsee.github.io/ucharset/
MaintainerMichael Thomas <mthomas180@gmail.com>
Availablearch != "x86_32" & arch != "arm32"
Dependencies
Source [http] https://github.com/enetsee/ucharset/releases/download/v0.2.0/ucharset-0.2.0.tbz
sha256=876c0c73aa90c5c4f3a12bea3edbafef5dc5ff99026748b9496a240721007781
sha512=94e6dc376008cf7556126b6f12e8106359921b94df410e4b89cb2423e4f7e20ab58fb011b44054d31ad867972701bddcd13f11f3496075ac37c6c7b6a536e189
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/ucharset/ucharset.0.2.0/opam
No package is dependent