)]}'
{
  "commit": "414ee1db4b3f1a822261d012a7ce04ef5b884550",
  "tree": "9492c274ea64313d4ee2f0235dcec3cb87c67915",
  "parents": [
    "56c7e164f026c2a07ca6d4d3d81fcce2fd0c570e"
  ],
  "author": {
    "name": "Benoit Jacob",
    "email": "jacob.benoit.1@gmail.com",
    "time": "Sun Jan 25 16:33:06 2009 +0000"
  },
  "committer": {
    "name": "Benoit Jacob",
    "email": "jacob.benoit.1@gmail.com",
    "time": "Sun Jan 25 16:33:06 2009 +0000"
  },
  "message": "Optimization in LU::solve: when rows\u003c\u003dcols, no need to compute the L matrix\nRemove matrixL() and matrixU() methods: they were tricky, returning a Part,\nand matrixL() was useless for non-square LU. Also they were untested. This is\nthe occasion to simplify the docs (class_LU.cpp) removing the most confusing part.\nI think that it\u0027s better to let the user do his own cooking with Part\u0027s.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "b36dc30263368136aabc47f6ce4c5cd19e533936",
      "old_mode": 33188,
      "old_path": "Eigen/src/LU/LU.h",
      "new_id": "00a6dcf6415204e685b4d84c2697ebfb927039cf",
      "new_mode": 33188,
      "new_path": "Eigen/src/LU/LU.h"
    },
    {
      "type": "rename",
      "old_id": "0c72d34a437380048f4bb0dd4b7f5961387d2cd9",
      "old_mode": 33188,
      "old_path": "doc/snippets/class_LU_2.cpp",
      "new_id": "9958368f139621e593cc1dd06327dc79098d13df",
      "new_mode": 33188,
      "new_path": "doc/snippets/class_LU.cpp",
      "score": 72
    },
    {
      "type": "delete",
      "old_id": "50cfc4bf55290de0d0f740dc351e33dc926bc157",
      "old_mode": 33188,
      "old_path": "doc/snippets/class_LU_1.cpp",
      "new_id": "0000000000000000000000000000000000000000",
      "new_mode": 0,
      "new_path": "/dev/null"
    }
  ]
}