Aren’t mayors in all countries politicians? In Denmark all mayors are identified with their party association when talked about in the news.

Reviewing various western democracies it looks like most mayoral candidates run affiliated with a political party. The exception is Canada where mayoral candidates run an independent campaign.

> The exception is Canada where mayoral candidates run an independent campaign.

That's not universal. The City of Vancouver for example has a party system, though the parties are largely not affiliated with provincial or federal parties. There are exceptions there as well though - the Vancouver Greens are affiliated with both the provincial and federal Green parties.

Most of the large city mayoral races in the U.S. are partisan. But I'm not sure how it breaks down by state in the U.S. for small towns.

On the other extreme is India where even university student coucil candidates are associated with national political parties.

Maybe it's the exception rather than the norm, but in Canada, municipal, provincial, and federal parties are generally separate. Montreal, for example, is currently led by Projet Montréal, which has no formal ties to any provincial party. Likewise, the current provincial party, the CAQ, has no formal affiliation with any federal party.

Canada here (Ontario really, probably varies by province) - our mayors and city councilors are politicians but they're explicitly forbidden from running as part of a party. Which I honestly think works so well it should be extended to all levels of politics.

Famously, the US founding fathers warned against the dangers of political parties, only to see them spring up in the US anyways. You really need to design your political system carefully so that there is no incentive to form political parties. I don't know if anyone has ever successfully done this. People should be thinking about it more though.

Specifically, I think a political party happens when two politicians make a bargain that they will each vote for some of the other politician's policies. They don't have to call it "the X party" for it to be a de facto political party.

There are some offices which are designated as nonpartisan here in the US too, I think they are typically offices which don't have a lot of scope for this sort of bargaining. If they did have scope for such bargaining, I wouldn't want to rely on the honor system in the long term. I would want to codify it into law somehow. But how? The best way is probably to reduce the incentive for striking bargains somehow? Again, how? Or maybe bargains are just a distraction, and the real problem lies elsewhere? As I said, people should be thinking more.

The warning about factions wasn't to avoid them. It was that with humans factions are inevitable. The argument was to design a government were the power of factions are minimized or pitted against each other.

In Canada's largest city the mayor is firmly and strongly associated with the NDP. "Chow served as the New Democratic Party member of Parliament for Trinity—Spadina from 2006 to 2014."

And yet that was not the central in her run for mayor at all (I live in that city). She campaigned on policy, not on party branding, like every other candidate did.

in may places eg canada they don't have an explicit party affiliation. obviously they still have a political slant.

Well, define politician.

Some cities have non-partisan mayoral elections. For example, Miami does this under Home Rule charter.

Still, it's often clear who's who. For example, Emilio González prominently displayed a POTUS lapel pin during a debate and bragged about being able to interface with Trump and DeSantis.

I’d say that’s pretty good behavior. It used to be common that images would expand in ways that would not allow you to zoom in mobile devices but also not allow you to open the image directly

Mutability was by far the most difficult thing when learning Python and mutating objects by iterating over its items do get confusing, even as a senior.

When I was first learning I thought all methods would mutate. It has a certain logic to it

I'm confused, I thought all ducklakes works like this. The lake is only storage and the client is the database engine.

My gut reaction is that both NaN == NaN and NaN != NaN should be false, it to put it another way, NaN != NaN returns True was a surprise to me.

Does Numpy do the same? That’s where I usually meet NaN.

In a perfect world, in my opinion is that they are incompatibles, and the equality operation should return False in both cases.

But equality is a very complicated concept.

I guess if the values are incomparable != preserves PEM

But Boolean algebra is a lattice, with two+ binary operators were two of those are meet and join with a shared absorbing property.

X == not not X being PEM, we lose that in NP vs co-NP and in vector clocks etc…

But that is just my view.

For the built-in float type in Python, the behaviour is a bit funny:

    >>> nan=float('nan')
    >>> a=[nan]
    >>> nan in a
    True
    >>> any(nan==x for x in a)
    False

(Because the `in` operator assumes that identity implies equality...)

Well no, the in operator is just defined to produce results equivalent equivalent to any(nan is x or nan==x for x in a); it is counterintuitive to the extent people assume that identity implies equality, but the operator doesn't assume that identity implies equality, it is defined as returning True if either is satisfied. [0]

Well, more precisely, this is how the operator behaves for most built in collections; other types can define how it behaves for them by implementing a __contains__() method with the desired semantics.

[0] https://docs.python.org/3/reference/expressions.html#members...

Yes, in numpy we also have that `np.float64(nan) != np.float64(nan)` evaluates to true.

Some people love this, and hunt for the perfect ligature overloaded programming font. Fira Codes popularity is often credited to its tons of ligatures.

I hate it too.

My understanding is, people who only get subtitles from anime have very particular subtitle preferences.

As someone who grew up where 90% of TV was subtitled I find the “bad” anime subtitles much better.

I also grew up where 90% of TV was subtitled (Finland, where, incidentally, the author of the article is from too), but I find the "good" anime subtitles better – for the simple reason that they make it easier to see which translation corresponds to which text.

Note that anime has generally more text on the screen that many western shows, so I think subtitling practices of some subtitle-heavy western countries, while informed and proven by time, don't necessarily represent optimal practices for anime.

But I think you are correct about the subtitle preferences of anime fans. The "general wisdom" of audiovisual translations is that great translations manage to convey the important point very succinctly, and a professional translator knows how to shave off the fluff to achieve subtitles that are quick to read and "fade in the background" in the sense that you don't even realize that you are reading them.

However, many anime fans actually LIKE so-called foreignizing translations ( https://en.wikipedia.org/wiki/Domestication_and_foreignizati... ). I think this plays into the fancier subtitle preferences too.

Ultimately what one would really want is not better subtitles but a localized version with on screen text replacement by overlay. The kanjis would simply disappear. A lot of shows were successfully translated and localized in the 80's and 90's in various countries, there is no reason we couldn't do that anymore. The only reasons they aren't doing it anymore is cost reduction.

We do mail voting from embassies or consulates when abroad.

To me, the really big win would be _not_ to have to sort at all. Have an option to keep first or last duplicate and remove all others while keeping line order is usually what I need.

That's easy to do if you're keeping the first duplicate. It becomes complex if you're keeping the last duplicate, because every time you find a duplicate you have to go back through your "output" and delete the earlier occurrence.

You could do an annotating pass for learning which of each line is the last one, and then a followup pass for printing (or otherwise echoing) only the lines that are the last of their kind. Technically still faster than sorting.

You could also keep the information on last occurrence of each line in the hash map (that's where it's going to be anyway), and once you're done with the first pass sort the map by earliest last occurrence. That will get you the lines in the right order, but you had to do a sort. If the original input was mostly duplicates, this is probably a better approach.

You could also track last occurrence of each line in a separate self-sorting structure. Now you have slightly more overhead while processing the input, and sorting the output is free.

> It becomes complex if you're keeping the last duplicate, because every time you find a duplicate you have to go back through your "output" and delete the earlier occurrence.

Can't you reverse file | keep first occurrence | reverse output?

Is reversing the file an improvement over making two passes?

I've written this kind of function so many times it's not funny. I usually want something that is fed from an iterator, removes duplicates, and yields values as soon as possible.

I've added this functionality to `hist-0.1.5` with a benchmark of other tools that do this on the CLI

Why? The point is not to train bots one way or another, it’s to keep them busy in low resource activities instead of high resource activities.