The latest blog posts to take off on Hacker News. 14,543 posts.
Due to sheer coincidence of several unrelated tasks converging on Python at work, I recently needed to brush up on my Python skills. So far for me, Python has been little more than a fancy extension language for BeautifulSoup , though I also used it to participate in the recent tradition of writing one’s own static…
Software rots. That is: Adapting mature software to new circumstances tends to take more time and effort than writing new software from scratch. Software people don't like to admit this, but open so…
The blog of Seva Zaikov
This is a program that determines many properties of the C compiler and machine that it is run on, such as minimum and maximum [un]signed char/int/long, many properties of float/ [long] double, and so on.
A different approach to handle your conditions...
There are so many programming books out there, sometimes it's hard to know what books are best. You won't find cracking the coding interview, the pragmatic programmer, or even the best python book. These are the best programming books curated from each major Software field.
As discussed in Pattern Matching and Recursion , a well-known programming puzzle is to write a function that determines whether a string of parentheses is “balanced,” i.e. each opening parenthesis has a corresponding closing parenthesis, and the parentheses are properly nested.
Sharing and reusing memory buffers is inescapable if we want high performance. It is a sharp but powerful tool.
A common example of recursion is the function to calculate the $n$-th Fibonacci number: def naive_fib(n): if n < 2: return n else: return naive_fib(n-1) + naive_fib(n-2) This follows the mathematical definition very closely but it’s performance is terrible: roughly $\mathcal{O}(2^n)$. This is commonly patched up with…
To learn Rust, I implemented an audio game. There were some things I liked and some things I didn't. Some things were easy and some were hard. And there were plenty of libraries that were a joy to use.
In episode 1 of the Swift Community Podcast, Chris Lattner, Garric Nahapetian, and John Sundell talked about the origins and the current state of Swift. This is an edited transcript of the most interesting parts of the conversation.
If you like this blog, you should follow it via RSS and read older posts . Here are the recent posts:
Hello, world.
A summary of my undying love for LD_PRELOAD.
COCOL88 merupakan juragan yang sangat terpercaya dalam lingkup permainan online gacoryang mempunyai skill keamanan yang sangat tinggi dan persentase kemenangan yang akurat dengan fitur RTP yang disediakan oleh situs COCOL88
PostgreSQL 11 offers the best OVER clause support among its competitors, true procedures, and improvements in FETCH FIRST and XML.
I am starting to realize that the Unix command-line toolbox can fix absolutely any problem related to text wrangling. Let me tell you about a problem I had, and how I used some Unix command-line utilities to solve it.
After a while, I decided a write a short blog post about Linux binary reversing CTFs in general. How to approach a binary and solving for beginners. I personally am not a fan of Linux reverse engin…
Many people are surprised to learn that `sed`, a seemingly simple text filtering program, is actually Turing complete. This realization prompts the question: how can a text processing utility achieve such computational power? The answer lies in sed's fundamental operations. Essentially, sed functions as a miniature...
A perfect hash function is one that is collision-free. By implication, the hash must be at least as many bytes as the key and the function is theoretically reversible, though not always tractably so. In other words, perfect hashing is a special case of encryption. Because the hash is no smaller than the key, the…
