)]}'
{
  "log": [
    {
      "commit": "2acfe0fc7a1747c327da66c8a693840ba0c5a016",
      "tree": "f07b250964c0295a9d9908bb20e8e2028c9fed1f",
      "parents": [
        "cea5559ecf458ccbb251594dba571f01bf0a2402"
      ],
      "author": {
        "name": "Yuxuan \u0027fishy\u0027 Wang",
        "email": "yuxuan.wang@reddit.com",
        "time": "Fri Oct 21 10:27:40 2022 -0700"
      },
      "committer": {
        "name": "Yuxuan \u0027fishy\u0027 Wang",
        "email": "fishywang@gmail.com",
        "time": "Wed Oct 26 14:40:10 2022 -0700"
      },
      "message": "THRIFT-5650: Implement UUID in Go compiler\n\nClient: go\n"
    },
    {
      "commit": "b0b353191aeaa1b427d105892efa7facea6d4f1f",
      "tree": "08a523fcec62a405eba32b7ef51068f85b35f90c",
      "parents": [
        "6813b1914bf32b8d37d10207f10a092064ba36d7"
      ],
      "author": {
        "name": "Yuxuan \u0027fishy\u0027 Wang",
        "email": "yuxuan.wang@reddit.com",
        "time": "Thu Feb 18 09:09:20 2021 -0800"
      },
      "committer": {
        "name": "Yuxuan \u0027fishy\u0027 Wang",
        "email": "fishywang@gmail.com",
        "time": "Mon Feb 22 10:02:48 2021 -0800"
      },
      "message": "Move ConflictingNamesTest to lib/go/test\n\nClient: go\n\nAlso add missing copyright header for files added in\nhttps://github.com/apache/thrift/pull/2307.\n"
    },
    {
      "commit": "4aaef75819aea3f79ec812393dbe13bb62bd6c45",
      "tree": "01b30b368276430fa01763df92e6eb2f6cc945cb",
      "parents": [
        "93d20993f911795b4bcfbcb8143397dad77267bc"
      ],
      "author": {
        "name": "wangtieju",
        "email": "wangtieju@bytedance.com",
        "time": "Thu Feb 04 11:26:44 2021 +0800"
      },
      "committer": {
        "name": "Yuxuan \u0027fishy\u0027 Wang",
        "email": "yuxuan.wang@reddit.com",
        "time": "Wed Feb 03 21:05:22 2021 -0800"
      },
      "message": "THRIFT-5337 Go set fields write improvement\n\nClient: go\n\nThere is a duplicate elements check for set in writeFields* function,\nand it compares elements using reflect.DeepEqual which is expensive.\n\nIt\u0027s much faster that generates a *Equals* function for set elements and\ncall it in duplicate elements check, especially for nested struct\nelement.\n\nCloses #2307.\n"
    }
  ]
}