Change how optional opcode tables are built

This commit is contained in:
Jeff Parsons 2015-03-26 16:56:37 -07:00 committed by jeffpar
commit e3a5408031
10 changed files with 145 additions and 104 deletions

92
blog/2015/03/26/README.md Normal file
View file

@ -0,0 +1,92 @@
JavaScript Idiosyncrasies
---
Time to mention a few JavaScript idiosyncrasies that newcomers may not be aware of, and how I deal with them.
Also, see my previous posts on [PCjs Coding Conventions](/blog/2014/09/30/) and [JavaScript Negativity](/blog/2014/10/26/).
### Strict Equality
Most sites will advise you to *never* use the "==" and "!=" JavaScript operators, because when they compare variables
containing different data types, JavaScript will coerce one of the operands to a matching type, sometimes in unexpected
ways. We can thank the early days of JavaScript for this feature, when it was trying to be extraordinarily forgiving
of sloppy code. I'm not going to list all the odd results that can arise from JavaScript's operand coercion, because
there are more than enough examples on the web already.
To avoid unexpected coercion, and thus unexpected matches and/or mismatches, the usual advice is to *always* use
strict equality operators instead ("===" and "!==").
I disagree. In properly written code, you should always know what type of data your variables contain. In fact,
the more you're able to use JSDoc types to declare the data types of all your parameters, return values, and other
variables, the fewer errors you'll have. And coercion will never be a problem as long as you're always comparing
variables with matching types, because no coercion will be performed.
Another problem with strict equality operators is that they require more work to check for both *undefined* and *null*
values. For example, when I write a method with optional parameters, I generally allow those parameters to either
be omitted or set to *null*. Using "==", you can check both cases with a single comparison:
if (parameter == null) { ... }
whereas strict equality requires more work:
if (parameter === undefined || parameter === null) { ... }
This is one of the few times I think coercion (of *undefined* to *null*) is beneficial, so I rely on it.
When I recommend that you *not* use strict comparisons, I'm not saying that coercion is good. I agree that it
generally should be avoided (except in situations like the last example). The point is, know your variable data
types, only compare variables of the same type, and you'll never have to worry about coercion.
### Enumerating Array or Object Properties
When using *for*...*in* loops like this:
var a = [100, 200, 300];
for (var i in a) { ... }
the type of variable *i* will be **string** rather than **number**; that is, it will contain "0", "1" and "2" rather
than 0, 1 and 2. If you then use *i* to set a matching element in another array, that element will not be stored in
the same (numeric) position as the original array.
One solution is to convert *i* to a **number**:
parseInt(i, 10);
However, a more elegant solution is to use the unary "+" operator to coerce the **string** to a **number**:
+i;
### Shift Counts For Bit-wise Shifts
It turns out that shifting an integer value by more than 31 bits in either direction may not shift as many bits as
you'd expect. For example:
n = 0x10000000;
n >>>= 32;
will not change n at all. This is because, just like the shift instructions on Intel processors, JavaScript converts
the shift count to a *mod 32* value (in other words, it truncates the shift count to a 5-bit value).
So the above example is equivalent to:
n >>>= 0;
If you really need larger shift counts to work in a consistent manner, you can perform multiple shifts, where each
shift count is in the range 0-31:
n = (n >>> 31) >>> 1;
Also, it's not quite correct to say that a shift count of zero has *no* effect on a value:
n = 0x88888888|0; // n is displayed as -2004318072
n >>>= 0; // n is displayed as 2290649224
It's true that the bottom 32 bits of the value were not changed, but a side-effect of the unsigned shift operator is
that all the upper sign bits are stripped from the (64-bit) result.
However, as soon as you perform another bit-wise operation on the value, even one that has no effect on the lower 32
bits, the upper bits will once be updated to match the sign of the lower 32-bit value:
n |= 0; // n is displayed as -2004318072 again
*[@jeffpar](http://twitter.com/jeffpar)*
*March 26, 2015*