Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Joker_vD
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
35 ms
·
751.
▲
by
Joker_vD
1y ago
I wonder if building this table can be sped up by noticing a recurring pattern? x 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 ... 254 255 f(x) 0 0 1 2 3 3 4 5 6 6 7 8 9 9 10 11 12 12 ... 190 191 So some
752.
▲
by
Joker_vD
1y ago
I think I actually saw a question on SO way back during the Windows Vista era when some guy asked if Windows supported machines with odd number of cores/processors, and the answer was "well, 1 is an odd number, you know". Ano
753.
▲
by
Joker_vD
1y ago
There is also "Tree Borrows" [0] proposal for Rust, which is aimed at the same problem. [0] https://perso.crans.org/vanille/treebor/aux/preprint.pdf
754.
▲
by
Joker_vD
1y ago
Well, no. But I think it wouldn't be that hard to add to e.g. Golang, the code gen for this feature is pretty small: find the closest wrapping loop, put "$unique_name := true" as the first statement of its body, replace the k
755.
▲
by
Joker_vD
1y ago
Or we can go the OCaml route, admit that we want both applicative and generative functors, and add an explicit marker to the type-returning functions whether those generated types should always have unique identity, or not.
756.
▲
by
Joker_vD
1y ago
var result = ?, err = NeverEvenTriedError for attempt_no := 1 to retry_count + 1 do result, err := action() while err and is_transient_error(err) between sleep() end where the "between"
757.
▲
by
Joker_vD
1y ago
What, there are other OSes that are not Linux? But why would you use them, just use Linux instead? Okay, fine, we'll pretend they're kinda Linux anyway and build the binaries for you. "Wrong paths"? Okay, patch it yourse
758.
▲
by
Joker_vD
1y ago
It only has to count if the index doesn't store the amounts of records in the "chunks" it manages, does it? I'm pretty sure B-trees do actually store the sizes of the subtrees.
759.
▲
by
Joker_vD
1y ago
Well, IIRC using the >>/<< operators for I/O was proposed by McIlroy (who also invented the Unix pipes), and Stroustrup liked it enough to adopt. And, well, I personally don't really mind it. What I do mind is t
760.
▲
by
Joker_vD
1y ago
> Instead of using OFFSET, the query becomes WHERE id > cursor ORDER BY id LIMIT 10 Wait. Surely "ORDER BY id OFFSET 20 LIMIT 10" works about the same as "WHERE id > cursor ORDER BY id LIMIT 10", if "id&quo
761.
▲
by
Joker_vD
1y ago
You're correct, of course, but back in 1990 people were way more excited about overgeneralizations, class hierarchies and what templates could possibly do. I mean, that was the time when using << and non-stacking stream manipulat
762.
▲
by
Joker_vD
1y ago
I personally think it's the influence from Pascal, it had the "SET OF" types that were conventionally implemented as bitsets, so you didn't have to muck around with manual shifting/masking yourself.
763.
▲
by
Joker_vD
1y ago
See David R. Hanson's "A Portable File Directory System" [0][1], for example: a 700 lines long implementation of early UNIX's filesystem API that piggy-backs on some sort of pre-existing (block-oriented) I/O primiti
764.
▲
by
Joker_vD
1y ago
Seriously, please don't use C0 (except for LF and, I cede grudgingly, HT) and C1 characters in your plain text files. I understand that you may want to store some "ANSI coloring markup" (it's not "VT100 colors"
765.
▲
by
Joker_vD
1y ago
Or, to re-word it in the words of the parent comment, that's why we don't write write programs in assembler that output even more assembler.
766.
▲
by
Joker_vD
1y ago
Well, there is also a question of attitude. Most of the Python programmers don't overload << or >> even though they technically can, while in C++ that's literally the way the standard library does I/O ― and I su
767.
▲
by
Joker_vD
1y ago
So they're lagging about 3-4 years behind the Russian practices, but steadily catching up. Quite impressive!
768.
▲
by
Joker_vD
1y ago
> I guess the UK never heard of VPNs Wanna bet that when they finally hear of them, they'll try to ban them (and mentions of VPNs, too)?
769.
▲
by
Joker_vD
1y ago
And if you underspecify, you force the users to invent their own hacks and workarounds, often very poorly. And no, I don't want to "high performance" lock implementations that regularly completely deadlock the whole process (
770.
▲
by
Joker_vD
1y ago
> And in practice, behavior across common implementations [of recursive locks] is not remotely consistent. There’s a good reason why this was left undefined – it’s kind of hard. This is such a frustrating stance that most standards have,
771.
▲
by
Joker_vD
1y ago
What? Executive orders has been around since forever, and has been one of the main sources of law until very recently (in historical terms). Unless you're alluding to something completely different.
772.
▲
by
Joker_vD
1y ago
> elected judges Judges are not elected, in Germany at least. They are appointed.
773.
▲
by
Joker_vD
1y ago
> the wooden beams in a building are usually just 20% of the original wood taken from source. The remaining 80% is lost as production waste in the form of sawdust, scraps, discarded parts, and so on. Kinda mind-boggling how this has been
774.
▲
by
Joker_vD
1y ago
// it doesn't seem to love piping or redirecting output without this, even // with the newlines above fflush(stdout); Ah, the full buffering mode. I believe it can be fixed by calling setvbuf
775.
▲
by
Joker_vD
1y ago
> you can't use strict equality with floating point numbers because they are somehow fuzzy. They are not. They are though. All arithmetic operations involve rounding, so e.g. (7.0 / 1234 + 0.5) * 1234 is not equal to 7.0 + 617
776.
▲
by
Joker_vD
1y ago
And also 4) somewhat want to talk to other people ― but not that much that they'd be ready to exit Emacs.
777.
▲
by
Joker_vD
1y ago
I am fairly certain POSIX define a day to be exactly 86400 seconds for the matter of calendar conversions/calculations, and deliberately ignores leap seconds: https://pubs.opengroup.org/onlinepubs/9799919799/b
778.
▲
by
Joker_vD
1y ago
It's considered to be "`exotic`, `academic`, `never used in practice`, etc., etc." because for some reason most of the DB people believe that 1 relation in the data model should map to exactly 1 table/B-tree in the datab
779.
▲
by
Joker_vD
1y ago
Which will drastically improve things with how the boot sequence(s) work and non-CPU devices are discovered, initialized, and managed, I am sure. So far, SBI doesn't look very promising.
780.
▲
by
Joker_vD
1y ago
> No; in fact it's perfectly reasonable, And this is how I once ended spending a Friday evening in a frantic hurry because a dependency decided to drop support for "old" language versions (that is, all except the two newes
More ›