Quekid5

35 ms·

451.
by Quekid5 5y ago
That sounds like an Ubuntu problem more than a ZFS problem, no? Very happy Ubuntu/ZFS user here, but we use only the LTS versions of Ubuntu.
452.
by Quekid5 5y ago
I have nothing invested in whether or not any given mathematician is right or wrong. I just picked a random example of a controversial proof -- the point was more that proof-as-computation could settle and any all disputes. It might not l
453.
by Quekid5 5y ago
That doesn't make sense. The Schwartzian Transform is linear time and cheap time-wise. Btw, I'm surprised nobody has objections about constants. The constants for the type of stuff 'discrimination' does are (apparently)
454.
by Quekid5 5y ago
An interesting perspective on programs-as-proof is I-forget-his-name-but... the mathematician who made really bold claims, if only you'd study under his tutelage for a number of years to understand this whole new terminology he inven
455.
by Quekid5 5y ago
I don't understand what you mean by duplicate here. Apply a Schwartzian Transform and there you go -- no duplicates.
456.
by Quekid5 5y ago
The haskell 'discrimination' package provides quite general support for linear-time sorting, so it's certainly doable. (I don't recall exactly what the limitations about which value types it can handle, but it's rea
457.
by Quekid5 5y ago
Fair enough. I'm in the unfortunate situation that Acetylsalicylsalicylic acid (wow, that's a mouthful!) is the only thing that really work for my headaches... so I might be counter-biased wrt. your experience. It's just th
458.
by Quekid5 5y ago
> for me, folders are just a limited form of tagging. I understand that this is a very subjective thing... but folders offer an exclusion which isn't immediately available via tagging. Tagging is implicitly an OR operation. Now,
459.
by Quekid5 5y ago
That's as may be, but nowhere in your program does it say that it should use either sse2 or avx2, which was the parent poster's point. At least that's what I understood it to be. Technically you could have different code path
460.
by Quekid5 5y ago
Correct, it is. (OTC) Not sure what the other poster means by 'extremely hard to get'. Ask for it at the counter at any pharmacy and there you go. Maybe they're referring to it not being available at the counter in supermarke
461.
by Quekid5 5y ago
It's sort of like the Unix Philosophy. It sounds good and is probably a good thing to strive for generally, but it's ultimately pointless when it comes to actually evaluating whether approach A is better than approach B.
462.
by Quekid5 5y ago
That's par for the course if you use an actual framework for Property-based Testing. All the ones I've tried certainly do mix in the usual suspects (-1, 0, 1, MAX_INT, empty list, etc.) into the randomly sampled data. The author o
463.
by Quekid5 5y ago
I don't mean 60s literally. I mean arbitrarily small commits at your own convenience. You don't need to have even remotely working code when you commit, is the point. You just commit whenever. (It's almost like saving files,
464.
by Quekid5 5y ago
You can still get do what you want if you commit every 60 seconds (or whatever). It's just about postponing any and all cleanup activity until you're ready to shared it with reviewers/the world. (... but of course, by all mea
465.
by Quekid5 5y ago
Ah, thanks. I guess this is also available with the command line tools? (I'm thinking for CI purposes.)
466.
by Quekid5 5y ago
(Veering a bit off-topic, forgive me.) Is there any non-proprietary Ada/SPARK implementation? I've heard some good things about Ada/SPARK, but DDG hasn't been much help in finding out if there's any non-proprietary
467.
by Quekid5 5y ago
Yes, but as soon as they leave the realm of the DB itself, they (should) become opaque identifiers.
468.
by Quekid5 5y ago
It obviously has a shared history with the Spanish word (comes from Latin. The negative connotation in the phrase "facile piece of writing" would be "over-easy", as in: "over-simplified". ("Too easy"
469.
by Quekid5 5y ago
The problem with Bazel has nothing to do with learning curve. It's a pretty simple model as far as build systems go. It's that it requires a lot of boilerplate and has a very rigid nested structure... which compounds boilerplate,
470.
by Quekid5 5y ago
This one is pretty milquetoast. Clickbait-y title to it, even.
471.
by Quekid5 5y ago
Possible, but if you're running a fully automated company... what difference would that make? If anything it'd be a liability... a risk of your "cron job" being a bit late or something.
472.
by Quekid5 5y ago
I was asking the opposite question, I think. I know of GNAT, but I was asking whether there's any Ada/Spark that has a GPL (or whatever non-proprietary) license.
473.
by Quekid5 5y ago
That's kind of point, tho... I feels gross because it should?
474.
by Quekid5 5y ago
It's a figure of speech. "Should" here is short for "should according to our best theories. Therefore those theories are inaccurate".
475.
by Quekid5 5y ago
Yes, but if the IO one does <shenanigans> then you're as well off. Which is... not very. EDIT: Just to say: I don't mean to be flippant.
476.
by Quekid5 5y ago
Yeah, that's why I was quite skeptical about the exact scenario... it would probably look very out of place, but I don't have enough RW experience in Python to say for sure.
477.
by Quekid5 5y ago
For a much simpler example: newtypes can make enforcing proper escaping[0] completely trivial and checked by the compiler. It's very similar to tainted values in Perl except enforced at compile time. [0] No, not sanitization!
478.
by Quekid5 5y ago
The point isn't so much that you can disable effects. It's that you literally have no effects/capabilities unless specifically granted. That said, I'm a bit skeptical that Haskell would have prevented this particular
479.
by Quekid5 5y ago
IME the only sane way to do this is to a) redraw the transaction boundaries, aka. avoid it, or b) don't do it (see below), c) idempotency -- so you can just retry everything until you succeed. You can do distributed transactions, but
480.
by Quekid5 5y ago
Yup. Karma farming bots are absolutely rampant.

More ›