)]}'
{
  "commit": "c6f7609574beef8afdeee72fd777aed9bdb67d7a",
  "tree": "addb2bde6457e524500bd74e5d7ac3e99df77c97",
  "parents": [
    "4d88af9ffdd7cab898b25ab420b13453b478c2fa"
  ],
  "author": {
    "name": "Viet-Trung Luu",
    "email": "viettrungluu@chromium.org",
    "time": "Mon Jun 27 15:59:28 2016 -0700"
  },
  "committer": {
    "name": "Viet-Trung Luu",
    "email": "viettrungluu@chromium.org",
    "time": "Mon Jun 27 15:59:28 2016 -0700"
  },
  "message": "Add some perftests for wait sets.\n\nThe main important of these tests is to verify that they behave\nreasonably as wait set size varies.\n\n(The overhead per wait should be O(1) or O(log n) in the wait set size\nn. Currently it\u0027s probably O(log n), since we use an std::map for\nlookups, but obviously we could use a hash table instead.)\n\nR\u003dazani@chromium.org\nBUG\u003d#350\n\nReview URL: https://codereview.chromium.org/2094413003 .\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "1e2b5251923d644859a58f212d0854746c310888",
      "old_mode": 33188,
      "old_path": "mojo/public/c/system/tests/BUILD.gn",
      "new_id": "5e4a8221e591fc1ffd85e20c3c483085a0d9e6b3",
      "new_mode": 33188,
      "new_path": "mojo/public/c/system/tests/BUILD.gn"
    },
    {
      "type": "modify",
      "old_id": "f86c1552052c5cbaa3e81797b27cab110276ef22",
      "old_mode": 33188,
      "old_path": "mojo/public/c/system/tests/message_pipe_perftest.cc",
      "new_id": "a4329cf88fbbd2fce6cdcd6c8863666ebd26fdf5",
      "new_mode": 33188,
      "new_path": "mojo/public/c/system/tests/message_pipe_perftest.cc"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "197ccb603bb715cbaeebbde1f012ab2487e38db7",
      "new_mode": 33188,
      "new_path": "mojo/public/c/system/tests/wait_set_perftest.cc"
    }
  ]
}