)]}'
{
  "commit": "6769c08f08ab6bb86301f941028641e6314b8e9e",
  "tree": "97e6d10d24d7d17be0997236585a09fa1f5e9231",
  "parents": [
    "c031ada2cb11489c032f6ddd84fa7091efe6c784"
  ],
  "author": {
    "name": "Laslo Hunhold",
    "email": "dev@frign.de",
    "time": "Sat Oct 29 01:11:48 2022 +0200"
  },
  "committer": {
    "name": "Laslo Hunhold",
    "email": "dev@frign.de",
    "time": "Sat Oct 29 01:11:48 2022 +0200"
  },
  "message": "Add bracket-pair-parsing and refactor bidi-state-management\n\nAs announced, to fully implement the bidirectional algorithm, it\nis still necessary to implement rule N0 which requires access to the\nbracket properties of each character. Inspired by how we solved it\nin gen/case.h we go with a bitwise-approach.\n\nRegarding the state-management, it\u0027s a difficult balance between\ntype-safety, readability and correctness, but I went with the approach\nthat offered the least redundancy and relatively good readability.\n\nSigned-off-by: Laslo Hunhold \u003cdev@frign.de\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "e4070b71c23bf222d30a0ebfb94e2344fe2b2d04",
      "old_mode": 33188,
      "old_path": "gen/bidirectional.c",
      "new_id": "1b512009d59e8b491021b59e2b6dcc5e84bbcd89",
      "new_mode": 33188,
      "new_path": "gen/bidirectional.c"
    },
    {
      "type": "modify",
      "old_id": "752fc6a46c531fdb38437b3318a23338255515b7",
      "old_mode": 33188,
      "old_path": "src/bidirectional.c",
      "new_id": "b98c6104304ea14425c50a1a8dfd858520c95869",
      "new_mode": 33188,
      "new_path": "src/bidirectional.c"
    }
  ]
}