- From: Nat McCully via GitHub <sysbot+gh@w3.org>
- Date: Wed, 31 Aug 2022 00:03:27 +0000
- To: public-i18n-archive@w3.org
> @macnmm , could you help me understanding the nature of the complexity a bit more in details? When composing ruby and base text, you first determine if the ruby is wider than the base text, and then whether or not the wide ruby is allowed to overhang the adjacent characters, to determine the final width of the base text/ruby combination. In addition, the positioning of the ruby above the base text is determined (kata-tsuki, etc). Knowing the final width, each completed block is then able to be put into the growing line width to find the line maximum. When the above calculations have to be redone for a given block/word when the ruby run is broken across lines, i.e. the width of the combination grows or shrinks, or the positioning of the ruby changes, or both, then you must do that calculation in the same step in anticipation of the possible line breaks. Paragraph composition is especially so, since it is done by pre-calculating all line breaks for the paragraph and choosing the best overall path for the best average color (=character and word spacing). -- GitHub Notification of comment by macnmm Please view or discuss this issue at https://github.com/w3c/jlreq-d/issues/19#issuecomment-1232293435 using your GitHub account -- Sent via github-notify-ml as configured in https://github.com/w3c/github-notify-ml-config
Received on Wednesday, 31 August 2022 00:03:28 UTC