On Saturday, 21 September 2024 at 05:00:51 UTC, user1234 wrote:
On Saturday, 21 September 2024 at 04:29:15 UTC, user1234 wrote:
```d
module m;
[...]
Beside the childish example... D could use a system of
"constraint matching score" to help Carlos. Three AndAndExps
verified should have a better score than two and finally
determine the selection.
Template if constraints are binary, there’s no way to keep a
‘score’. If you want a new syntax for that, you can make a post
in DIP ideas. Otherwise, the bools would have to keep track of
‘how many times a chained logical statement evaluated to true’
which is completely nonsensical.
