)]}'
{
  "commit": "4f43b71778dbc7c9b132ab7ad7acb8c680a539b8",
  "tree": "7a107652696b6795ccabdd4269c1a02b37d522f5",
  "parents": [
    "83a85f6423d108da8eeb919342def3eb42d4c2b6"
  ],
  "author": {
    "name": "Yann Collet",
    "email": "cyan@fb.com",
    "time": "Thu Jun 19 22:29:10 2025"
  },
  "committer": {
    "name": "Yann Collet",
    "email": "cyan@fb.com",
    "time": "Thu Jun 19 22:29:10 2025"
  },
  "message": "small optimization when streaming small quantities\n\ndescribed in #1011 by @aleksazr as point 2:\nthis optimization avoids copying accumulators\nwhen there is not enough data to compute them anyway.\nSeems effective on MSVC.\n\nSuch a scenario implies streaming, and receiving very little data per invocation.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "5a5732faa71bb7b6edb7854c6ba277c7e140e1fd",
      "old_mode": 33188,
      "old_path": "xxhash.h",
      "new_id": "f0ea8d654e69857fdda666d96aa59db6db49f04a",
      "new_mode": 33188,
      "new_path": "xxhash.h"
    }
  ]
}