{"push_id":1078404813,"size":1,"distinct_size":1,"ref":"refs/heads/level-wise-unfoldM","head":"b04344676a0b122dc965b0077ed07bc5d8bea6cf","before":"72bfa89ae2820a86ee1ee6a4a2918aedef871f0f","commits":[{"sha":"b04344676a0b122dc965b0077ed07bc5d8bea6cf","author":{"email":"45974cab5fc33d9f0d3677077385ac4f89cda35f@gmail.com","name":"David Feuer"},"message":"Use level-wise algorithm for BF unfolds\n\n`unfoldTreeM_BF` and `unfoldForestM_BF` previously used a\nqueue-based algorithm from a note by Okasaki. That same\nnote indicates that the level-wise approach tends to be slightly\nfaster, and my own informal tests suggest the same. Both solutions\nsuffer from a potential space leak, retaining the seed lists\nlonger than necessary in order to later use their lengths. It\nremains to be seen whether this leak can be plugged without\na speed penalty.","distinct":true,"url":"https://api.github.com/repos/treeowl/containers/commits/b04344676a0b122dc965b0077ed07bc5d8bea6cf"}]}