)]}'
{
  "commit": "f26cde09ec99085d9df5dc4579c8a4ecd7fd0884",
  "tree": "3246079b6c7db9216df94cb998787b39618a0520",
  "parents": [
    "20dad8b1f066e09a32714c5a62a48ce3a18eac92"
  ],
  "author": {
    "name": "Johnni Winther",
    "email": "johnniwinther@google.com",
    "time": "Wed Mar 29 21:48:23 2023 +0000"
  },
  "committer": {
    "name": "dart-internal-monorepo",
    "email": "dart-internal-monorepo@dart-ci-internal.iam.gserviceaccount.com",
    "time": "Wed Mar 29 14:49:57 2023 -0700"
  },
  "message": "[_fe_analyzer_shared] Add benchmark for exponential exhaustiveness\n\nThe tests in the benchmark show some pitfalls of the exhaustiveness\nchecking algorithm where the witness canodidate count is exponential\nin the size of the user code.\n\nChange-Id: I310c42513bf76c88fed7ffdb5a60c165c089dfa9\nReviewed-on: https://dart-review.googlesource.com/c/sdk/+/291800\nReviewed-by: Paul Berry \u003cpaulberry@google.com\u003e\nReviewed-by: Bob Nystrom \u003crnystrom@google.com\u003e\nCommit-Queue: Johnni Winther \u003cjohnniwinther@google.com\u003e\n\nhttps://dart.googlesource.com/sdk/+/a7205526c430a78e0f379dabe641dadeb6f6c5de\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "4c233cd05fb366dd92fad336693797cba12487a1",
      "old_mode": 33188,
      "old_path": "DEPS",
      "new_id": "dbb7c3f7677be42b003feb1d6c6a2eb696dc6d85",
      "new_mode": 33188,
      "new_path": "DEPS"
    },
    {
      "type": "modify",
      "old_id": "ffc3cfd6aa73c8f91b68c153cafd0bf5bb8698ad",
      "old_mode": 33188,
      "old_path": "commits.json",
      "new_id": "ede4672d9d26f26d6ea5760edb7e6846e9354249",
      "new_mode": 33188,
      "new_path": "commits.json"
    }
  ]
}