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.
Please follow our Code of Conduct when interacting with our instance. Hate speech violates section 3.5 and in this instance is severe enough to lead directly to a temporary ban instead of the usual warning. Repeated offences may lead to a permanent ban.
Looking at your instance handle, I hope/assume that your comment is supposed to be in lighthearted jest. However that would only be an assumption on my part and in general it's not ok to say someone's job/work tool is for [remarks directed at sex, gender, ethnicity, orientation, disabilities, etc...] per CoC 3.5.
Please take into consideration that members on this instance may be of different backgrounds than what you're used to and interpets what you say differently. Further breaches of our Code of Conduct may lead to temporary or permament ban.
programming.dev will migrate over to (lemmy compatible) Sublinks once it's ready, which will feature a different set of mod features. For that reason we will need new moderators to have an active programming.dev account. If you're willing keep an active user account on our instance let me know. We would prefer people we know will actively use their mod account to make sure reports are handled in a timely manner.
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.
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,
Whenever I click on the link it prompts me to register on kbin. Is it a closed off instance?
Got a Sony Xperia premium XZ from 2017 with the latest update being from 2019, android version 9
Please have a second read of our Code of Conduct which you agreed to follow when signing up to our instance. Being purposefully hostile is not in line with that agreement.