1
1
mirror of https://github.com/wez/wezterm.git synced 2024-11-25 21:07:39 +03:00
wezterm/bidi
Jalil David Salamé Messina 191aacc7d7 fix(clippy): Use faster methods on Iterators
- 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.
2023-03-19 07:29:23 -07:00
..
data Add wezterm-bidi crate 2022-01-24 19:29:03 -07:00
examples wezterm: add experimental_bidi config option and very basic bidi 2022-01-25 09:00:53 -07:00
generate Add wezterm-bidi crate 2022-01-24 19:29:03 -07:00
src fix(clippy): Use faster methods on Iterators 2023-03-19 07:29:23 -07:00
tests bidi: move conformance tests to separate file 2022-10-16 21:07:33 -07:00
Cargo.toml env_logger -> 0.10 2022-11-27 21:37:25 -07:00
LICENSE.md Add wezterm-bidi crate 2022-01-24 19:29:03 -07:00
README.md Add wezterm-bidi crate 2022-01-24 19:29:03 -07:00

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.