)]}'
{
  "commit": "3b80872be64d5cc890d0ba84e229a2faf7c360c0",
  "tree": "206228fe4cb64852619367e881bcfd8d5efa4115",
  "parents": [
    "caced66be65eaac74c62c94f46cb0aec6ed0b859"
  ],
  "author": {
    "name": "Goktug Gokdogan",
    "email": "goktug@google.com",
    "time": "Wed Oct 01 15:58:28 2014 -0700"
  },
  "committer": {
    "name": "Gerrit Code Review",
    "email": "noreply-gerritcodereview@google.com",
    "time": "Thu Oct 02 15:51:39 2014 +0000"
  },
  "message": "Refactors LinkedList to not use circular list.\n\nThe new implementation is using double pivot instead of\nsingle.\n\nThis is to make LinkedList safer when preconditions are\nnot enabled and iterator is not used properly.\nFor example, with a circular list, if you keep calling\nnext/remove you might never hit an NPE because it will\neventually come back to beginning and start iterating\nagain.\n\nThis might be a little bit on the paranoid side but given\nthe new implementation is no more complex, it is a good\ntrade-off.\n\nChange-Id: I4915d5c7b3a6a0e48b96c14be4ce0d64bf3b0de2\nReview-Link: https://gwt-review.googlesource.com/#/c/9363/\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "ae821566c909ac92b3962561214a2411fc0151a1",
      "old_mode": 33188,
      "old_path": "user/super/com/google/gwt/emul/java/util/LinkedList.java",
      "new_id": "a276656d990a4520d8fd4c1b6afcfd248aa797a7",
      "new_mode": 33188,
      "new_path": "user/super/com/google/gwt/emul/java/util/LinkedList.java"
    }
  ]
}