)]}'
{
  "commit": "343d754a76349eff3ca0374d8c43e0d8795779e2",
  "tree": "3efaf8047c0297d14b31045ff0d3f61b75bdacf9",
  "parents": [
    "9bfdc250622df58dd87e34566ccb23d5910b40a6"
  ],
  "author": {
    "name": "drh",
    "email": "drh@noemail.net",
    "time": "Wed Sep 24 04:38:14 2014"
  },
  "committer": {
    "name": "drh",
    "email": "drh@noemail.net",
    "time": "Wed Sep 24 04:38:14 2014"
  },
  "message": "Experiment using linear interpolation, instead of a strict binary search,\nwhen looking for integer-keyed rows on a single b-tree page.  The\nexperiment was not successful.  The number of key comparisons is reduced\nby about 15%, but the added complexity of the search logic causes an \noverall reduction in performance.  The patch is saved for historical reference\nonly.\n\nFossilOrigin-Name: c705cf856d314d1e9e5371b7758d3c8a46099391",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "209072a8028bb1ea0e428453c7d3a71c3eefc7dc",
      "old_mode": 33188,
      "old_path": "manifest",
      "new_id": "1283a6770f474eae7a6fa21ac9dd1d5888b82eca",
      "new_mode": 33188,
      "new_path": "manifest"
    },
    {
      "type": "modify",
      "old_id": "1ee8b65c87e067b12bf91193d59e8a72eb5411dd",
      "old_mode": 33188,
      "old_path": "manifest.uuid",
      "new_id": "169bc135bedbebeda879b937ed083430776255f3",
      "new_mode": 33188,
      "new_path": "manifest.uuid"
    },
    {
      "type": "modify",
      "old_id": "9af99dd8adf97fdab13531450849c9f6eac4afdc",
      "old_mode": 33188,
      "old_path": "src/btree.c",
      "new_id": "3e18bca0d66404a10554b7d0cde942567fb9fbf3",
      "new_mode": 33188,
      "new_path": "src/btree.c"
    }
  ]
}