grep_it

I've had good success with just using mypyc (https://mypyc.readthedocs.io/en/latest/introduction.html) on typed python code.

Lamport lists his collected works on his site[0] along with some commentary for each one, and directly mentions, The Maintenance of Duplicate Databases, as the origin for logical clock paper. Many of the notes have interesting commentary.

> Many computer scientists claim to have read it. But I have rarely encountered anyone who was aware that the paper said anything about state machines. People seem to think that it is about either the causality relation on events in a distributed system, or the distributed mutual exclusion problem. People have insisted that there is nothing about state machines in the paper. I've even had to go back and reread it to convince myself that I really did remember what I had written.[1]

0: https://lamport.azurewebsites.net 1: https://lamport.azurewebsites.net/pubs/pubs.html#time-clocks

Did you read the article?

“[…]because we can generate 1.2 METRIC BAJILLION valid URLs just for a single fork of linux.git.”

Sibling comment touched on it, and I guess rust does offer just that, but void casting and doing explicit offset checks for a field is one reason. You can kind of think of it like a tuple in that way and a db engine might use a similar technique.

I think the size of linked binaries and simplicity were always the main features?

This reminds me how you can save a bunch of bytes just by making sure your structs are aligned. In go for example:

  type Wasteful struct {
    a int16
    b int
    c byte
  }

  type Aligned struct {
    b int
    a int16
    c byte
  }

Will have sizes of 24bytes and 16bytes (on a 64bit system). Same data 8bytes more. If you are storing millions of those objects, then it adds up.

I always come back to this game whenever I'm at a hotel for a conference waiting for the elevator.

Awesome resource, thanks for sharing!

Except that eventually you'll find you lose a write when things go down because the page cache is write behind. So you start issuing fsync calls. Then one day you'll find yourself with a WAL and buffer pool wondering why you didn't just start with sqlite instead.

Last I heard, DuckDuckGo backend was Perl.

Relevant: https://db.cs.cmu.edu/papers/2022/cidr2022-p13-crotty.pdf

I love the authors style!

Computer Vision: Algorithms and Applications 2nd Edition is free to download for personal use at https://szeliski.org/Book/

Really enjoyed this article, thanks for sharing!

I had recently learned about using image pyramids[1] in conjunction with template matching algorithms like SAD to do simple and efficient object recognition, it was quite fun.

1: https://en.wikipedia.org/wiki/Pyramid_%28image_processing%29

I'm actually not all that opposed to some of these features, but the way it's implemented is so clunky. The UI make it feel like a half baked browser extension.

Is this rage-bait? A language alone doesn't dictate reliability. There are tons of large scale systems out there running on Python. As for the language being, "flawed irreversibly", I'd be curious to hear you expand on that with examples.

I still use pycharm, but these days I satisfy my debugging with pudb (https://pypi.org/project/pudb/) which has been amazing and a good middle ground for the integrated debugger feel.

These are all great projects! When I find myself getting burnt out in my job I find that writing a little toy project usually helps be get back some spark. Some projects that weren't listed that I've enjoyed:

- GUI based bot for a small video game

- raft consensus algorithm

- ray casting

- simple b-tree or lsmtree storage engine

I'll also second chip8 emulator as being a good quick fun one! It helps there are ROMs that help quickly validate you implementation also (https://github.com/Timendus/chip8-test-suite)