{"comment":{"url":"https://api.github.com/repos/seelabs/Beast/comments/19647114","html_url":"https://github.com/seelabs/Beast/commit/797778d962fe5a02a2cb68608f438b84992d2c67#commitcomment-19647114","id":19647114,"user":{"login":"seelabs","id":5853458,"avatar_url":"https://avatars.githubusercontent.com/u/5853458?v=3","gravatar_id":"","url":"https://api.github.com/users/seelabs","html_url":"https://github.com/seelabs","followers_url":"https://api.github.com/users/seelabs/followers","following_url":"https://api.github.com/users/seelabs/following{/other_user}","gists_url":"https://api.github.com/users/seelabs/gists{/gist_id}","starred_url":"https://api.github.com/users/seelabs/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/seelabs/subscriptions","organizations_url":"https://api.github.com/users/seelabs/orgs","repos_url":"https://api.github.com/users/seelabs/repos","events_url":"https://api.github.com/users/seelabs/events{/privacy}","received_events_url":"https://api.github.com/users/seelabs/received_events","type":"User","site_admin":false},"position":54,"line":1256,"path":"include/beast/zlib/detail/inflate_stream.hpp","commit_id":"797778d962fe5a02a2cb68608f438b84992d2c67","created_at":"2016-11-01T14:18:19Z","updated_at":"2016-11-01T14:18:19Z","body":"A distance of 1 is a special case that copies from the output and we could fill the values instead of copying (i.e. `memset`). The `while` loop is simpler, but may be slower. No idea if it's worth making the optimization. Depends on how often the algorithm would \"fill\"."}}
{"actor":{"display_login":"seelabs"}}