{"shas":[["c6f1178be3d1ae2332d629c019a37aba64c661b3","abef95f4bd2046ec90dec958a5f64f153e03ec05@racket-lang.org","fix an error message","Matthew Flatt"],["f1160da419dc820685d1d12f0ccaf9ff21af53c3","abef95f4bd2046ec90dec958a5f64f153e03ec05@racket-lang.org","add `for/sum', `for/product', etc.","Matthew Flatt"],["9ace663021bf02b09b9952e6939d15f45ecfe427","abef95f4bd2046ec90dec958a5f64f153e03ec05@racket-lang.org","Racket-implemented `reverse', `member', `memv', `memq'\n\nWith the JIT, the `reverse' function is significantly faster,\nwhile the `member' variants do not really change; the main\nbenefit is that the operations play well with futures.\n\nThe C implementation is still used when the JIT is unavailable,\nsince the Racket implementations can be much slower in\ninterpreted mode.","Matthew Flatt"],["7123996b30fa36d0f9849b9548fadf0fcbf9d8f3","abef95f4bd2046ec90dec958a5f64f153e03ec05@racket-lang.org","change `eval-jit-enabled' initialization\n\nto reflect whether JIT compilation is supported by the build\n(i.e., set it to #f initially when the JIT is not supported)","Matthew Flatt"],["fae6e273eda6188e34f38553136d374ade3807dd","abef95f4bd2046ec90dec958a5f64f153e03ec05@racket-lang.org","lexer tweak to get named procedure","Matthew Flatt"],["b78a1a8355999e0b6daebea5a4504ec93043a5cf","abef95f4bd2046ec90dec958a5f64f153e03ec05@racket-lang.org","remove abbreviations for `for/sum' and `for/product'","Matthew Flatt"]],"ref":"refs/heads/master","size":6,"head":"b78a1a8355999e0b6daebea5a4504ec93043a5cf","push_id":37751794}