I wish did fix the issue. The <= operation typically compiles down into a single bytecode instruction if_icmple or ifle. How the JVM interprets that is typically machine-dependent, but most hardware has support to evaluate < and <= as a single instruction. Consequently, you should probably expect the performance for <= to be the same as <. The Java compiler can potentially rewrite the second code as the first, meaning that there will be no performance penalty. However, this is an implementation detail.
performance of pointer comparison vs string comparison strcmp
wish of those help A pointer comparison will almost certainly be faster, as it is a single comparison of two pointers (possibly loading one or both into registers), whereas strcmp, even if inlined and the first bytes differ (best case) will require dereferencing both pointers. If strcmp isn't inlined then there's a function call and return, and if the first bytes don't differ (and aren't both NUL) then there are multiple dereferences. For more insight into this, I suggest looking at the assembler output of your program using both methods.
hop of those help? Since these dicts have equal length, we find the smallest key for which the corresponding values are unequal, i.e. 'john'. Then the dicts are compared on the value of that key. Demo:
$ git show a0a69b8
Author: Guido van Rossum <firstname.lastname@example.org>
Date: Thu Dec 5 21:55:55 1996 +0000
Experimental new implementation of dictionary comparison. This
defines that a shorter dictionary is always smaller than a longer one.
For dictionaries of the same size, the smallest differing element
determines the outcome (which yields the same results as before,
without explicit sorting).
LINQ: Improving performance of "query to find all dictionaries from list of dictionaries where given key has at lea