Unlike Python (which has operator chaining), C evaluates the condition as: (0 < a) < 5 The result of (0 < a) is either 0 or 1, both of which are less than 5, so the overall condition is true. In C, a range test must be written: 0 < a && a < 5 … Read more
What about boring, old, readable, and shortest yet: float clip(float n, float lower, float upper) { return std::max(lower, std::min(n, upper)); } ? This expression could also be ‘genericized’ like so: template <typename T> T clip(const T& n, const T& lower, const T& upper) { return std::max(lower, std::min(n, upper)); } Update Billy ONeal added: Note that … Read more
It sounds like what you want is really a random permutation of the number 1..N. So, fill an array with consecutive integers 1..N and then shuffle the array. There are well known algorithms for shuffling that you can look up.
Consider using finite domain constraints, for example, in SWI-Prolog: :- use_module(library(clpfd)). puzzle([S,E,N,D] + [M,O,R,E] = [M,O,N,E,Y]) :- Vars = [S,E,N,D,M,O,R,Y], Vars ins 0..9, all_different(Vars), S*1000 + E*100 + N*10 + D + M*1000 + O*100 + R*10 + E #= M*10000 + O*1000 + N*100 + E*10 + Y, M #\= 0, S #\= 0. … Read more
Quoting Java Language Specification, 15.7 Evaluation Order: The Java programming language guarantees that the operands of operators appear to be evaluated in a specific evaluation order, namely, from left to right. The left-hand operand of a binary operator appears to be fully evaluated before any part of the right-hand operand is evaluated. If the operator … Read more
My rule of thumb, which covers basically 99% of all use cases for conditional statements, is: Grouping: () Member access . or […] Not: ! Comparison, e.g. < , >= , === , !=, … Logical AND && Logical OR || MDN gives you the exhaustive breakdown: Javascript Operator Precedence so for your example: (firstRun … Read more
The Java Tutorials has a list illustrating operator precedence. The equality operators will be evaluated first, then &&, then ||. Parentheses will be evaluated before anything else, so adding them can change the order. This is usually pretty much the same from language to language, but it’s always a good idea to double check. It’s … Read more
How about some analogies… You have a sock drawer, but it is currently empty. Does it contain any black sock? No – you don’t have any socks at all so you certainly don’t have a black one. Clearly any([]) must return false – if it returned true this would be counter-intuitive. The case for all([]) … Read more
The alternative would be quite heavyweight — storing “default argument values” in the function object as “thunks” of code to be executed over and over again every time the function is called without a specified value for that argument — and would make it much harder to get early binding (binding at def time), which … Read more
Here’s a solution in Python based on constraint-programming: from constraint import AllDifferentConstraint, InSetConstraint, Problem # variables colors = “blue red green white yellow”.split() nationalities = “Norwegian German Dane Swede English”.split() pets = “birds dog cats horse zebra”.split() drinks = “tea coffee milk beer water”.split() cigarettes = “Blend, Prince, Blue Master, Dunhill, Pall Mall”.split(“, “) # … Read more