stiff

10 ms·

31.
by stiff 8y ago
Most of the kernel code is in the drivers, the general purpose subsystems (VFS, I/O scheduler, task schedulers, memory management etc.) are a small fraction of those 25 million LOC and largely independent of each other so it is not tha
32.
by stiff 8y ago
To read a file into a string you actually do this: (with-temp-buffer (insert-file-contents filePath) (buffer-string)) but if you work with file contents as strings in Emacs Lisp, you are going to have a bad time, because perf
33.
by stiff 8y ago
To write code that performs decently in Emacs-Lisp, you have to work with buffer contents rather than substrings, and it is just another frustration, the primitives for working with buffer contents are low level and heavily stateful, you
34.
by stiff 8y ago
If you are used to any reasonably modern programming language, writing any serious Elisp is an exercise in frustration, it is hard to even find out at all how to accomplish basic things, and once you do, there are tons of pitfalls, it is a
35.
Ask HN: Your great learning experience
2 points by stiff 8y ago|1 comments
36.
by stiff 8y ago
I am not a reader of The Old New Thing, but it seems LWN fits what you are looking for: https://lwn.net/ The page is a bit difficult to navigate, and some articles are subscription only, but see e.g. the articles here: htt
37.
by stiff 8y ago
Implementing an evaluator for infix parenthesized arithmetic expressions, like "5*(1+2)+60", is a good starting point. You can begin with writing a tiny lexer and a recursive descent parser that simply writes out the value of an e
38.
by stiff 8y ago
This kind of practice is at least as early as yoga: https://en.wikipedia.org/wiki/Shavasana https://en.wikipedia.org/wiki/Yoga_nidra
39.
by stiff 9y ago
Springer has problem books with full solutions: https://www.amazon.com/Problem-Book-Analysis-Books-Mathemati... https://www.amazon.com/Problems-Solutions-Undergraduate-Anal... The second one is for Lang&#x2
40.
Mastering Linux performance: CPU time and CPU usage(jaroslawr.com)
2 points by stiff 9y ago|0 comments
41.
Mastering Linux performance – CPU time and CPU usage(jaroslawr.com)
5 points by stiff 9y ago|0 comments
42.
Mastering Linux performance – CPU time and CPU usage(jaroslawr.com)
4 points by stiff 9y ago|0 comments
43.
Mastering Linux performance – CPU time and CPU usage(jaroslawr.com)
3 points by stiff 9y ago|0 comments
44.
by stiff 9y ago
It is worth noting that Paul Halmos was an assistant of von Neumann's: http://www-history.mcs.st-andrews.ac.uk/Biographies/Halmos.h...
45.
by stiff 9y ago
I like this little book, in very small amount of space it teaches you how to build a bare bones OS, from there you can start doing your own experiments which I think is the best way to really learn something: https://littleosbook
46.
by stiff 9y ago
Peter Norvig has this unique style where he explains his design process in detail, including exploring the problem on example cases, writing multiple solutions, the thinking involved in moving from one solution to the next one, including pr
47.
by stiff 9y ago
This is also known as the principle of charity: https://en.wikipedia.org/wiki/Principle_of_charity
48.
by stiff 9y ago
In probability theory, when dealing with continuous sample spaces / random variables, events with probability 0 still have a chance of occurring, and events with probability 1 stil l have a chance of NOT occurring, see: https:/&#
49.
by stiff 9y ago
I did run it back in the day, it works, I think it just happens to assume a 32 bit OS. You can fix the gist by changing this: I *ma(n){ R (I*) malloc(n*4); } to: I *ma(n){ R (I*) malloc(n*8); } Note that it's a very tiny
50.
by stiff 9y ago
Once you get past the formatting and cryptic variable names it's actually a pretty straightforward program, have a look at one of the older threads if you are interested in understanding it: https://news.ycombinator.com&#x2F
51.
by stiff 10y ago
Kent Beck has an article that is a nice complement to this one: https://www.facebook.com/notes/kent-beck/mastering-programmi...
52.
by stiff 10y ago
It's actually a transpiler written in Python that generates Go code.
53.
by stiff 10y ago
estimated that the PS codebase could be reduced from 3,000,000 LOC to 30,000 LOC (=100x!!) I challenge anyone making such claims to construct an even _moderately_ realistic example of where such reduction would be possible. Here is a very
54.
by stiff 10y ago
The New Turing Omnibus: https://www.amazon.com/New-Turing-Omnibus-Sixty-Six-Excursio... Algorithmics: The Spirit of Computing: https://www.amazon.com/Algorithmics-Spirit-Computing-David-H...
55.
by stiff 10y ago
Those kinds of projects are valuable not because of any significant chance of having to do something similar professionally, but because doing them gives you a fuller and more mature mental model for programming. Doing the larger projects l
56.
by stiff 11y ago
SICP explores real, interesting programs: a digital circuit simulator, an automatic differentiator, etc., in a sense it explores mathematics and electrical engineering in parallel to computer science and shows a certain unity between all th
57.
by stiff 11y ago
Feynman also said the following (in the "The Character of Physical Law" lectures): Every one of our laws is a purely mathematical statement in rather complex and abstruse mathematics. Newton's statement of the law of gravita
58.
by stiff 11y ago
From the article: I've tried to answer this question as the conjunction of four concerns: What should every student know to get a good job? What should every student know to maintain lifelong employment? What should ever
59.
by stiff 11y ago
There is more harm in the notion that there is anything at all that absolutely everyone needs to know to succeed than there is benefit from the contents of such lists themselves (which boil down to "everyone needs to know what I know&q
60.
by stiff 12y ago
Please do not do it: http://stackoverflow.com/questions/16891729/best-practices-s...

More ›