{"push_id":737688131,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d523b79fe86adb386a62ee55103b3d9cece8a2c5","before":"235242017ec83ae1e0e6600b27db7672b0594dd5","commits":[{"sha":"d523b79fe86adb386a62ee55103b3d9cece8a2c5","author":{"email":"d05d859aebcabdf6cdaf3440210eff4d0849ac3f@gmail.com","name":"Ben Manes"},"message":"Add Bélády's optimal cache to simulator\n\nUnlike other policies, OPT must be run as a post-processing step in\norder to evaluate against the full usage history. When possible this\nwork is performed incrementally and in parallel to the other policies.\nThis requires knowing the next access of all the entries in the cache,\nmeaning that a terminal element will halt incremental processing due to\nnot knowing if that entry will be seen again. By careful use of O(lg n)\ndata structures, the sequential time even in the worse case for a large\ntrace is only a few seconds.","distinct":true,"url":"https://api.github.com/repos/ben-manes/caffeine/commits/d523b79fe86adb386a62ee55103b3d9cece8a2c5"}]}