CMQ: Using the English subjunctive, should it be "it's important that this be", or "it's important that this is"? I know that if you replaced "this" with "you", then the former would be correct, but what about with 3rd-person pronouns?
to me "it's important that this be <x>" implies "we must make sure this is <x>" but "it's important that this is <x>" implies "this is already <x>, and this fact is important"
not sure if that's actually true of how the grammatical structures work though; that's just how the two feel to me
@pxeger If you really want the subjunctive, then "it's important that this be" is correct (Wiktionary conjugation chart, for reference). But I agree with @hyper-neutrino that I'd use the infinitive phrase "it's important for this to be" instead.
Although, I have a lot of work to do, so I'm afraid I'm not going to be able to edit the draft for the next few days. I'd suggest just asking for feedback from anyone, @Fmbalbuena, next time you do so
@Fmbalbuena I'd ask people if they think it's ready to post, I haven't read it since the changes today (and I don't really intend to, as I said, I'm busy)
ffs, if I press the pause button on my keyboard while SE chat is in the middle of playing a ding, it pauses the ding instead of what I'm listening to lol
how do you indicate that an object's optionality is optional? E.g. the is arguably optional in the USA, so I put [the] USA, but in some contexts it isn't optional. Do I surround the [] in [], like [[]the[]] USA (parsed as [[]the[]]USA)?
oh i guess i could see that working if you do that
how many wpm do you get typing like that anyway, i'm curious :p
@pxeger oh, that's interesting. i don't actually have a compose key but if I did it'd probably be right alt - which on my current keyboard layout is the APL key
I don't type properly either, but I use 6 fingers (+ L thumb for space, L pinky for ctrl/shift/alt/super and Escape (which is where caps lock is for me), R thumb unused, and R pinky for enter)
@pxeger When typing A with the left little finger, it's easier to use right shift. But I often just move my hand over and hit the letter key with my left ring finger. I'm not sure how often I actually do this because every time I try to pay attention, I end up confusing myself and hitting both shift keys at the same time. :P
@pxeger Not anymore. I believe Ctrl-Pause was the key combo to kill a QBasic program back in the day, which was very useful for accidental infinite loops. Sadly, it doesn't work on Archive.org.
@cairdcoinheringaahing but they could be earning interest in a savings account on that money, which would probably be higher than the interest you'd pay on a student loan
@cairdcoinheringaahing Legit question from my one:
> Determine the height from which an object must be dropped so that it will have the same speed in ft/s when it lands as the height in feet from which it was dropped.
With all due respect, I'm not going to take the advice of a CGCC member on my family's financial situations over that of a financial advisor, even if I have met that CGCC member IRL :P
@pxeger "Interest in a savings account" yeah I'm sure they're missing their five cents of interest a month lol (if banks over there are anything like ones here)
@pxeger Hm, maybe I should begin by saying that "you probably only want to attempt this in a language with built-in or library support for regexes", and define that "for the purposes of this challenge, regex refers to whatever (ir)regular expressions your chosen language/library supports"?
@Adám I don't know if that will be clear enough, or if there will be sneaky workarounds. Maybe say "I will allow you to use any of the following regex syntaxes: {POSIX, Perl, Python, ...}. If your language's builtin regex syntax is not compatible with any of the above, leave a comment and I might add it to the list."
I suppose you could shrink the challenge by making the input a list of match index ranges, and converting the start of each range and gap-between-ranges into a bit answer
@RedwolfPrograms because which regex flavours are allowed needs to be defined
@pxeger It's not "clever", and you can always say so in the question body ("all flavors are allowed and will not be competing with one another, but inventing trivial or cheaty flavors for this challenge is uninteresting and you'll be downvoted")
Restricting what languages can feasibly compete, over a nonexistant problem, seems stupid
Let's say your Roboto Mono challenge didn't require a minimum proportion of the characters to be recognised. I can just post an answer that "recognises" only the character a and therefore consists of print("a"). That defeats the point of the challenge, doesn't it?
@hyper-neutrino ok, but if the challenge was badly specified enough that that was possible, that's still a problem with the challenge, not (just) with the answer
@RedwolfPrograms All challenges here "allow" submitting a zero or one byte program in a custom language you make
That doesn't make them bad or poorly specified
We've just removed any incentive you'd have to do that
And allowing any regex flavor but not having them compete does that exact same thing. Everyone using Python will probably use Python's regexes. Everyone using Perl will probably use Perl's. But this way, you can use languages with less standard regex libraries without having to ask permission in comments or, worse, re-implement PCRE or something from scratch.
And if anyone were to abuse it, they've won nothing. Aside from a bunch of downvotes because it's a loophole.
@RedwolfPrograms the point of the challenge is basically not related to regexes at all, it's about manipulating the output ranges correctly, so it should be irrelevant what feature set the regex supports
Imagine a challenge "given a blackbox function, return some complicated manipulation on the results of various calls on the function", and then wanting to allow answers to restrict on what type of function you can assume f to be
This challenge is about writing code to solve the following problem.
Given two strings A and B, your code should output the start and end indices of a substring of A with the following properties.
The substring of A should also match some substring of B.
There should be no longer substring of ...
I did mention finding an efficient algorithm for this is interesting to think about, but I'm not generally a fan of restricted-complexity problems on code-golf because then the primary condition is still short code with added bells and whistles, whereas fastest-algorithm just makes being efficient the primary/sole condition which could be interesting
especially if O(L) is actually possible like Bubbler was hypothesizing
@Adám Those are still languages which you're blocking from being able to compete, in addition to any languages based on those, or using regex libraries which use those
Yep! You might just generalize capturing groups to any usage of (), otherwise you wouldn't actually need to support | in groups using your current rules (something which should probably be required)
I had discovered a code on the internet that produced a number and could be tweaked easily to accommodate more or less numbers to generate from. The code was ridiculously simple and filled only one line, but the code was a miracle worker. I switched computers and lost the information and I can't ...
This challenge is about writing code to solve the following problem.
Given two strings A and B, your code should output the start and end indices of a substring of A with the following properties.
The substring of A should also match some substring of B.
There should be no longer substring of ...
