{"push_id":1035748807,"size":2,"distinct_size":2,"ref":"refs/heads/backend-memory","head":"3e8588d121eb3cb227bdba9c7f6629c4360dbb39","before":"3eff0dcc53e7ecf8ff83f92462e525a3ad1f3663","commits":[{"sha":"aef5582d7f6511dc7c5707bea1de6893620b2cdc","author":{"email":"cf7c333beb19dccca38a631d04d497a423e5ab50@liu.se","name":"Martin Sjölund"},"message":"Spend less memory trying to build a queue","distinct":true,"url":"https://api.github.com/repos/sjoelund/OMCompiler/commits/aef5582d7f6511dc7c5707bea1de6893620b2cdc"},{"sha":"3e8588d121eb3cb227bdba9c7f6629c4360dbb39","author":{"email":"cf7c333beb19dccca38a631d04d497a423e5ab50@liu.se","name":"Martin Sjölund"},"message":"Change set representation for BackendVarTransform\n\nMost expressions contain few crefs (0~2), so we use a list for a set\nrepresentation. The HashSet datatype typically allocates 4k elements\njust to remove duplicates in this set of 0~2 variables.","distinct":true,"url":"https://api.github.com/repos/sjoelund/OMCompiler/commits/3e8588d121eb3cb227bdba9c7f6629c4360dbb39"}]}