)]}'
{
  "commit": "8ac3e566eda3f968966fbe712be5c9158b04d0c3",
  "tree": "87087014d39a6f00788c4868ebd16f9e3fcfebb6",
  "parents": [
    "4a472882b3e35a630922279579201ae6fcbeb081"
  ],
  "author": {
    "name": "Lorenz Brun",
    "email": "lorenz@monogon.tech",
    "time": "Wed May 29 14:16:27 2024 +0000"
  },
  "committer": {
    "name": "Lorenz Brun",
    "email": "lorenz@monogon.tech",
    "time": "Thu Jun 20 12:04:53 2024 +0000"
  },
  "message": "g/a/toposort: add deterministic version\n\nAdds a slower, but deterministic version of TopologicalOrder. To make\nimplementation easier, the visit recursive function is slightly\nrefactored.\nBoth implementations look very similar, but it adds more lines to keep a\ncommon implementation versus just having two separate functions.\n\nChange-Id: Ife4cbda128cf476005b75e216352b522b949d6a2\nReviewed-on: https://review.monogon.dev/c/monogon/+/3137\nReviewed-by: Serge Bazanski \u003cserge@monogon.tech\u003e\nTested-by: Jenkins CI\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "0f395128c268c6d119d7adfa74d85a5f6fb59698",
      "old_mode": 33188,
      "old_path": "go/algorithm/toposort/toposort.go",
      "new_id": "07ee267188720dfc853765448eca5cb3128abb70",
      "new_mode": 33188,
      "new_path": "go/algorithm/toposort/toposort.go"
    },
    {
      "type": "modify",
      "old_id": "09851e229f359bc5f75def6c438f1170a0c6c910",
      "old_mode": 33188,
      "old_path": "go/algorithm/toposort/toposort_test.go",
      "new_id": "e2ab8e763a66a2733c6e70476da86e18aa9d23ed",
      "new_mode": 33188,
      "new_path": "go/algorithm/toposort/toposort_test.go"
    }
  ]
}