| http://www.w3.org/ns/prov#value | - Bitwise AND has the advantage of short-circuiting the evaluation if it runs into a 0, but I wonder if there is a bound where a really large number with all the bits on (like 1048575 which is 20 1s in binary) is actually less efficient than a small integer division (5 % 2)?
|
