frankmcsherry

15 ms·

91.
by frankmcsherry 9y ago
I mean, it can be, right? Take todays Advent of Code problem, where you want to grab the index of the largest element in a sequence breaking ties toward early elements, then re-distribute that element one at a time over other positions star
92.
by frankmcsherry 9y ago
Or perhaps it is zero-knowledge, but about file systems. ;)
93.
by frankmcsherry 9y ago
HN wants me to stop posting, so this will be the last one. You two know how to find me elsewhere. What I should have written is: "you will not fall victim to memory unsafety unless there is a bug in the language or in the standard libr
94.
by frankmcsherry 9y ago
I really don't have a position on C++; I don't use it, and don't really want to make supportive or limiting statements. I have used other memory safe languages, and I find their guarantees qualitatively different from Rust.
95.
by frankmcsherry 9y ago
I would say that Rust has a different memory safety story from say C#, which distinguishes between "is safe" and "contains unsafe code outside the CLR itself". I find that very-binary distinction more helpful than Rust&#
96.
by frankmcsherry 9y ago
I don't think you are correct, unless the language has changed substantially. https://docs.microsoft.com/en-us/dotnet/csharp/language-refe... Among other things, you need to opt in to unsafe with the `&#
97.
by frankmcsherry 9y ago
C#
98.
by frankmcsherry 9y ago
> Basically, I find the "there's always unsafe code somewhere at the bottom and therefore it's the same as 100% unsafe" to be overly reductive. I totally agree; it's not the same. However, I think there is disagr
99.
by frankmcsherry 9y ago
In many other languages `unsafe` taints the block of code it is in, which propagates upwards. Rust is the other way around, where `unsafe` means "I'm doing something unsafe here, but let's not tell anyone who doesn't loo
100.
by frankmcsherry 9y ago
There is a surf spot in Morocco (Killers) named for the Orcas spotted there. They apparently show up periodically. Water is plenty warm.
101.
by frankmcsherry 9y ago
I've been using it in Rust, but librdkafka had (has?) a bug that's been fixed in tree that cut the read throughput to about 10MB/s using loopback (edit: cuts throughput to 10MB/s in many settings, which hurts especially
102.
by frankmcsherry 9y ago
> Wired recently deployed a team of experts to deconstruct Apple’s code and found its differential privacy practices to be lacking, a characterization that the company strongly disputes. If by "deployed" they mean "intervi
103.
by frankmcsherry 9y ago
> Is there anything I am missing? Like, lots, I think. I don't own property in Switzerland, but you write as if property transactions are in cash up-front. Instead, you put some money down (why the GP mentioned leverage), and the am
104.
by frankmcsherry 9y ago
My understanding of the field-reordering work is that it applies to tuples. From http://camlorn.net/posts/April%202017/rust-struct-field-reor... : > The 2000-foot version: Rust structs, enums, and tuples are now
105.
by frankmcsherry 9y ago
I've had a bunch of issues getting clean statements about the ABI that actually result in usable guarantees. For example, while you are advised to put `#[repr(C)]` on types you want to have a known layout for FFI, to the best of my und
106.
by frankmcsherry 9y ago
Some minor pedantry that winds me up a bit, and that I thought I'd try to correct: > Note that one of the co-authors of this paper, Amit, is the author of https://www.tockos.org/ The definite article "the"
107.
by frankmcsherry 9y ago
> What bothered me about your comment was that it sounded a bit like "wow, I found that RDBMSes suck at this specific type of computation that they're not built to deal with, therefore query optimizers suck in general", wh
108.
by frankmcsherry 9y ago
Stonebraker has done a lot of fine work, but also has a lot of false negatives; he got down on recursive queries, on data-parallel compute, and generally most other things that he's not directly working on. It ends up with an in-crowd
109.
by frankmcsherry 9y ago
> Indeed, when I look at the emptyheaded paper for example, I see SIMD parallelism, query compilation join optimization, all stuff that was first developed in the context of RDBMSes. The main contribution of EH is not the use of SIMD, it
110.
by frankmcsherry 9y ago
It's a stream processing language: http://hirzels.com/martin/papers/spe16-river.pdf
111.
by frankmcsherry 9y ago
For further reading about the high quality of database query optimization, and how far back MR et al must have set things, recent SIGMOD work managed to get to within 1000x of a single-threaded implementation (and so, not quite within that
112.
by frankmcsherry 9y ago
This probably runs afoul of your "at least not in a satisfying way" constraint, but: It is pretty easy (an exercise) to implement the "opposite of a Bloom filter" if you start from a summary of the complete set of events
113.
by frankmcsherry 9y ago
I am a bit torn with this, because while I love people reading and then writing up things, there are so many changes I think they should make but I don't want to just barge in and make pull requests. E.g., they largely miss DryadLINQ (
114.
by frankmcsherry 9y ago
I suspect affine is fine, but I'm not an authority. The distinction (as I understand it) is only that linear types require that you consume all instances, whereas affine allow you to leak if you want. Leaking doesn't seem to lead
115.
by frankmcsherry 9y ago
Ownership / affine types? It's hard to say, because some folks will jump up and down and say "reference counting is GC!", and then some folks could just as justifiably say "regions are GC!"
116.
by frankmcsherry 9y ago
As they describe in the paper, if you want that behavior you can get it, but it comes at a cost. If you would like the softer guarantees (could be exception or not, but never invalid data), you can get better performance. What they describe
117.
by frankmcsherry 9y ago
!#$!@# I was going to go try that out. ;) When doing the Chaos/Order stuff, the decompression was about half the CPU cycles, so thinning that could help. Fwiw, the encoding I used wasn't VByte; because I was doing strict increment
118.
by frankmcsherry 9y ago
When I was grinding away on the 128B edge graph on my laptop, literally 85% of the time was parsing integers. Get your data to native binary as soon as you can (edit: or out of plain text at least, per parent).
119.
by frankmcsherry 9y ago
This example isn't about branch prediction (not exactly), but it might still be interesting: https://github.com/frankmcsherry/blog/blob/master/posts/2015... It's about how sorting + random
120.
by frankmcsherry 9y ago
I think that is the ethical thing to do, yes. Differential privacy does statistically disclose information about you, and whether the quantitative bound used is up to your standards is a decision you should make before it happens. Given t

More ›