doomrobo

34 ms·

331.
by doomrobo 9y ago
I like this article style a lot. A very cool result, presented clearly and step-by-step, in less than a full screen of text.
332.
by doomrobo 9y ago
Didn't Mike Pall step down sometime last year? It looks like he's made a ton of commits [0] and also made the announcements on the mailing list [1]. Anyways, congrats on the new release! [0] https://github.com/LuaJ
333.
by doomrobo 10y ago
You're conflating the issues of running untrusted code with running trusted code on untrusted input. JS is untrusted code that you run on your computer. Your other examples generally do not fall into this camp. Java being an allegedly
334.
by doomrobo 10y ago
Very cool. But the more I see of compile-time code the more I think it's a bad idea. The presented "toy" function with the inline while loop is essentially a macro that's doing compile-time code generation. I can easily
335.
by doomrobo 10y ago
Canvas by Instructure
336.
by doomrobo 10y ago
That is a very readable changelog. I particularly like the use of "Command X learned Y" to skirt some potentially awkward phrasing.
337.
by doomrobo 10y ago
My former workplace maintained a "common code" library that almost every team in the company used. I think the key is to strike a balance between functionality and compactness. If you're gonna impose standards, don't mak
338.
The Power of PCRE Regular Expressions (2012)(nikic.github.io)
2 points by doomrobo 10y ago|0 comments
339.
Why Lua (2012)(blog.datamules.com)
3 points by doomrobo 10y ago|0 comments
340.
Session Types for Rust [pdf](munksgaard.me)
2 points by doomrobo 10y ago|0 comments
341.
by doomrobo 10y ago
From the docs page [0] for std::collections::HashMap, Rust uses backwards shift deletion [1] instead of the tombstone method. [0] https://doc.rust-lang.org/std/collections/struct.HashMap.htm... [1] http:/&#x
342.
The X3DH Key Agreement Protocol(whispersystems.org)
50 points by doomrobo 10y ago|11 comments
343.
by doomrobo 10y ago
From the Benchmarks section of the README: https://github.com/BurntSushi/xsv/blob/master/BENCHMARKS.md
344.
by doomrobo 10y ago
Out of curiosity what did your load look like? What was the best performer?
345.
by doomrobo 10y ago
It's the same problem though. As the other comment said, you have 2 uncorrelated memory locations. If you check the first one and your element isn't there, then checking the second one will probably incur a cache miss. The differe
346.
by doomrobo 10y ago
They're pretty similar in philosophy. I'd guess that Robin Hood would perform better on average just by virtue of linear probing. If you get a collision in a Cukoo hash, you're pretty much guaranteed a cache miss. With a Robi
347.
by doomrobo 10y ago
A variant of this is the default for Rust's HashMap. http://codecapsule.com/2013/11/17/robin-hood-hashing-backwar...
348.
Robin Hood Hashing should be the default hash table implementation (2013)(sebastiansylvan.com)
220 points by doomrobo 10y ago|53 comments
349.
by doomrobo 10y ago
x and y do not have to be known at compile time. If I let y be a random Nat, and x be y - 1 (or 0 if y == 0), then I can statically prove that LE x y.
350.
by doomrobo 10y ago
Archive link: https://archive.is/D2ZVr
351.
Germans Reconsider Tough Privacy Laws After Terrorist Attacks(wsj.com)
2 points by doomrobo 10y ago|1 comments
352.
by doomrobo 10y ago
If you can afford the allocation at every iteration, the iterslide crate might work for you. https://github.com/slapresta/rust-iterslide
353.
by doomrobo 10y ago
The Rust compiler uses DeBrujin indices to refer to variables at some point in the compilation process.
354.
How to design an elliptic-curve signature system (2014)(blog.cr.yp.to)
6 points by doomrobo 10y ago|0 comments
355.
by doomrobo 10y ago
Even avoiding mutices and using lock-free algorithms doesn't guarantee that your thread won't starve. As another comment mentioned, fast wait-free algorithms are what you need in this context.
356.
by doomrobo 10y ago
A great tutorial on macros in Racket is Fear of Macros by Greg Hendershott. http://www.greghendershott.com/fear-of-macros/all.html
357.
by doomrobo 10y ago
A lot of people here mention Prolog as another tool to solve this problem. I wonder if there's a natural way to combine constraint solving with simulated annealing.
358.
by doomrobo 10y ago
>With this scale of attack the Linux kernel is not enough for us. We must work around it...we added a partial kernel bypass feature to Netmap: that's described in this blog post. With this technique we can offload our anti-DDoS ipta
359.
by doomrobo 10y ago
Unintialized values are fine as long as the compiler can prove that the value is never used until it is initialized. See https://is.gd/gDJCeG as an example. Try deleting the else block.
360.
by doomrobo 10y ago
Nice work. One note: what you defined in your example is an algebraic data type, but not a generalized algebraic data type. The data constructors' are implicitly defined, as opposed to being explicitly defined. I liked this wiki page a

More ›