cbarrick

23 ms·

271.
by cbarrick 7y ago
FWIW, Rust uses Pattern-defeating quicksort for it's unstable sort. [1] https://github.com/orlp/pdqsort [2] https://doc.rust-lang.org/std/vec/struct.Vec.html#method.sor...
272.
by cbarrick 7y ago
Traditional servers should be positively effected as well [1]. > Also, there is nothing fb-specific. You can take any new modern distributive (I've tried Fedora 30), boot it up and look at the amount of slab memory. Numbers are roug
273.
by cbarrick 7y ago
Honestly, I was hoping for something like the `tree` command. I've implemented that algorithm before, but it was painful and not portable. These trees are definitely cooler and more complex but maybe fewer use cases. Once you start dea
274.
by cbarrick 7y ago
"Regular Expression Matching Can Be Simple And Fast" [1] is worth a read (by Russ Cox of Bell Labs and Go fame). [1]: https://swtch.com/~rsc/regexp/regexp1.html
275.
by cbarrick 7y ago
This article is complete fluff. There's no _real_ discussion of Moore's law. No new revelations about chip design. You say workloads need to exploit parallelism these days to see increased performance gains? No shit. Putting memor
276.
by cbarrick 8y ago
I'm amused by the "Lift" naming trend for code generators. Mozilla's next gen code generator for wasm will be called "Cranelift" [1]. Probably coincidence. [1]: https://github.com/CraneStation&#
277.
by cbarrick 9y ago
Lol, I like how no one is talking about DSW in the replies to the comment about DSW. > [F]ind middle, use it as root, recursively build two subtrees. That's not DSW. DSW should be way more efficient. > With a singly-linked list,
278.
by cbarrick 9y ago
That's the DSW algorithm. https://en.wikipedia.org/wiki/Day-Stout-Warren_algorithm
279.
by cbarrick 9y ago
Isn't this just in-order traversal... class Linked: def __init__(self, data, left=None, right=None): self.data = data self.left = left self.right = right def tree_to_list(s
280.
by cbarrick 9y ago
I mean, doi. McCulloch and Pitts published in the 1950s. Of course we know more about the brain now. If I were to ask you "How does intelligence arise from a network of activations?" Would you genuinely say that it has nothing to
281.
by cbarrick 9y ago
We say ANNs are "based on how the brain works" because the original mathematical model was an attempt by McCulloch and Pitts to explain how complex behavior arises from networks of simple neurons. A neuron is either activated or n
282.
by cbarrick 9y ago
> how does the server confirm that the proof is correct? The point of proof-of-work algorithms is to be hard to compute but easy to verify. As a simplified example, a proof-of-work might be to take some input and find a corresponding sal