{"push_id":865537236,"size":3,"distinct_size":2,"ref":"refs/heads/master","head":"82c7a47a80ec7b0ba7ba4a6d683f4e297b8650b6","before":"10a8d20e6e9d5b2bd372a79b7fd091b1c2aa471b","commits":[{"sha":"a2c4bc505dbb914728f98be77838454abbd7b4fb","author":{"email":"ee135d789cf54d9d07de817ad16149ed786654e7@gmail.com","name":"Francis Stephens"},"message":"ASM for LazyStore replaced with Go code\n\nYou can see the trick used to implement this in runtime/atomic_amd64x.go\n(which should appear in Go 1.5). The use of a a nop() function prevents\nthe surrounding function from being inlined by the compiler. Because the\nfunctions are not inlined they cannot be reorded. Just what the doctor\nordered for LazyStore :)","distinct":false,"url":"https://api.github.com/repos/fmstephe/flib/commits/a2c4bc505dbb914728f98be77838454abbd7b4fb"},{"sha":"e218e23896ead58f784c0c4ee232ce2b2e665355","author":{"email":"ee135d789cf54d9d07de817ad16149ed786654e7@gmail.com","name":"Francis Stephens"},"message":"numeric comparison functions which return 0 or 1\n\nThis replicates the behaviour found in C where boolean values were just\ninteger values with a fancy type declaration. This means that integer\ncomparisons can be used as numerical values without, potentially\nexpensive, branches. An example usage is to select elements in a size 2\narray without using if statements.\n\nThese functions are a wee bit niche.","distinct":true,"url":"https://api.github.com/repos/fmstephe/flib/commits/e218e23896ead58f784c0c4ee232ce2b2e665355"},{"sha":"82c7a47a80ec7b0ba7ba4a6d683f4e297b8650b6","author":{"email":"ee135d789cf54d9d07de817ad16149ed786654e7@gmail.com","name":"Francis Stephens"},"message":"Benchmark comparing strict/lazy PointerQ\n\nBenchmarks comparing ByteQ and ByteChunkQ will follow.","distinct":true,"url":"https://api.github.com/repos/fmstephe/flib/commits/82c7a47a80ec7b0ba7ba4a6d683f4e297b8650b6"}]}