)]}'
{
  "commit": "1182fc288477ba087426dd9c778ff39875e49ffe",
  "tree": "645a8fc51403797340c3f95640a394a1ce6f8ab6",
  "parents": [
    "ef3194472630793497df372fc9c964aca2b87733"
  ],
  "author": {
    "name": "Sameer Agarwal",
    "email": "sameeragarwal@google.com",
    "time": "Tue Jun 20 09:09:05 2017 -0700"
  },
  "committer": {
    "name": "Sameer Agarwal",
    "email": "sameeragarwal@google.com",
    "time": "Tue Jun 20 09:13:02 2017 -0700"
  },
  "message": "SPARSE_SCHUR + CX_SPARSE \u003d Faster\n\nThere was a bug in the trust region preprocessor where no fill\nreducing ordering was computed for the case of SPARSE_SCHUR + CX_SPARSE\nbut this was not signaled to SchurComplementSolver, so it was using\na naive/natural ordering. To fix this two changes are made:\n\n1. TrustRegionProcessor\u0027s logic for signaling the ordering to the\n   linear solver has been re-worked. The surrounding code has also\n   been re-organized for better readability.\n2. In SchurComplementSolver::SolveReducedSystem the row and column\n   block structure has been added to the CompressedRowSparseMatrix\n   containing the Schur complement so that block AMD can be used.\n\nAs a result of these changes the linear solve time for\nproblem-744-543562-pre.txt has been brought down from 58 seconds to\n35 seconds.\n\nChange-Id: I4d82efce05175260f97b1f925f8a1b4a9d650cae\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "1a1becb6970c64b9ab0b8fba39d2d852b65fb50c",
      "old_mode": 33188,
      "old_path": "internal/ceres/schur_complement_solver.cc",
      "new_id": "16470fd8aa40746934e6f224d9dcbf699493f1aa",
      "new_mode": 33188,
      "new_path": "internal/ceres/schur_complement_solver.cc"
    },
    {
      "type": "modify",
      "old_id": "4020e4ca115431936943b9e019c3badf419b5191",
      "old_mode": 33188,
      "old_path": "internal/ceres/trust_region_preprocessor.cc",
      "new_id": "d3f912cddd4230b6401ee85d052273d252194a53",
      "new_mode": 33188,
      "new_path": "internal/ceres/trust_region_preprocessor.cc"
    }
  ]
}