)]}'
{
  "commit": "99a625243fd40687a48a47d97ac9fa48f762c570",
  "tree": "0ce758c7f8c9de8df8a98264fbb6e79e06536b8a",
  "parents": [
    "51e6ee39f0c1880abd1649cac010d618cea22872"
  ],
  "author": {
    "name": "Gael Guennebaud",
    "email": "g.gael@free.fr",
    "time": "Sun Jul 13 01:22:54 2008 +0000"
  },
  "committer": {
    "name": "Gael Guennebaud",
    "email": "g.gael@free.fr",
    "time": "Sun Jul 13 01:22:54 2008 +0000"
  },
  "message": "Optimization: added super efficient rowmajor * vector product (and vector * colmajor).\nIt basically performs 4 dot products at once reducing loads of the vector and improving\ninstructions scheduling. With 3 cache friendly algorithms, we now handle all product\nconfigurations with outstanding perf for large matrices.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "06b3f58769c4495501befd20cfee1890b43907f3",
      "old_mode": 33188,
      "old_path": "Eigen/src/Core/CacheFriendlyProduct.h",
      "new_id": "669649de8eefd3408fc1064793d3a8567f50afcb",
      "new_mode": 33188,
      "new_path": "Eigen/src/Core/CacheFriendlyProduct.h"
    },
    {
      "type": "modify",
      "old_id": "8f5c247bed62af83bb3c444b86643652847bcb5e",
      "old_mode": 33188,
      "old_path": "Eigen/src/Core/MatrixStorage.h",
      "new_id": "53faf884ede7dce4f8c77af1bbe390f35c6567a8",
      "new_mode": 33188,
      "new_path": "Eigen/src/Core/MatrixStorage.h"
    },
    {
      "type": "modify",
      "old_id": "31677e6cb9e3a5a6e7da7f90787077b3e6b3b94a",
      "old_mode": 33188,
      "old_path": "Eigen/src/Core/Product.h",
      "new_id": "223da4d06923650984ef7b69696a23090d4c3471",
      "new_mode": 33188,
      "new_path": "Eigen/src/Core/Product.h"
    },
    {
      "type": "modify",
      "old_id": "8e5784497f86d175e7c882f0a91080a026e81856",
      "old_mode": 33188,
      "old_path": "bench/btl/data/perlib_plot_settings.txt",
      "new_id": "3e23fee534dd71fa2f3f2aaf4ba8159b5980480e",
      "new_mode": 33188,
      "new_path": "bench/btl/data/perlib_plot_settings.txt"
    }
  ]
}