)]}'
{
  "commit": "4082ca2220b5ba910b546afddf7780fc4a51f75a",
  "tree": "5da0e98823fad142b4f5fc160ef173bbc1a546a9",
  "parents": [
    "a036d78d25a61791e6de956a4c77dbe5cd6016c5"
  ],
  "author": {
    "name": "Daiki Ueno",
    "email": "ueno@gnu.org",
    "time": "Sat Oct 19 02:47:04 2024 +0900"
  },
  "committer": {
    "name": "Simon Josefsson",
    "email": "simon@josefsson.org",
    "time": "Fri Jan 31 17:25:23 2025 +0100"
  },
  "message": "asn1_der_decoding2: optimize _asn1_find_up call with node cache\n\nIf we are parsing a sequence or set and the current node is a direct\nchild of it, there is no need to traverse the list back to the\nleftmost one as we have a node cache.\n\nSigned-off-by: Daiki Ueno \u003cueno@gnu.org\u003e\nSigned-off-by: Simon Josefsson \u003csimon@josefsson.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "d2f6deacf5188a997947dca6ce905100adc47a45",
      "old_mode": 33188,
      "old_path": "lib/decoding.c",
      "new_id": "1e0fcb34618d94cb878320a82e407964025f7a7c",
      "new_mode": 33188,
      "new_path": "lib/decoding.c"
    }
  ]
}