They call Japan itself "Nihon", so what do they know... /s
hades
joined 1 year ago
Surobakia (right next to Cheko)
Is that a real problem? I've never considered that a python package manager should be or could be faster.
To be fair, I don't use python professionally.
Citizen Sleeper, Chants of Sennaar, Papers Please, The Curse of the Golden Idol.
Because he testified against the entire city's worth of mafia?
Awesome! Will definitely check it out. In case you haven't seen it, here's a nice collection of tips for indie game devs: https://develop.games
(I realize this reads as a bot comment, lol, but that's a genuine tip, and that website isn't even monetised as far as I know).
DCSS[1] would alone probably take five years to master.
Dwarf Fortress (although I haven't really played it myself yet).
And, of course, Factorio, that with existing mods has probably enough content for the rest of my life.
There are two ways to create a resume today. One option is to use a resume template, such as an office/google doc, and customize it according to your needs. The other option is to use a resume builder, an online tool that allows you to input your information and automatically generates a resume for you.
Using a resume template requires manual formatting work, like copying and pasting text sections and adjusting spacing, which can be time-consuming and error-prone.
Me just using LaTeX[1] with hundreds of templates[2] with no formatting problems for 18 years now...
I would argue that having distinct match and search helps readability. The difference between match('((([0-9]+-[0-9]+)|([0-9]+))[,]?)+[^,]', s) and search('((([0-9]+-[0-9]+)|([0-9]+))[,]?)+[^,]', s) is clear without the need for me to parse the regular expression myself. It also helps code reuse. Consider that you have PHONE_NUMBER_REGEX defined somewhere. If you only had a method to "search" but not to "match", you would have to do something like search(f"\A{PHONE_NUMBER_REGEX}\Z", s), which is error-prone and less readable. Most likely you would end up having at least two sets of precompiled regex objects (i.e. PHONE_NUMBER_REGEX and PHONE_NUMBER_FULLMATCH_REGEX). It is also a fairly common practice in other languages' regex libraries (cf. [1,2]). Golang, which is usually very reserved in the number of ways to express the same thing, has 16 different matching methods[3].
Regarding re.findall, I see what you mean, however I don't agree with your conclusions. I think it is a useful convenience method that improves readability in many cases. I've found these usages from my code, and I'm quite happy that this method was available[4]:
digits = [digit_map[digit] for digit in re.findall("(?=(one|two|three|four|five|six|seven|eight|nine|[0-9]))", line)]
[(minutes, seconds)] = re.findall(r"You have (?:(\d+)m )?(\d+)s left to wait", text)
[1] https://docs.oracle.com/javase/7/docs/api/java/util/regex/Matcher.html
[2] https://en.cppreference.com/w/cpp/regex
[4] https://github.com/search?q=repo%3Ahades%2Faoc23%20findall&type=code
I'm not sure what a "music jukebox" is, and how it's different from a music player, but I would recommend to try mpd. It should work with your collection, although I don't have personal experience with collections of this size. Some clients might also not have been designed to work with such collections, so probably you'd have to try several.
The T in "ninja" is silent. Silent and invisible.