@@ -359,10 +359,10 @@ Elm.Native.Array.make = function(elm) {
359359
360360 // Appends two trees.
361361 function append(a,b) {
362− if (a.table.length == 0) {
362+ if (a.table.length === 0) {
363363 return b;
364364 }
365− if (b.table.length == 0) {
365+ if (b.table.length === 0) {
366366 return a;
367367 }
368368
@@ -370,10 +370,10 @@ Elm.Native.Array.make = function(elm) {
370370
371371 // Check if both nodes can be crunshed together.
372372 if (c[0].table.length + c[1].table.length <= M) {
373− if (c[0].table.length == 0) {
373+ if (c[0].table.length === 0) {
374374 return c[1];
375375 }
376− if (c[1].table.length == 0) {
376+ if (c[1].table.length === 0) {
377377 return c[0];
378378 }
379379
@@ -400,13 +400,14 @@ Elm.Native.Array.make = function(elm) {
400400
401401 // Returns an array of two nodes; right and left. One node _may_ be empty.
402402 function append_(a, b) {
403− if (a.height == 0 && b.height == 0) {
403+ if (a.height === 0 && b.height === 0) {
404404 return [a, b];
405405 }
406406
407− if (a.height != 1 || b.height != 1) {
408− if (a.height == b.height) {
409− a = nodeCopy(a), b = nodeCopy(b);
407+ if (a.height !== 1 || b.height !== 1) {
408+ if (a.height === b.height) {
409+ a = nodeCopy(a);
410+ b = nodeCopy(b);
410411 var appended = append_(botRight(a), botLeft(b));
411412
412413 insertRight(a, appended[1]);
@@ -421,15 +422,15 @@ Elm.Native.Array.make = function(elm) {
421422 b = nodeCopy(b);
422423 var appended = append_(a, botLeft(b));
423424
424− var left = appended[0].table.length == 0 ? 0 : 1;
425− var right = left == 0 ? 1 : 0;
425+ var left = appended[0].table.length === 0 ? 0 : 1;
426+ var right = left === 0 ? 1 : 0;
426427 insertLeft(b, appended[left]);
427428 a = parentise(appended[right], appended[right].height + 1);
428429 }
429430 }
430431
431432 // Check if balancing is needed and return based on that.
432− if (a.table.length == 0 || b.table.length == 0) {
433+ if (a.table.length === 0 || b.table.length === 0) {
433434 return [a,b];
434435 }
435436