-
Notifications
You must be signed in to change notification settings - Fork 34
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement N0: Process bracket pairs #3
Comments
@mbrubeck , Step N0 has step BD16 as it's first step. Has this step been implemented already or will this have to be done as well? |
BD16 has not been implemented, and will need to be implemented as part of this fix. |
Ok. We'll implement BD16 as well. Thanks @mbrubeck |
@mbrubeck, to implement BD16, I will need 'pairValues: - unique ID for the pair (or set) of canonically matched brackets' and 'pairTypes: - array of paired bracket type values for each character' where will I find these lists / arrays? |
The pairTypes and pairValues arrays can be generated by looking up each input character in a table based on: http://www.unicode.org/Public/UNIDATA/BidiBrackets.txt (Let me know if you'd like any help converting this text file into a Rust-friendly array. The file is simple enough that it could be done either by a script or by hand.) This table lists bracket characters in pairs; each pair has an "open" character and a "close" character. We can assign an arbitrary unique number to each pair; for example it could be the row number where the "open" character is found. If the input character at index |
@mbrubeck , I'm still working on implementing N0, and I would like some help in converting the test cases to a Rust Table. |
Okay, I will work on that tomorrow. |
Thanks Matt!
|
https://github.com/mbrubeck/unicode-bidi/blob/brackets/src/brackets.rs contains a Rust module with the table of paired bracket characters. You can merge from my branch into yours if you want to use this code in your branch. |
Thanks @mbrubeck. |
I'm working on this |
In the
resolve_neutral
function, implement step N0: Process bracket pairs in an isolating run sequence.There are test cases for this in BidiCharacterTest.txt (see issue #1).
The text was updated successfully, but these errors were encountered: