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 |
|---|---|
| Author | Michael Thomas <mthomas180@gmail.com> |
| License | MIT |
| Published | |
| Homepage | https://github.com/enetsee/ucharset |
| Issue Tracker | https://github.com/enetsee/ucharset/issues |
| Documentation | https://enetsee.github.io/ucharset/ |
| Maintainer | Michael Thomas <mthomas180@gmail.com> |
| Dependencies |
|
| Source [http] | https://github.com/enetsee/ucharset/releases/download/v0.1.0/ucharset-0.1.0.tbz sha256=2f91039a754ba7030ad94c930903936a1df03683123f1e433ef5bb2878a8a388 sha512=cdc19455b6f8d38b9c93efe8be0b631fca4274970d1995511d280169e2524ff579ee8133c3b1f686a705d869247ebac145944ebab3d8ec071cf2d9dff15afbc1 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/ucharset/ucharset.0.1.0/opam |
No package is dependent


