)]}'
{
  "commit": "6fd121b1c999def9c9d1bcfa8cae3b6d64cfcde6",
  "tree": "5948ebe2ace4e7eeb55aa72ba55ce148899374a2",
  "parents": [
    "856e0e07c544f3eb09fad8075ae644c0dde6ddb1"
  ],
  "author": {
    "name": "bnc",
    "email": "bnc@google.com",
    "time": "Thu Apr 01 11:35:56 2021 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Thu Apr 01 11:36:36 2021 -0700"
  },
  "message": "Use circular buffer instead of std::deque for HPACK dynamic table in HTTP/2 decoder.\n\nHttp2Deque is an alias for QuicheDequeImpl which is an alias for std::deque both\nin internal code and in Chromium.  QuicCircularDeque is more memory efficient,\nespecially if there are only few entries, and requires fewer allocations as new\nentries are added if old entries are also being removed, which is the case for\nHPACK where the dynamic table size is bounded.\n\nPiperOrigin-RevId: 366295336\nChange-Id: I9457344c632ae26def506592d64a3d233cb380c1\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "45fce608d9b6a535bd341feb110e2e3cba5bb92c",
      "old_mode": 33188,
      "old_path": "http2/hpack/decoder/hpack_decoder_tables.h",
      "new_id": "f75916d67df3dedbb28173e2949f12f01b21c7c5",
      "new_mode": 33188,
      "new_path": "http2/hpack/decoder/hpack_decoder_tables.h"
    }
  ]
}