mirror of
https://github.com/wez/wezterm.git
synced 2024-11-23 06:54:45 +03:00
191aacc7d7
- Use `find` instead of `position(..).next()` - Use `any` instead of `position(..).next().is_some()/.is_none()` - Use `first/next` instead of `get(0)/nth(0)` - Prefer `for` loops over `while let` loops on iterators May improve performance. |
||
---|---|---|
.. | ||
data | ||
examples | ||
generate | ||
src | ||
tests | ||
Cargo.toml | ||
LICENSE.md | ||
README.md |
wezterm-bidi - a pure Rust bidi implementation
This crate provides an implementation of the The Unicode Bidirectional Algorithm (UBA) in Rust.
This crate was developed for use in wezterm but does not depend on other code in wezterm.
The focus for this crate is conformance.
Status
This crate resolves embedding levels and can reorder line ranges.
The implementation conformant with 100% of the BidiTest.txt and BidiCharacterTest.txt test cases (approx 780,000 test cases).
License
MIT compatible License Copyright © 2022-Present Wez Furlong.
Portions of the code in this crate were derived from the bidiref reference implementation of the UBA which is:
Copyright © 1991-2022 Unicode, Inc. All rights reserved.
See LICENSE.md for the full text of the license.