tree f2bf6f27db1f75472057ecdc1eba1bca3d928e56
parent b9e1d4bbd4ce6a539999560c1cc863b645a080cd
author Laslo Hunhold <dev@frign.de> 1669760633 +0100
committer Laslo Hunhold <dev@frign.de> 1669760633 +0100
gpgsig -----BEGIN PGP SIGNATURE-----
 
 iQIzBAABCAAdFiEEZ7KGJhX1XJt/mkfnaVdr0kz8uYAFAmReTeEACgkQaVdr0kz8
 uYCRKw//XBJaRUT8GotZXD7HrQepVdktzzu+swnDQd/U0F7rITg74QwzswWSh+qe
 bTBkrtRZN+l7N5931J3g97+1GG0OGFxlxgHxgnUbwGVI4Hfwj6wSt+FsE/QwmL87
 dNfVu6/wuPWkFCXvqZaLqtd4JTUAuHKBRSJrxIr2v7MooC1R+TgJ8TgXzS0tEMkQ
 tVYB0mFUuMfV9Cb+88J4LlAJ/0eNA6BgCejEUp5KwrPV2ofJQ5XcuN2ZZwe7uyE6
 qV0F6UWeKKf0SIj8GYslTnqFGc3oxGY4g7FReMUPjgvotLrnq+zis3EqjQxKmj0u
 oDjOzKZTX1WVjfWFGhKzs38omUb3/BYo5V6pKpTkUmt8EhArdzddIZMOmOs9EWEo
 SNfFoz5o3qwPpcGASX7i1jtLUiKlXyZjPz9JTwnY5GWpdXeJqChixrYZi5isL3R7
 sd66VaJ6ZyJBAUzcDectSb67cqcQmPf2rijCUenHZu6jE035r2QM7ag9DktI9F6W
 EBD6BoQfnF1PATL4lk7ue5wVqNoxcUQ5NBAEVUrgpqtyOVsfz2TbPvgercz953qH
 yPY56Q4BadZjYdo+kPX2Jjx3G7squodt5aRyhY9hD4hOscJYGKS/dqIeQBQWC+Tb
 0NxkjCj5d4CqGp5oL+WiU5wNUTI3Aizy9lADQW19x8o0ApC57cg=
 =T78E
 -----END PGP SIGNATURE-----

Implement bidirectional bracket support

The single rule N0 in the Unicode Bidirectional Algorithm may not
sound like much, but it packs quite a punch and required some deep
work.

It wasn't exactly made simpler by the fact that the document is very
convoluted and not easy to follow. However, it helps to have experience
from the other algorithms and the automatic tests allow very broad
confirmation of proper function.

In particular, the following changes needed to be made: The generator
had to be modified to

	- Implement a decompositon to match canonically equivalent
	  brackets. This requires us to have UnicodeData.txt present,
	  but what matters is that the end result is fast and small.
	- The LUT-printing automatically detects type, because it's just
	  too fragile otherwise.

The implementation of the algorithm itself had the following changes:

	- The last strong type property of an isolate runner has been
	  refactored to be stateless. Otherwise, you can end up with
	  subtle bugs where strong types are added beforehand, yielding
	  a TOCTOU-problem.
	- The bracket parsing makes use of a novel FIFO structure that
	  combines the best of both worlds between a stack and naive
	  implementation.

As an end result, we now pass all ~900k bidi tests from the Unicode
standard.

Signed-off-by: Laslo Hunhold <dev@frign.de>