)]}'
{
  "commit": "58ad13c05daf619f77f2d7ad943c62a2c905bc33",
  "tree": "f0f1a4a1192e6ca93354c61bd6b87502800387ad",
  "parents": [
    "8e2420edb17b89ab5f5a0f7056ec7fdcc0c18943"
  ],
  "author": {
    "name": "Sameer Agarwal",
    "email": "sameeragarwal@google.com",
    "time": "Tue Jun 05 17:46:53 2012 -0700"
  },
  "committer": {
    "name": "Sameer Agarwal",
    "email": "sameeragarwal@google.com",
    "time": "Tue Jun 05 18:06:00 2012 -0700"
  },
  "message": "BlockRandomAccessSparseMatrix::IntPairToLong suffers from integer\noverflow.\n\nEven though the return value of this function is a long int, the\ncomputation happens with three ints, which causes an overflow before\nthe upgrade happens.\n\nThe fix is to upgrade the constant used int his computation to be a\nlong int, which causes the computation to be done in longs instead of\nints.\n\nA test has been added to verify that the fix works.\n\nChange-Id: Ibb0aef877125bb37ca28754cb07b8e1627fd1d5a\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "27e30a753897f3ec7af47b6cb81390add5a36aab",
      "old_mode": 33188,
      "old_path": "internal/ceres/block_random_access_sparse_matrix.h",
      "new_id": "48a00437cf61351f32b6df853c0f09d0ec825096",
      "new_mode": 33188,
      "new_path": "internal/ceres/block_random_access_sparse_matrix.h"
    },
    {
      "type": "modify",
      "old_id": "01a8c66749a622456322f8cdf5a06febda38931e",
      "old_mode": 33188,
      "old_path": "internal/ceres/block_random_access_sparse_matrix_test.cc",
      "new_id": "e4e676925cf6514473f111fc54acb36cc3384fe2",
      "new_mode": 33188,
      "new_path": "internal/ceres/block_random_access_sparse_matrix_test.cc"
    }
  ]
}