)]}'
{
  "commit": "7599e36e7cbad38ec77cadd959d3a45d2124800a",
  "tree": "92a8c00e97fe710ec93e764dab0ec8a03dc50bbe",
  "parents": [
    "60b607be5b2d8934386cae2d1455625a788f1be3"
  ],
  "author": {
    "name": "Derek Mauro",
    "email": "dmauro@google.com",
    "time": "Thu Jan 01 05:08:09 2026 -0800"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Thu Jan 01 05:09:05 2026 -0800"
  },
  "message": "Add absl::chunked_queue\n\nThis change introduces absl::chunked_queue, a sequence container\noptimized for use as a FIFO (First-In, First-Out) queue. It is similar\nin purpose to std::deque but with different performance trade-offs and\nfeatures.\n\nabsl::chunked_queue stores elements in a series of\nexponentially-growing chunks of memory.\n\nabsl::chunked_queue is often a better choice than std::deque in the\nfollowing situations:\n  * Large queues: For very large numbers of elements, the exponential\n    growth strategy of absl::chunked_queue can lead to fewer, larger\n    memory allocations compared to std::deque, which can be a\n    performance advantage.\n  * Strict FIFO processing: When you only need to add elements to the\n    back (push_back) and remove them from the front (pop_front).\n\nstd::deque should be preferred in the following cases:\n  * Operations at both ends: std::deque is designed for efficient\n    insertions and deletions at both the front and the\n    back. absl::chunked_queue is optimized for push_back and pop_front\n    and does not offer a pop_back method.\n  * Random access: std::deque provides amortized O(1) random access to\n    elements via operator[]. absl::chunked_queue does not support\n    random access.\nPiperOrigin-RevId: 850999629\nChange-Id: Ie71737c10b6125b9e498109267cac87a4ca2f9e8\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "10e6cd1683832b6ab00cb2c8b6a852e6ec529e67",
      "old_mode": 33188,
      "old_path": "CMake/AbseilDll.cmake",
      "new_id": "47d0efd59ef8a8b458494a4de08967798f707aa9",
      "new_mode": 33188,
      "new_path": "CMake/AbseilDll.cmake"
    },
    {
      "type": "modify",
      "old_id": "15fb0a53c5adddd67d9989db6646677f7514cb9a",
      "old_mode": 33188,
      "old_path": "absl/container/BUILD.bazel",
      "new_id": "e90aaecca943b00642754beb04b9e12634b4a200",
      "new_mode": 33188,
      "new_path": "absl/container/BUILD.bazel"
    },
    {
      "type": "modify",
      "old_id": "f1ea9e247b7d6894a5dc4b9e68ef596d3bff2ba8",
      "old_mode": 33188,
      "old_path": "absl/container/CMakeLists.txt",
      "new_id": "365c6ea3a6136ffd54cc1b255f05ef9f2e6d1de7",
      "new_mode": 33188,
      "new_path": "absl/container/CMakeLists.txt"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "d5b1184a89043ce584be36e5c863fcf4557b47d9",
      "new_mode": 33188,
      "new_path": "absl/container/chunked_queue.h"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "ee4d3c150f7966855891cdc4f211f97b42ec835e",
      "new_mode": 33188,
      "new_path": "absl/container/chunked_queue_benchmark.cc"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "d394ec4d03fcc4f13a078e86dfdef75d5b0a1ab6",
      "new_mode": 33188,
      "new_path": "absl/container/chunked_queue_test.cc"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "c3718ac3bba52dbf4b90efca0b2e76ca26677952",
      "new_mode": 33188,
      "new_path": "absl/container/internal/chunked_queue.h"
    }
  ]
}