Hi

Can you update the title to be the same as the updated title in the news article?

The (successful) end of the kernel Rust experiment

Please don't stalk/harass our users, it can and will lead to a site wide ban if reported.

I've replied to dessalines

I can only report on what I've been told by those who have directly dealt with the reports, my apologies if parts of the phrasing are inaccurate/poorly made. I'll make a note that we should probably reach out to relevant moderators beforehand next time we make similar actions.

As for differing sensibilities, I'm not sure most people would classify this kind of content as safe to browse at work/in public.

Regardless, we are not here to make demands or argue on how other instances moderate their own content. This post is made mainly to keep our actions transparent to our local users.

If it's your own blog you're free to share it in whatever manner you like. If it's not your own blog you should respect the wishes of the author, meaning ask for permission if you want to copy paste the entire blog. Otherwise, excerpts alongside credits to the author is fine.

Personally I would recommend to use regex instead for parsing, which would also allow you to more easily test your expressions. You could then get the list as

import re
result = re.findall(r'[\w_]+|\S',  yourstring)  # This will preserve ULLONG_MAX as a single word if that's what you want

As for what's wrong with your expressions:

First expression: Once you hit (, OneOrMore(Char(printables)) will take over and continue matching every printable char. Instead you should use OR (|) with the alphanumerical first for priority OneOrMore(word | Char(printables))

Second expression. You're running into the same issue with your use of +. Once string.punctuation takes over, it will continue matching until it encounters a char that is not a punctuation and then stop the matching. Instead you can write:

parser = OneOrMore(Word(alphanums) | Word(string.punctuation))
result = parser.parseString(yourstring)

Do note that underscore is considered a punctutation so ULLONG_MAX will be split, not sure if that's what you want or not.

Stickied post would work just fine yeah, can't really expect the developer to set up a public repo for just tracking features. Hopefully Ruben takes notice.

Those doesn't break backwards compatibility though. Naturally you can't use match with a python 3.7 interpreter, but what scripts written for python 3.7 wouldn't work with a 3.11 interpreter?

I haven't encountered that issue before, so I'm curious what those problems OP have encountered looks like.

I assume you meant that both Rust and C compiles into machine code? Python compiles into bytecode that is then run in a VM, Rust and C usually doesn't do that as far as I know.

I was mostly curious if it was as easy as in C. Turun's reply answered that question though. Cheers.

Boost isn't FOSS is it?

Since it's variations of the combined ending, each permutation would count as unique. Meaning that 10 companions with 10 endings each would total 10.000.000.000 variations,

I'd argue stackoverflow got a fair point for their policy. I'd ask the bot directly if that's what I wanted.