On Mon, Dec 17, 2012 at 10:35 PM, Ryan Culpepper r...@cs.utah.edu wrote:
True, popcount takes about three times as long as it used to. With a few
additional changes, popcount on a million-bit bit-vector takes 1.1 ms using
bytes, as opposed to 0.35 ms using fxvectors. (Tested on a 64-bit
On Tue, Dec 18, 2012 at 12:22 AM, Neil Toronto neil.toro...@gmail.comwrote:
On 12/17/2012 05:48 PM, Robby Findler wrote:
I'm not sure about this change. If I pass in a buggy function, I'm not
sure I'd want the errors to get swallowed.
The errors are almost always division by zero or some
So there are potentially huge inefficiencies when mixing typed and
untyped code, usually when functions are passed across the contract
barrier. Here are a few things that I think cause them. Can the People
Who Know This Stuff Really Well please comment on these issues?
1. Functions that
I can't help with the others, but for 1.) I've considered using a
contract-stronger? test or even just an eq? test when applying a contract,
checking what's already on the value. I haven't added that as it hasn't
come up in anger (and it isn't free, but the check is cheap). If I put a
broken test
Since github is a popular source of activity, here are two things to
know for developers on the receiving end:
* If you don't have one, make a github account.
* To get notifications you should watch the GH mirror of our repo, go
to http://github.com/plt/racket and click the Watch button.
5 matches
Mail list logo
