{"push_id":2378196552,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"de4e48a0a18baea839b5593d075736debee71ef4","before":"8801c6b8aa1c980420ed4b265ece02fecd5fbec1","commits":[{"sha":"de4e48a0a18baea839b5593d075736debee71ef4","author":{"name":"Bill St. Clair","email":"acae15da8b2d43337bd27cdd378e86f5f4dc0afe@gmail.com"},"message":"Backward-compatible extensions.\n\nbplustree-insert now takes an optional KEY parameter. If included, it is used instead of calling the key function on the record.\n\nNew functions: bplustree-empty-p, bplustree-search-next, bplustree-search-prev, bplustree-traverse-node-with-keys\n\nA tree now caches the last (key record node) returned from bplustree-search, bplustree-search-next, or bplustree-search-prev, and uses it to optimize calls of those functions with a repeated key. This is a big win for the expected uses of bplustree-search-next and bplustree-search-prev.\n\nTo support bplustree-search-prev, the leaf nodes are now doubly-linked.","distinct":true,"url":"https://api.github.com/repos/billstclair/cl-bplustree/commits/de4e48a0a18baea839b5593d075736debee71ef4"}]}
{"actor":{"display_login":"billstclair"}}