{"push_id":2999307819,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"46269eae8bfee4b12c0e5ee0a09d383b7f9dc74c","before":"f8a669d4939b8a6e98c67f6f563c314304ffdbda","commits":[{"sha":"682714711f1fc02d39267793089c8ef2c8653cc5","author":{"name":"Mark P. Jones","email":"737b03cff3ffbd84c0d420c9dfc69e66fb6d5287@pdx.edu"},"message":"Make Word.numWords(0) return 1 (for the dummy Unit value that substitutes for Bit 0).","distinct":true,"url":"https://api.github.com/repos/habit-lang/mil-tools/commits/682714711f1fc02d39267793089c8ef2c8653cc5"},{"sha":"109746dd0caa4bbc9ac152794f8a8725209db4e0","author":{"name":"Mark P. Jones","email":"737b03cff3ffbd84c0d420c9dfc69e66fb6d5287@pdx.edu"},"message":"External generators for primBitsHi, primBitsLo :: Bit n -> Bit m, which are specialized versions of primBitSelect that always return the {most, least} significant bits of the input, respectively, with no need for an offset parameter.  Quick experiments, captured in mil-tester main/gens/primBitsHiLo-pos-32, suggest that we can obtain the same behavior as uses of primBitSelect (with either identical code or equivalent code with equivalent complexity) by combining primBitsHi and primBitsLo calls in appropriate ways and then feeding the generated code through the MIL optimizer.","distinct":true,"url":"https://api.github.com/repos/habit-lang/mil-tools/commits/109746dd0caa4bbc9ac152794f8a8725209db4e0"},{"sha":"46269eae8bfee4b12c0e5ee0a09d383b7f9dc74c","author":{"name":"Mark P. Jones","email":"737b03cff3ffbd84c0d420c9dfc69e66fb6d5287@pdx.edu"},"message":"Added an LC version of prioset as a demo, together with some new documentation in the README.","distinct":true,"url":"https://api.github.com/repos/habit-lang/mil-tools/commits/46269eae8bfee4b12c0e5ee0a09d383b7f9dc74c"}]}
{"actor":{"display_login":"zipwith"}}