)]}'
{
  "commit": "021f92a757002fcdba6a73154ed46a203d3a56b8",
  "tree": "37a7107eb59f8d936708c2a1faef2627fe923fc7",
  "parents": [
    "c1d23cac856c475ce3a5baad5bf78b69c31bbbbf"
  ],
  "author": {
    "name": "alister-chowdhury",
    "email": "30833607+alister-chowdhury@users.noreply.github.com",
    "time": "Sat Oct 18 09:41:34 2025 +0100"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Sat Oct 18 09:41:34 2025 +0100"
  },
  "message": "Adding folding rules for commutive bitwise operations (xor/or/and). (#6358)\n\nThis change adds the following reassociations:\n\n* `A | (b | C) \u003d b | (A | C)`\n* `A ^ (b ^ C) \u003d b ^ (A ^ C)`\n* `A \u0026 (b \u0026 C) \u003d b \u0026 (A \u0026 C)`\n\nWhere A and C are constants",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "8c4fd0e24282ccb139482dba0865d919f15540c7",
      "old_mode": 33188,
      "old_path": "source/opt/folding_rules.cpp",
      "new_id": "ee2f24e8659ac204f227af42b7ecb9262cc6bc8d",
      "new_mode": 33188,
      "new_path": "source/opt/folding_rules.cpp"
    },
    {
      "type": "modify",
      "old_id": "163f207b5557336ce12a4027573a8804ae1ada30",
      "old_mode": 33188,
      "old_path": "test/opt/fold_test.cpp",
      "new_id": "00c52f7de305a6053ee5f24107322318bb2472da",
      "new_mode": 33188,
      "new_path": "test/opt/fold_test.cpp"
    }
  ]
}