OskarS

67 ms·

751.
by OskarS 7y ago
Is K [0] in some sort of competition with J [1] about who can write worst, most unreadable and unmaintainable C code possible? [0]: https://bitbucket.org/ngn/k/src/master/m.c [1]: https://gith
752.
by OskarS 7y ago
I've only skimmed the paper, but it's more complicated than that. There's both an light attenuation effect (the "blue shift" you're talking about), as well as a separate back-scatter effect, which use different
753.
by OskarS 7y ago
Remove the "-d 1" and that command gets even more useful. This is my preferred version of that trick: du -h | sort -hr | less
754.
by OskarS 7y ago
These kinds of statements are infuriating: > Ethos Capital has pledged to adhere to the 10 percent cap, though it would have no contractual obligation to do so. In blog posts, the private equity firm said it planned to invest in new serv
755.
by OskarS 7y ago
"Because you've declined to get notifications for Slack" This does not seem like a reasonable complaint to me.
756.
by OskarS 7y ago
I think of Fibonacci heaps as essentially just a academic exercise to lower the big-O complexity of Dijkstra's algorithm with very little actual practical use. It always seemed tailor made for that. Like, Fibonacci heaps guarantee an a
757.
by OskarS 7y ago
I'm way into it. I was using the feature in Safari to have some low-key video game streams on while I work. I suppose it's not for everyone, but I'm stoked about Firefox having this feature.
758.
by OskarS 7y ago
Fair enough, I suppose the original post was quite light on technical details.
759.
by OskarS 7y ago
This all sounds very good, and I grant that Linus knows what he's talking about, but didn't this whole thing start with a bunch of game developers that noticed massive stalls when porting games to Google Stadia? Stalls that, presu
760.
by OskarS 7y ago
As the siblings have said, it's an extremely situational decision whether to memoize a pure function, and only a tiny number of pure functions benefit from it. There's no way to do it automatically, it has to be programmer choic
761.
by OskarS 7y ago
What does "memoized by default" mean, precisely? Does it literally memoize every single function call? That seems... illadvised.
762.
by OskarS 7y ago
It's harsh language, but honestly: yes. Microsoft had to lock down the repository because it was being flooded with comments like this. For removing a santa hat . I saw this story about it being removed as well, and I thought to mys
763.
by OskarS 7y ago
A lot of people are piling on the original complainant for a ridiculous complaint, and rightly so. But they are not the only offender here, and arguably not even the worst one: > To adhere to our values and the Code of Conduct, we had t
764.
by OskarS 7y ago
Seems like the obvious solution here would be a macro, I would think. I wonder why that wasn't tried.
765.
by OskarS 7y ago
These two things have nothing to do with each other. The 1 million limit wouldn't have any effect here.
766.
by OskarS 7y ago
The "replace the tab with magic character" thing particularly baffling. I agree that it was probably a dumb idea in the beginning for make to force you to use a literal tab character, but using these kinds of hacks is a terrible i
767.
by OskarS 7y ago
I'm very fond of »inward-pointing guillemets«, personally.
768.
by OskarS 7y ago
I'm under the impression that you don't. I did install the security updates, and I think this thing went away, but I'm not 100% sure.
769.
by OskarS 7y ago
> One must assume this is the part of the design which allows potential monetization one day. Oh, heaven's no! Someone might at some point try to make money from a thing they made?! From their own labor?! How awful! Seriously: it&#x
770.
by OskarS 7y ago
It's "ask-inema" in my head.
771.
by OskarS 7y ago
The one of these that I've come to adore the most is the ranger file manager. I almost never use any GUI file managers (or command line tools, for that matter) for file management after starting to use ranger seriously. It's so fa
772.
by OskarS 7y ago
Why wouldn’t the “volatile” approach be valid? I mean, the only way to guarantee that you can write to memory without error (or to make sure it’s backed by actual memory pages) is to actually write to it, and the way to guarantee you’re doi
773.
by OskarS 7y ago
Yeah, but that's a much lower-level call compared to malloc. Also platform-dependent.
774.
by OskarS 7y ago
Suppose you WANT malloc to be eager (i.e. make sure all the pages are committed right away, so you don't pay a performance penalty for it later), what do you do? The obvious answer is just looping through it and setting it to zero woul
775.
by OskarS 7y ago
Ruby is not the problem at all. The vast majority of time with homebrew is spent doing git operations, downloading tarballs, running makefiles, and the like. You could rewrite the entire thing in Rust and not notice any difference. The thin
776.
by OskarS 7y ago
The point is that "duplicating a line" is a very fundamental building block to other operations, and it should be supported natively. For instance, lets say you have to do several different function calls with only minor differenc
777.
by OskarS 7y ago
Yes, it’s widely used. Many text editors insert a UTF-8 BOM as the first character in a text file to signal that the encoding is UTF-8. It’s technically pointless since UTF-8 doesn’t depend on endianness, but since UTF-8 doesn’t have a “mag
778.
by OskarS 7y ago
> Some coding standards require sorting includes alphabetically Those are some pretty dumb coding standards if that's true. (I mean, yeah, the original fault is with the C preprocessor and the fact that header order matters, but sin
779.
by OskarS 7y ago
You're simply wrong here. The algorithm is O(log n), whether you agree to it or not. First of all, there's absolutely nothing that says that we have to assume that the number of lines is less than 2^64. Big O notation does not car
780.
by OskarS 7y ago
OP said “to be really precise, O(log n)”, to avoid nitpickers that might have added corrections. And it is absolutely true: to store the number N, you need O(log N) bits. That is how Big O notation works. The lesson to take away here is tha

More ›