barubary

There's a lot of distorted facts here, but the weirdest one to me is "instead of regrouping their efforts (which, I might add, they did, and they got their day in parliament)". The first half just contradicts itself ("instead of doing X, which they did, ..."???) and the second half ("they got their day in parliament") is verifiably, obviously false: The EU petition is still ongoing and collecting signatures. The deadline is July 31.

@tetris11 @Aedis More like:

isEven() {    case "$1" in        *[02468]) return 0;;        *) return 1;;    esac;}

(If all the line breaks are gone from this code snippet, blame Lemmy. It looks fine here.)

If you were pair programming, your pair could always create a new failing test with the current implementation.

But I'm not pair programming. And you can't always create a new failing test because int is a finite type. There are only about 4 billion cases to handle.

Which might take a while to type up manually, but that's why we have meta-programming: Code that generates code. (In C++ you could even use templates, but you might run into compiler recursion limits.)

More to the point, the risk with TDD is that all development is driven by failing test cases, so a naive approach will end up "overfitting", producing exactly the code required to make a particular set of tests pass and nothing more. "It can't pass all test cases"? It doesn't have to. For TDD, it only needs to pass the tests that have actually been written. You can't test all combinations of all inputs.

(Also, if you changed this function to use modulus, it would handle more cases than before, which is a change in behavior. You're not supposed to do that when refactoring; refactoring should preserve semantics.)

When you say "it can't pass all test cases", what do you imagine the tests look like?

@devilish666 C++ (non-stupid):

#include <stdio.h>
int main() {
puts("Hello, world!");
}

Prost! 🍻

C) It's an obvious joke.

s/diplomated/graduate/
s/branche/industry (sector)/

Isn't that how B worked?

Similarly, Perl lets you say

my $ret = do {    if (...) {        ...    } else {        ...    }};

To be fair, the C example could be detangled a lot by introducing a typedef:

typedef int Callback_t(int, int);Callback_t *(*fp)(Callback_t *, int);

Both of those declarations look weird to me. In Haskell it would be:

a :: Stringbob :: (String, Int, Double) -> [String]bob (a, b, c) = ...

... except that makes bob a function taking a tuple and it's much more idiomatic to curry it instead:

bob :: String -> Int -> Double -> [String]bob a b c = ...-- syntactic sugar for:-- bob = \a -> \b -> \c -> ...

The [T] syntax also has a prefix form [] T, so [String] could also be written [] String.

OCaml makes the opposite choice. In OCaml, a list of strings would be written string list, and a set of lists of strings would be string list set, a list of lists of integers int list list, etc.