@pnkfelix you saw https://github.com/rust-lang/rust/pull/50593 I suppose
(just in case niko, today is a bank holiday in France)
oh, right, forgot
this is an amazing topic title. Though perhaps it works better the other way?
(after all, non-performant systems don't get used? There's some pithy quote, not sure if its Butler Lampson or someone else, about how the problem with fault-tolerance as applied to bugs is that tolerated bugs don't get fixed...)
ha, a fair point.
@pnkfelix you saw the perf results?
lookin' decent, though still room for improvement
no i've been distracted
hmm so we saw at best a 60% improvement
yeah, though I think we can get more
this was from your PR to remove the per-location computationm?
I would have expected much more improvement
well, I didn't change the data structures or anything
it's still e.g. a bitset
I'm not sure but maybe SEME gives a win
right, but the per-location stuff is the cause of quadratic blowup, right?
I guess I'm over-estimating the effect from asymptotic inefficiency
or at least there are many potential causes
I mean we still have O(n) regions and O(n) points per region
so in some sense ther eis still a O(n^2)
or I guess I'm misunderstanding how many causes of blow up there are. :)
I guess that is true