Oh, Scala...I thought the language was practically dead.
Scala (with ZIO) is still the only language I know that lets me write a fairly complex program with a few unit tests, and then run it without any bugs.
Readit Newserikvanoosten commented on Capture Checking in Scala nrinaudo.github.io/articl... · Posted by u/nrinaudo
There's a few pain points with containers; whenever I'm browsing in a container tab, I wish CMD-T opened a new container tab, not my default tab. I haven't been able to find a setting for this :/
I also wish there were more keyboard shortcuts for opening links in specific containers, or re-opening a current tab in a different one.
I know you can set certain domains to always open in certain containers - fine for Facebook, when I occasionally have to use it - but annoying when I'm trying to do things in different (e.g.) Bluesky accounts.
Open a new tab for a certain container with Cmd-1 (or Cmd-Shift-1, I forgot) for the first container in your list, with 2 for the second, etc.
I haven't seen the makers of Aeron (or anyone else) claim it's "orders of magnitude faster than plain UDP." Do you have a link to something about this? It doesn't pass the smell test for me unless you're talking specifically about using Aeron within a single machine (where it uses shared memory instead of the network)...but you said "Within a datacenter" not "Within a computer."
It has been a while since I saw their presentation. What I remember is that Aaron has an insanely low delay even in the high percentiles, that is orders of magnitude better. Throughput for a large stream of data is probably similar to plain UDP.
Please correct me if I remember wrong.
I wonder how many times reliable UDP has been implemented? It's gotta be gazillions...
With Aaron I would think the focus should be on 'efficiënt', not reliable. Within a datacenter they are orders of magnitude faster than plan UDP. You get this crazy efficiency at the cost of reduced flexibility in how you send messages.
erikvanoosten commented on The Fastest Way yet to Color Graphs quantamagazine.org/the-fa... · Posted by u/GavCo
Wrong. You can convert edge-coloring problems into vertex-coloring problems of the so-called line graph: https://en.m.wikipedia.org/wiki/Line_graph
But the opposite is not true, because not every graph is a line graph of some other graph.
Indeed. Thanks, I stand corrected.
erikvanoosten commented on The Fastest Way yet to Color Graphs quantamagazine.org/the-fa... · Posted by u/GavCo
In case you haven't looked at the article, this is looking specifically at the Edge Coloring problem and not the more commonly known Vertex Coloring problem. Vertex Coloring is NP-complete unfortunately.
You can convert edge coloring problems into vertex coloring problems and vice versa through a simple O(n) procedure.
erikvanoosten commented on Nvidia's Project Digits is a 'personal AI supercomputer' techcrunch.com/2025/01/06... · Posted by u/magicalhippo
> It’s a cloud computing platform that sits on your desk …
This goes against every definition of cloud that I know off. Again proving that 'cloud' means whatever you want it to mean.
erikvanoosten commented on The Hexagonal Tiling Honeycomb arxiv.org/abs/2412.00048... · Posted by u/belter
I wonder how this compares to H3. Why does H3 has pentagons as well, and this doesn't?