Testcontainers uses ‘ryuk’ to clean up containers and it needs docker socket mounted within its container to work. So if you had any hardening config that prevents the docker socket access within a container e.g user namespace or SELinux then Testcontainers doesn’t work.

And I think it would be nice if Testcontainers ‘just worked’ with Podman without any additional steps.

Nothing else. Though docker socket issue was important enough.

1. It might be a card grabber.
2. Don’t put real card details of course.

It wants you to put dummy details as fast as you can.

It is a game, but it might also be a card grabber.

I did not make this, and you’re supposed to put dummy details there. Don’t put actual credit card information.

Thanks man, my brain was short-circuited on Testcontainers so I couldn’t write better. Also I am stealing the title.

I don’t get it, how would a database container run your unit tests? And unless you know some secret option to stop the database after, say, it is idle for a few seconds, it will continue running.

The purpose is to test database dependent code by spinning up a real database and run your code against that.

No… too hard.

npm ruin dev running shittier could be a nice prank… depending on how often it gets typed.

That advertisement would be interpreted as Node C’s advertisement.

The plan is to treat public keys as node’s identity and trust mechanism similar to OpenPGP (e.g. include any node key signed by a master key as a cluster member)

Right now, none of the encryption part is done and it is not a priority right now. I need to first implement transitive node detection, actually forward packets between nodes, some way to store and manage routes, and then trust and encryption mechanisms before I’d dare to test this stuff on a real network.

The UI is desktop only for now, I’ll make the mobile UI some day.

I didn’t know the answer either, but usually you can compose solution from solutions of smaller problems.

solution(0): There are no disks. Nothing to do. solution(n): Let’s see if I can use solution(n-1) here. I’ll use solution(n-1) to move all but last disk A->B, just need to rename the pins. Then move the largest disk A->C. Then use solution(n-1) to move disks B->C by renaming the pins. There we go, we have a stack based solution running in exponential time.

It’s one of the easiest problem in algorithm design, but running the solution by hand would give you a PTSD.

Replacing “Programmers:” with “Program:” is more accurate.

1 a : to propel oneself in water by natural means (such as movements of the limbs, fins, or tail) b : to play in the water (as at a beach or swimming pool) 2 : to move with a motion like that of swimming : glide a cloud swam slowly across the moon 3 a : to float on a liquid : not sink b : to surmount difficulties : not go under sink or swim, live or die, survive or perish— Daniel Webster 4 : to become immersed in or flooded with or as if with a liquid potatoes swimming in gravy 5 : to have a floating or reeling appearance or sensation

https://www.merriam-webster.com/dictionary/swim

Apparently, swimming inherently requires a liquid.

I am glad that atleast it ends there. It could have been worse.

Gosh, if I ever get into the business of writing software for spacecraft with long duration missions, I have to test for such cases.

Go: Why is your every second sentence a caution?

Even worse, they connected cables.

https://en.wikipedia.org/wiki/Plugboard