Quekid5

8 ms·

91.
by Quekid5 1y ago
That's a nice quip, but aren't degrees meant to offer breadth of knowledge? (I'm sure she has lots, but perhaps is weak in other areas.)
92.
by Quekid5 1y ago
*. sends its regards :)
93.
by Quekid5 1y ago
That seems like a low bar :)
94.
by Quekid5 1y ago
> I want a way to state that my intent is to not rely on the TCO. How would that work? You want a nontail keyword to indicate that intent explicitly? I guess I could imagine a scenario where you want to de-optimize a TCO into a non-TC...
95.
by Quekid5 1y ago
Sure, but if you're relying on the TCO, you kind of have to actually state that, regardless? (At least if you want to avoid accidental regressions.) I don't see any way around having to state your intent (as a programmer) for this
96.
by Quekid5 1y ago
Just add the @tailrec annotation -- then the compiler will complain loudly if you break tail calls.
97.
by Quekid5 1y ago
> How do we know if random internet service sells our email / password pair? They probably store the hashed password because it's easier (libraries) than writing their own code, but they get it as cleartext every time we type i
98.
by Quekid5 1y ago
I believe the default compression setting for the zstd command is biased towards speed -- maybe try -9, -13 or even -22 (max, which should probably be fine for such a small file). Not that it matters when the file is so small in the first p
99.
by Quekid5 1y ago
So... metadata checksums? I mean if enough data/metadata gets corrupted you're SOL either way. For example, in ZFS the metadata is checksummed such that pointers to the data carry the checksum for that data.
100.
by Quekid5 1y ago
It's worth noting that some (many?) languages[0] only support TCO as long as you're calling the function itself in tail position. The usual cases were you'll notice this when implementing state machines in "direct styl
101.
by Quekid5 1y ago
I'd say it makes checksums even more important so that you know whether something got corrupted immediately and not after a year (or whatever) has gone by and you actually need it.
102.
by Quekid5 1y ago
> However, it’s getting frustrating to see all of the reductionist claims that “chronic pain is psychological”. It's incredibly frustrating and disheartening... For obvious reasons, I'm not going to go into too much detail, but
103.
by Quekid5 1y ago
Undefined Behavior has a very specific meaning in the C and (respectively) C++ standards. And it is this. I think you may be misunderstand how optimization works. It's not "AHA! Undefined Behavior, I'll poke at that!". I
104.
by Quekid5 1y ago
"To shreds, you say?"
105.
by Quekid5 1y ago
"Oracle" and goodwill is not a thing.
106.
by Quekid5 1y ago
> Tbh the collections being mutable isnt really an issue since it gets the job done and reasoning about these things isnt that hard. Have you worked in language with immutable collections by default? It's night and day -- no more de
107.
by Quekid5 1y ago
Considering that it's Undefined Behavior, quite possibly. EDIT: That said, I'm on the maintainer's side here.
108.
by Quekid5 1y ago
Not if that language doesn't actually check the totality of your proof and ensures that the base case holds.
109.
by Quekid5 1y ago
If a set-of-strings was trivially available in the source language (at time of implementation) the original programmer would probably have done this (relatively) trivial optimization... This is a symptom of anemic languages like C.
110.
by Quekid5 1y ago
> It's not great, but you can always catch and retry if your belief is that the GC will free enough memory to allow the attempt to continue after the memory pressure subsides. No, you cannot. Catching, for example, StackOverflowErro
111.
by Quekid5 1y ago
Sooooo much boilerplate and pointless generated tests is my prediction. EDIT: Oh, and as a sibling poster mentioned: A huge number of security vulnerabilities -- except now they can be purposefully injected by just posting random subtly-wro
112.
by Quekid5 2y ago
If your (backup-via-redundancy) keys are mutable, you do not have a backup . What happens in the case of a ransomware attack, for example? You've also added (possibly substantial) latency to every single operation that operates on use
113.
by Quekid5 2y ago
You still have to backup those keys somewhere... and if you don't do it the same way as for the data then your backups are effectively worthless.
114.
by Quekid5 2y ago
Yes, negative indexing as in e.g. Python (so basically "from the end") can be incredibly convenient and works seamlessly when indexes are 0-based.
115.
by Quekid5 2y ago
I think the Quantum Leap expression can also be understood as a "step" with no intermediate stages, i.e. very abrupt or transformative.
116.
by Quekid5 2y ago
> Code ligature thing has something to do with just seeing the characters that are actually there rather than a smokescreen, which IMO impedes editability because I can't place the cursor half-way through a ligature and so on Why wo
117.
by Quekid5 2y ago
That's effectively "make clean" just slightly more automated. Btw, what happens if you change CFLAGS? Does anything get compiled if no files have changed?
118.
by Quekid5 2y ago
Funnily enough, I tend to think the arrows should be in the other direction. Philosophy birthed Math, which was necessary for Physics, ... etc. That's not to say Philosophy has outlived its usefulness, but... it was probably more conse
119.
by Quekid5 2y ago
"A implies B" does not mean "B implies A".
120.
by Quekid5 2y ago
They are simple but very often wrong . It's surprisingly hard to write Makefiles that will actually do the right thing under anything other than "build from scratch" scenarios. (No, I'm not joking. The very existence of

More ›