You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Zero-allocation text layout engine for the web. Prefix-sum binary search line breaking, perfect hash glyph lookup, arena-pooled memory — sub-microsecond hot layouts with zero GC pressure.
Host-neutral terminal-cell text layout primitives for TUIs, CLIs, log viewers, transcripts, and editor panes — prepare once, seek rows by range, materialize only the viewport
A pure C# implementation of the Unicode Line Breaking Algorithm (UAX #14) for .NET 10, conforming to Unicode 17.0.0. Zero managed allocation, Native AOT, a source-generated trie. Verified against the official LineBreakTest.txt: every one of 19338 cases exact on UTF-16 and UTF-8. 62 tests.
A Prolog implementation of line breaking for short Russian texts. A word-token list is split into lines of bounded width by minimizing a total penalty over linguistic and typographic rules, following the TeX line-breaking algorithm (Knuth-Plass). An equivalent Python version and a 52-respondent readability survey are included for comparison.