)]}'
{
  "commit": "c0588b0ea3a6bf9599b5f275fac62e04dc3a009a",
  "tree": "05fa2e680b9fb6cdf33fe8833e2dc50fe482691c",
  "parents": [
    "d7be62c714fef2c2bf00bf1e173a2d1fc50fddb5"
  ],
  "author": {
    "name": "bnc",
    "email": "bnc@google.com",
    "time": "Tue Oct 06 10:53:30 2020 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Tue Oct 06 11:53:27 2020 -0700"
  },
  "message": "Change Huffman encoder benchmark to typical character distribution.\n\nReimplement a Huffman decoder and run it on random binary input to generate\ncharacters from the ideal distribution corresponding to the Huffman code.\nThis is much closer to real life usage than repeated \u0027a\u0027 characters, giving more\nmeaningful benchmark results.\n\nPiperOrigin-RevId: 335674758\nChange-Id: I7f90439066691b45fea693715091f70b15628920\n",
  "tree_diff": [
    {
      "type": "delete",
      "old_id": "370eb726d952fb915106f77d71de903a129ee9f2",
      "old_mode": 33188,
      "old_path": "http2/hpack/huffman/hpack_huffman_encoder_benchmark.cc",
      "new_id": "0000000000000000000000000000000000000000",
      "new_mode": 0,
      "new_path": "/dev/null"
    },
    {
      "type": "delete",
      "old_id": "aeea72689655346fa3c3fbdccb65adeb929e3cdf",
      "old_mode": 33188,
      "old_path": "spdy/core/hpack/hpack_huffman_table_benchmark.cc",
      "new_id": "0000000000000000000000000000000000000000",
      "new_mode": 0,
      "new_path": "/dev/null"
    }
  ]
}