)]}'
{
  "commit": "9e11cd16d09403b9270e621e839d5948b6a74b8d",
  "tree": "340f34c67b66716ed99df2750eddf019c381514f",
  "parents": [
    "46b8461fd010c1e7ffce6bb2bdf8a84b659d5e09"
  ],
  "author": {
    "name": "Sameer Agarwal",
    "email": "sameeragarwal@google.com",
    "time": "Mon Sep 29 14:27:58 2014 -0700"
  },
  "committer": {
    "name": "Sameer Agarwal",
    "email": "sameeragarwal@google.com",
    "time": "Mon Sep 29 15:50:19 2014 -0700"
  },
  "message": "Faster  BlockRandomAccessSparseMatrix::SymmetricRightMultiply.\n\nTrade a small amount of memory to improve the cache coherency of\nthe SymmetricRightMultiply operation.\n\nThe resulting code leads to a 10-20% speedup in the linear solver\nend to end.\n\nChange-Id: I8ab2fe152099e849b211b5b19e4ef9f03d8e7f1c\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "9da16a469d5608967e4f0098e52536abdb1ae75e",
      "old_mode": 33188,
      "old_path": "internal/ceres/block_random_access_sparse_matrix.cc",
      "new_id": "c43a9b78feb700cc78c41d29764b286caca9186c",
      "new_mode": 33188,
      "new_path": "internal/ceres/block_random_access_sparse_matrix.cc"
    },
    {
      "type": "modify",
      "old_id": "a4f89d8130f54ceec585fdf8b52999ac248a9a0d",
      "old_mode": 33188,
      "old_path": "internal/ceres/block_random_access_sparse_matrix.h",
      "new_id": "51b5d20cfe01c55eabcd779a506b736df3426ca5",
      "new_mode": 33188,
      "new_path": "internal/ceres/block_random_access_sparse_matrix.h"
    }
  ]
}