256

7 ms·

1.
by 256 2y ago
there's https://github.com/mogenson/PaperWM.spoon (i haven't tried it)
2.
by 256 6y ago
> My problem with systemd isn't pid 1. It's all the rest of the shovelware that comes along for the ride. And it's the "you'll use what we tell you to use" attitude of the project. This could not be further
3.
by 256 6y ago
The problem with this in practice is that you're often not the person implementing the 3rd instance. It's some other dev who comes and sees 2 copy/pasted implementations, either figures there's a good reason for it, or i
4.
by 256 7y ago
Probably elwell is a Dvorak user. hu is pressed with both index fingers in their home positions in Dvorak.
5.
by 256 7y ago
There are a lot of other differences between America and China that make this a terrible comparison.
6.
by 256 7y ago
I don't think that's fair. D interfaces with C++ better than any other language I can think of. See https://dlang.org/spec/cpp_interface.html
7.
by 256 7y ago
I wrote the python compiler. It's very slow. With the optimizations it's probably something on the order of O(n^3) or O(n^4). One of the test cases took seconds to compile. I made no effort to optimize the compiler speed.
8.
by 256 7y ago
There is a mandatory compilers-lite course at UW and he teaches the advanced version of it, where the project is to fill in pieces of a Scala-lite compiler written in Scala.
9.
by 256 7y ago
Hi. I wrote the python implementation. I've had prior experience with compilers and I'm obviously biased but I would say it's quite readable. The main compiler part (without optional features or the LR(1) or lexer generator)
10.
by 256 9y ago
I'm guessing this is because most people who trade tether don't intend on holding it for long, so the "shennanigans" surrounding tether aren't as likely to affect them.
11.
by 256 9y ago
I haven't looked for any lectures because I learn best from reading books. So, I don't know, sorry. I'm interested in a solution set too.
12.
by 256 9y ago
I don't know much about AI but for ML specifically Elements of Statistical Learning is fantastic. I find its explanations a lot easier to understand than other resources. I recommend you skim through it to get a taste. Additionally if
13.
by 256 9y ago
This is indeed an interesting problem. If you just want to minimize the number of rectangles there is a neat solution on stackoverflow [1] that uses minimum vertex cover (equivalently, bipartite maximum matching). [1] https://sta
14.
by 256 9y ago
Have you tried lite.qwant.com? It's pretty usable for me in w3m, although still not as nice as DDG.