Do you have font sizes turned up in your OS? Looking at the site in Chrome on my OnePlus 6 (phone), it's maybe a tiny bit large meaning around 40 characters fit on a single line, but that is far from unreadable.

I've checked a few browsers on desktop and it seems to be no problem at all there, with the added benefit that most (or all?) modern browsers let's you easily change the font size that is used with Ctrl +/- (or Cmd) on almost all sites. For instance, I have the fonts scaled to 125% here on HN since I find them a bit small normally. (You can do that on mobile as well, but I'm not sure if that works on a per-site basis like how it works on desktop.)

Inline styles can't include media queries so if you want your styling to be responsive (which you probably want) you are going to need to write some CSS in a file and not have it inline.

Picking out that line in particular, sure you might be right, but there's more to it, from the first quote from the parent.

> Uber determines the price of the ride; Airbnb doesn’t set the rent. Uber sends an order to a specific driver; Airbnb merely provides a prospective guest with a list of properties. Uber, according to Thursday’s ruling, exercises “decisive influence” over the transaction. That’s not the case with Airbnb.

Alright, I'll bite the bullet. What's "Ligma"?

Maybe I'm missing something obvious here, but that's what the video is about?

The video is a basic introduction to the fast-growing hierarchy. They do state where Graham's Number sits in the hierarchy, but the explanation doesn't go as far as to say where TREE sits.

It does actually. It says it grows faster than anything in the hierarchy.

Faster than anything in the Wainer hierarchy (which ends at $f_{\epsilon_{0}}(n)$. But it's reasonably easy to define a fast-growing hierarchy that uses the Veblen hierarchy of ordinals for the subscripts. Then TREE is $f_{svo}(n)$ where $svo$ is the limit of the finitary veblen sequence as the number of elements goes to $\omega$ (aka the small veblen ordinal).

According to MDN `arr.flatMap()` is indeed equivalent to `arr.map().flat()` (without the Infinity). [1] Testing in the Chrome Devtools it also seems to be the case:

  x = [[[1, 2]], [[2, 3]], [[3, 4]]]
  x.flatMap(x=>x)
  output: [[1,2], [2,3], [3,4]]
  x.map(x=>x).flat()
  output: [[1,2], [2,3], [3,4]]
  x.map(x=>x).flat(Infinity)
  output: [1, 2, 2, 3, 3, 4]

[1]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Refe... > It is identical to a map() followed by a flat() of depth 1, but flatMap() is often quite useful, as merging both into one method is slightly more efficient

Is there any reason it isn't called mapFlat? FlatMap indicates to me that there's a flattening, then a mapping, not the other way around.

Ah, I missed that. I though flatMap had depth of Infinity.

"Due to the nature of JSFiddle, anyone can post anything", therefore "wallet codes are ok" since "anyone can post anything".

A shadow ban normally means that you, the creator, can see your content, but nobody else can. So them shadow banning people who post wallet codes is the direct opposite of allowing wallet codes.

You could run something like this in the console:

    window.addEventListener("keydown", function(e) {
        // space and arrow keys
        if([32, 37, 38, 39, 40].indexOf(e.keyCode) > -1) {
            e.preventDefault();
        }
    }, false);

That will prevent the scrolling when pressing the arrow keys. It's of course not a perfect solution, and something more robust would be to check if a game is currently running and so on, but it works as a quick hack.

I thought it looked like a bug, but it's a feature based on which level you are on and how many lines you've filled(?). Here's the part that decides if it should fill or not: https://github.com/raulgrell/tetris/blob/master/src/main.zig...

I concur. Taking his statement as meaning all of college is a bit disingenuous. It's more about the feeling that you "have" to go to college no matter what you study. Of course if you want to become a doctor you need to go to college, but going to college just for having been to college is not something we should encourage young people to do.