@@ -359,10 +359,10 @@ Elm.Native.Array.make = function(elm) {
360 // Appends two trees.
360 // Appends two trees.
361 function append(a,b) {
361 function append(a,b) {
362− if (a.table.length == 0) {
362+ if (a.table.length === 0) {
363 return b;
363 return b;
365− if (b.table.length == 0) {
365+ if (b.table.length === 0) {
366 return a;
366 return a;
@@ -370,10 +370,10 @@ Elm.Native.Array.make = function(elm) {
371 // Check if both nodes can be crunshed together.
371 // Check if both nodes can be crunshed together.
372 if (c[0].table.length + c[1].table.length <= M) {
372 if (c[0].table.length + c[1].table.length <= M) {
373− if (c[0].table.length == 0) {
373+ if (c[0].table.length === 0) {
374 return c[1];
374 return c[1];
376− if (c[1].table.length == 0) {
376+ if (c[1].table.length === 0) {
377 return c[0];
377 return c[0];
@@ -400,13 +400,14 @@ Elm.Native.Array.make = function(elm) {
401 // Returns an array of two nodes; right and left. One node _may_ be empty.
401 // Returns an array of two nodes; right and left. One node _may_ be empty.
402 function append_(a, b) {
402 function append_(a, b) {
403− if (a.height == 0 && b.height == 0) {
403+ if (a.height === 0 && b.height === 0) {
404 return [a, b];
404 return [a, b];
407− if (a.height != 1 || b.height != 1) {
407+ if (a.height !== 1 || b.height !== 1) {
408− if (a.height == b.height) {
408+ if (a.height === b.height) {
409− a = nodeCopy(a), b = nodeCopy(b);
409+ a = nodeCopy(a);
410 var appended = append_(botRight(a), botLeft(b));
411 var appended = append_(botRight(a), botLeft(b));
412 insertRight(a, appended[1]);
413 insertRight(a, appended[1]);
@@ -421,15 +422,15 @@ Elm.Native.Array.make = function(elm) {
421 b = nodeCopy(b);
422 b = nodeCopy(b);
422 var appended = append_(a, botLeft(b));
423 var appended = append_(a, botLeft(b));
424− var left = appended[0].table.length == 0 ? 0 : 1;
425+ var left = appended[0].table.length === 0 ? 0 : 1;
425− var right = left == 0 ? 1 : 0;
426+ var right = left === 0 ? 1 : 0;
426 insertLeft(b, appended[left]);
427 insertLeft(b, appended[left]);
427 a = parentise(appended[right], appended[right].height + 1);
428 a = parentise(appended[right], appended[right].height + 1);
431 // Check if balancing is needed and return based on that.
432 // 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) {
433 return [a,b];
434 return [a,b];