)]}'
{
  "commit": "af37fe54c320b0f76f76da01acbbfc0c0118e613",
  "tree": "96c4c579eed2749eab0f9ecabb1b21127f92c445",
  "parents": [
    "635dfa32c261ba078438b74de397f2207904ca78"
  ],
  "author": {
    "name": "Lasse R.H. Nielsen",
    "email": "lrn@google.com",
    "time": "Fri Apr 04 18:34:21 2025 +0200"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Fri Apr 04 18:34:21 2025 +0200"
  },
  "message": "Adds `[Heap]PriorityQueue.of` constructor. (#734)\n\nIntroduces efficient (linear-number of comparisons) \"heapify\" algorithm for converting an unsorted list to a heap-sorted list, using it for the of constructor, and after a large addAll operation, when it\u0027s presumed faster than just bubbling down all the new elements.\n\nAlso rewrites HeapPriorityQueue to use a growable list as backing array, instead of implementing the same thing using the double-when-full algorithm, and still having to deal with nullable cells. The platform growable list implementation is assumed to efficiently avoid some of those null checks.\n\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "0123f87fc7462efb8172ec0503fabbd5091c1cd0",
      "old_mode": 33188,
      "old_path": "pkgs/collection/CHANGELOG.md",
      "new_id": "5164fca3a0e962500aa0532ec585aecbdab2bb29",
      "new_mode": 33188,
      "new_path": "pkgs/collection/CHANGELOG.md"
    },
    {
      "type": "modify",
      "old_id": "11b0348a2606efa0ab2176c3eedb40759fb75f81",
      "old_mode": 33188,
      "old_path": "pkgs/collection/lib/src/priority_queue.dart",
      "new_id": "df5b43b4d0aab12eaf49ceda2249a26e670eb190",
      "new_mode": 33188,
      "new_path": "pkgs/collection/lib/src/priority_queue.dart"
    },
    {
      "type": "modify",
      "old_id": "f07a1a39e36b6d5b529eaebb987de31cc9318ed1",
      "old_mode": 33188,
      "old_path": "pkgs/collection/test/priority_queue_test.dart",
      "new_id": "a7aafc4f6eeb81374f880476b00827e53456c53f",
      "new_mode": 33188,
      "new_path": "pkgs/collection/test/priority_queue_test.dart"
    }
  ]
}
