)]}'
{
  "log": [
    {
      "commit": "1a94dc35bc5c166d89913dc01a49d27a3c21a455",
      "tree": "575196f1d0b9528b7d63b9bff692dd81e1aeac0f",
      "parents": [
        "f02e8a6596b7dc9b2171f7ff5654039ef0950cdc"
      ],
      "author": {
        "name": "Tim Abbott",
        "email": "tabbott@ksplice.com",
        "time": "Thu Apr 14 20:00:19 2011 +0200"
      },
      "committer": {
        "name": "Rusty Russell",
        "email": "rusty@rustcorp.com.au",
        "time": "Thu May 19 16:55:27 2011 +0930"
      },
      "message": "lib: Add generic binary search function to the kernel.\n\nThere a large number hand-coded binary searches in the kernel (run\n\"git grep search | grep binary\" to find many of them).  Since in my\nexperience, hand-coding binary searches can be error-prone, it seems\nworth cleaning this up by providing a generic binary search function.\n\nThis generic binary search implementation comes from Ksplice.  It has\nthe same basic API as the C library bsearch() function.  Ksplice uses\nit in half a dozen places with 4 different comparison functions, and I\nthink our code is substantially cleaner because of this.\n\nSigned-off-by: Tim Abbott \u003ctabbott@ksplice.com\u003e\nExtra-bikeshedding-by: Alan Jenkins \u003calan-jenkins@tuffmail.co.uk\u003e\nExtra-bikeshedding-by: André Goddard Rosa \u003candre.goddard@gmail.com\u003e\nExtra-bikeshedding-by: Rusty Russell \u003crusty@rustcorp.com.au\u003e\nSigned-off-by: Rusty Russell \u003crusty@rustcorp.com.au\u003e\nSigned-off-by: Alessio Igor Bogani \u003cabogani@kernel.org\u003e\nSigned-off-by: Rusty Russell \u003crusty@rustcorp.com.au\u003e\n"
    }
  ]
}