{"push_id":959847879,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9b0ae49c71123f6fd1f9e70f2cebf58b02d22010","before":"d389feedbba9f81b6d1f9152388e341e2e07c34c","commits":[{"sha":"9b0ae49c71123f6fd1f9e70f2cebf58b02d22010","author":{"email":"d9b10621251df64c356ef37d60fabe38d1f7a748@gmail.com","name":"bartavelle"},"message":"Optimizations\n\nInstead of using the sorted ByteString as a key, this counts the\nfrequency of each letter in a sentence. It then uses the resulting\nVector as a key. This is cheaper than sorting a ByteString.\n\nThe list of sorted words that is used for deduping is only computed at\nthe last stage.\n\nTwo prefilters are performed:\n* with the input list of strings, empty lists are ignored\n* after the grouping of elements, entries with 1 element or less are\ndropped before going to the deduplication\n\nThe Hashable instance could use some love, it should be possible to work\non data wider than Word8 at that place.","distinct":true,"url":"https://api.github.com/repos/bartavelle/hs-anagrammer/commits/9b0ae49c71123f6fd1f9e70f2cebf58b02d22010"}]}