for-linux VS array

Software Version Description Docker Engine Version 20.10.10-ce+ or higher For installation instructions, see https://docs.docker.com/engine/installation/ Docker Compose docker-compose (v1.18.0+) or docker compose v2 (docker-compose-plugin) For installation instructions, see https://docs.docker.com/compose/install/ OpenSSL Latest is preferred Used to generate certificate and keys for Harbor

Install the Docker CLI.

Reading the GitHub issue about this is somewhat entertaining: https://github.com/docker/for-linux/issues/690

People are getting hacked a lot because of this, and docker doesn't seem to care all that much.

Docker: A tool for building, running, and managing Docker containers

possibly useful: https://github.com/docker/for-linux/issues/690 (Docker bypasses ufw firewall rules)

Sure - I work in an environment where I have to be on the VPN to access Snowflake. I also have to use Windows. The easiest dev environment for that is to install WSL2 and do the development in Ubuntu therein. However, the way that WSL2 manages Ubuntu is through some Windows host processes instead of the daemons that typically are used when you run Ubuntu. You can search around and find various reports about this - it manifests as "Cannot connect to the docker daemon." Here is one example from a quick search. On Windows, the way that you can easily get around that, if your org supports it, is to run Docker Desktop for Windows, which then manages that daemon process. That's all fine and good, but WSL has issues with routing traffic through VPNs for some reason. Again, here is a quick example of the type of things you'll find when you Google about this problem.

For a more universal configuration, setting the ip option in Docker's daemon.json file should tell Docker to only bind to that IP address. It does sound like there may be some bugs with this setting though, so your mileage may vary.

One workaround I've found is: https://github.com/docker/for-linux/issues/1437

Thank you. Your link is probably solution, it looks similar to the post I found before on github (and I was afraid to use it).

In some of the example programs written in KAP (my APL derivative), I tried to write it in a style that makes people unfamiliar with the array style more comfortable.

This code could of course have been written in a style similar to some of the more extreme examples, and they would have been significantly shorter in that case.

https://github.com/lokedhs/array/blob/master/demo/advent-of-...

This issue isn't directly related to BitSet. I have observed the same thing in my programming language interpreter that runs on the JVM (well, it's written in Kotlin multiplatform so it runs on JS and Natively as well).

I start the interpreter and measue the time it takes to all all then numbers below 1000000000.

The first time I run it after starting the interpreter it always takes 1.4 seconds (within 0.1 second precision). The second time I measure the time it takes 1.7, and for every invocation following that it takes 2 seconds.

If I stop the interpreter and try again, I get exactly the same result.

I have not been able to explain this behaviour. This is on OpenJDK 11 by the way.

If anyone wants to test this, just run the interpreter from here: https://github.com/lokedhs/array

To run the benchmark, type the following command in the UI:

    time:measureTime { +/⍳1000000000 }

I'm the opportunity to mention my project that implements a language that is inspired by, and is mostly compatible with APL. It has some major differences, such as being lazy evaluated and providing support for first-class functions.

It also supports defining syntax extensions which is used by the standard library to provide imperative syntax, which means you can mix traditional APL together with your familiar if/else statements, etc.

At this point there isn't much documentation, and the implementation isn't complete, so I'm not actually suggesting that people run out to try it unless they are really interested in APL. I just took this opportunity since APL is mentioned so rarely here.

https://github.com/lokedhs/array

There is an example of a graphical mandelbrot implementation in the demo directory, that may be interesting.

This post mirrors my feeling on this topic as well. Just like the author, I'm also working on a programming language which will not be used by a lot of people.

In fact, having a lot of users would make things complicated as I would have to stop making incompatible changes if I want to try something new.

Designing your own programming language is such a nice hobby, and something I believe a lot of programmers do. In fact, I would like to see links to other people's programming languages, just to see what people are playing around with at the moment.

Here is my project: https://github.com/lokedhs/array