)]}'
{
  "commit": "661e33ca185f766019bd27fedda57a354efed787",
  "tree": "90491da542cb372296a1abd7eceaa778061ce3a0",
  "parents": [
    "5211b0b0fded55769739d8d828f2a362f234c05c"
  ],
  "author": {
    "name": "Ben Clayton",
    "email": "bclayton@google.com",
    "time": "Tue May 17 17:54:32 2022 +0000"
  },
  "committer": {
    "name": "Dawn LUCI CQ",
    "email": "dawn-scoped@luci-project-accounts.iam.gserviceaccount.com",
    "time": "Tue May 17 17:54:32 2022 +0000"
  },
  "message": "tint: Cleanup of IntrinsicTable\n\nRemove the ProgramBuilder from ClosedState and use a pointer for the\n\u0027overload\u0027 field instead of a reference. Let\u0027s the Candidate be\ncopy-assignable, which in turn, allows the Candidates vector to be\nsorted directly, instead of jumping through hoops to use moves.\n\nReplace random mix of \u0027int\u0027, \u0027uint8_t\u0027 with \u0027size_t\u0027 (externally to the\nconstant table data). Reduces fragile weak binding between distant code.\n\nSwap the overload scoring order (high-best -\u003e low-best). Remove the\n\u0027matched\u0027 field - we can now just check whether the \u0027score\u0027 is 0.\nFurther simplifies sorting.\n\nChange-Id: I4a4b7934be337306202647d096c546eab5c8498f\nReviewed-on: https://dawn-review.googlesource.com/c/dawn/+/90641\nKokoro: Kokoro \u003cnoreply+kokoro@google.com\u003e\nReviewed-by: David Neto \u003cdneto@google.com\u003e\nCommit-Queue: Ben Clayton \u003cbclayton@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "5ca8ee21093b4a4688b36003c557b3096b53eca9",
      "old_mode": 33188,
      "old_path": "src/tint/resolver/intrinsic_table.cc",
      "new_id": "58ba84f189a4dad344fa50b37eac2ca6133edc9c",
      "new_mode": 33188,
      "new_path": "src/tint/resolver/intrinsic_table.cc"
    }
  ]
}