Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
vitus
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
61.
▲
by
vitus
1y ago
Right. I merely shared the closest thing that I could find, and as mentioned, the first link is specific to the ride-hailing service. Notably, in the second link, there is a reference to sharing information with law enforcement, but it'
62.
▲
by
vitus
1y ago
> If anyone can share a link to a similar IRL privacy policy for Waymo I would love to read it. For riders, there's the Waymo One privacy policy: https://support.google.com/waymo/answer/9184840?sjid=5254444
63.
▲
by
vitus
1y ago
They were in favor of the free market from Reagan onwards. But the party was founded on the premise that tariffs would protect their northern constituents and industries, and they took over a century to shake that tendency. Perhaps the only
64.
▲
by
vitus
1y ago
> There's literally no machine on Earth today that can deal with that (as a single file, I mean). Oh? Certainly not in RAM, but 4 PiB is about 125x 36TiB drives (or 188x 24TiB drives). (You can go bigger if you want to shell out ten
65.
▲
by
vitus
1y ago
The reason why the discussion in this thread centers around gzip (and brotli / zstd) is because those are standard compression schemes that HTTP clients will generally support (RFCs 1952, 7932, and 8478). As far as I can tell, the bigg
66.
▲
by
vitus
1y ago
> Of course, the cost of a P.O. box over 40 years would have added up to thousands of dollars and that is less money for FSF advocacy. And time spent going to the post office to check the box would also have taken away from advocacy time
67.
▲
by
vitus
1y ago
I think the biggest win for pipelining in SQL is the fact that we no longer have to explain that SQL execution order has nothing to do with query order, and we no longer have to pretend that we're mimicking natural language. (That last
68.
▲
by
vitus
1y ago
Agreed entirely, on all those points. Calling the extra ] a syntax error was a slight exaggeration on my behalf, but that was clearly an unintended extra character -- there's no way the author thinks "123].45].67].89]" is a v
69.
▲
by
vitus
1y ago
> I think ruby does, not sure what other languages. You're right that Ruby has it. Perl also has /x, of course (since most of Ruby regex was "inspired" directly by Perl's syntax), as well as Python (re.VERBOSE).
70.
▲
by
vitus
1y ago
> For that reason, easy to read, simple regex wins over fancy, but convoluted regex. Sure, I'd take \d+\.\d+\.\d+\.\d+ over... "((2(5[0-5]|[0-4][0-9])|1[0-9]{2}|[1-9]?[0-9])\.){3}(2(5[0-5]|[0-4][0-9])|1[0-9]{2}|[1-9]?[0-9])&quo
71.
▲
by
vitus
1y ago
It's especially ironic given that the title of the post is "Regex Isn't Hard", and then it proceeds to make several (syntactical and logical) errors in the one real-world example. Syntax error aside (there's an extr
72.
▲
by
vitus
1y ago
> the completely straightforward way is tied for fastest as well. Is it, though? back_inserter should replicate push_back(), which incurs a move at the very minimum. The approach with emplace_back() does not. https://quick-ben
73.
▲
by
vitus
1y ago
The first code block (with the raw loop) also has an unnecessary copy in the form of `response.data = transformed_data;` -- that should be std::move(transformed_data), or else you're copying every element in the vector. That further el
74.
▲
by
vitus
1y ago
Why choose Abseil for associative containers? It was a big deal when it first appeared on the scene, and it's certainly still better than the standard library for the most part, but there are now a number of alternatives that have sinc
75.
▲
by
vitus
1y ago
You continue to miss the point. In this specific context, volume ratio scales super-exponentially with dimension, and unless you're willing to have accuracy also drop super-exponentially (as in, go very very quickly to zero), then you
76.
▲
by
vitus
1y ago
> First off, you didn't answer my question which to restate is: if the ratio is 1/2, how many samples do you need. Are we just trying to estimate the ratio? To what desired accuracy? If you have 100 samples and find that 50 poi
77.
▲
by
vitus
1y ago
How does that perform in heavy rain or snow? I've always been told that when dealing with mmWave, attenuation gets pretty bad when dealing with adverse climate conditions, and Boulder is surely no stranger to snow.
78.
▲
by
vitus
1y ago
I mean, yes, you can estimate this for low dimension. It's a bad idea given how slow the convergence is, but you can do it. My entire point is that this becomes infeasible very quickly for numbers that are not all that big.
79.
▲
by
vitus
1y ago
> If you think estimating 1e-1000 is a problem, then estimating 1e+1000 shouldn't be. They're both problems. If you want to estimate 1e1000 via sampling individual points, then you need at least that order of magnitude of sampl
80.
▲
by
vitus
1y ago
My point is that we're not just talking about A/B of 100, but rather A/B of 10000000000000 or more. If you're inverting the ratio we're estimating, then instead of estimating the value at 0, we're estimating it
81.
▲
by
vitus
1y ago
(note: I am going to be imprecise here by describing the volume of the unit hypersphere, when such a concept does not exist, as the hypersphere only describes the surface of such a construct. It is more correct to call it the volume of the
82.
▲
by
vitus
1y ago
It is about enumerating the microstates, but in a way that takes into account how the particles interact with each other (aka making assumptions about the dynamics). If we didn't take into account any interactions, we'd be unable
83.
▲
by
vitus
1y ago
It's worth noting that there's more than just ergodicity at play, although that's a fundamental requirement. For instance, applying the Pauli Exclusion Principle gives rise to Fermi-Dirac statistics.
84.
▲
by
vitus
1y ago
The problem with this explanation (and with many others) is that it misses why we should care about "disorder" or "uncertainty", whether in information theory or statistical mechanics. Yes, we have the arrow of time argu
85.
▲
by
vitus
1y ago
Perhaps the most commonly-cited (but not actually all that practical) example for rejection sampling is estimating the value of pi (as hinted by the first example under uniform random sampling): generate two random numbers between 0 and 1,
86.
▲
by
vitus
1y ago
Thanks for providing more insight into the development process that went into designing this algorithm! :) > Contrast that to a weighted random shuffle where each subscription's weight is its affinity score and we sample them based
87.
▲
by
vitus
1y ago
Ah, I overlooked the `some`. Interesting, that's even more skewed than I initially thought.
88.
▲
by
vitus
1y ago
Hm, I was curious about the biased shuffle, since I was not expecting that particular shape. It looks like we basically build up the list of bookmarks as follows [0]: x = rand() if x < p: element = first element else:
89.
▲
by
vitus
2y ago
> We've had several SecDefs, all dramatically more competent than Hegseth, who did not have any military experience. Who do you have in mind? Carter, Cohen, and Cheney were the only confirmed secretaries from the past 40 years who f
90.
▲
by
vitus
2y ago
Yeah, Bernie Sanders has consistently staked out a number of protectionist / populist positions, but he is not representative of the Democratic party as a whole. In case you're wondering, the resolution in question failed with lar
More ›