Make more JS files beter match the coding standard.

test/mjsunit/array-sort.js

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 233 matching lines @@
 
 
 function TestNonArrayWithAccessors() {
   // Regression test for issue 346, more info at URL
   // http://code.google.com/p/v8/issues/detail?id=346
   // Reported by nth10sd, test based on this report.
   var x = {};
   x[0] = 42;
   x.__defineGetter__("1", function(){return this.foo;});
   x.__defineSetter__("1", function(val){this.foo = val;});
-  x[1] = 49
+  x[1] = 49;
   x[3] = 37;
   x.length = 4;
   Array.prototype.sort.call(x);
   // Behavior of sort with accessors is undefined.  This accessor is
   // well-behaved (acts like a normal property), so it should work.
   assertEquals(4, x.length, "sortaccessors length");
   assertEquals(37, x[0], "sortaccessors first");
   assertEquals(42, x[1], "sortaccessors second");
-  assertEquals(49, x[2], "sortaccessors third")
+  assertEquals(49, x[2], "sortaccessors third");
   assertFalse(3 in x, "sortaccessors fourth");
 }
 
 TestNonArrayWithAccessors();
 
 
 function TestInheritedElementSort(depth) {
   var length = depth * 2 + 3;
   var obj = {length: length};
   obj[depth * 2 + 1] = 0;
@@ skipping 88 matching lines @@
     }
   };
   Array.prototype.sort.call(x);
 
   var name = "SpecialInherit-";
 
   assertEquals(10000, x.length, name + "length");
   var sorted = ["a2", "a3", "b1", "b2", "c1", "c2", "d1", "d2", "e3",
                 undefined, undefined, undefined];
   for (var i = 0; i < sorted.length; i++) {
-    assertTrue(x.hasOwnProperty(i), name + "has" + i)
+    assertTrue(x.hasOwnProperty(i), name + "has" + i);
     assertEquals(sorted[i], x[i], name + i);
   }
   assertFalse(x.hasOwnProperty(sorted.length), name + "haspost");
   assertFalse(sorted.length in x, name + "haspost2");
   assertTrue(x.hasOwnProperty(10), name + "hasundefined10");
   assertEquals(undefined, x[10], name + "undefined10");
   assertTrue(x.hasOwnProperty(100), name + "hasundefined100");
   assertEquals(undefined, x[100], name + "undefined100");
   assertTrue(x.hasOwnProperty(1000), name + "hasundefined1000");
   assertEquals(undefined, x[1000], name + "undefined1000");
@@ skipping 14 matching lines @@
 }
 var arr = [o(1), o(2), o(4), o(8), o(16), o(32), o(64), o(128), o(256), o(-0)];
 var global = this;
 function cmpTest(a, b) {
   assertEquals(global, this);
   assertTrue(a instanceof o);
   assertTrue(b instanceof o);
   return a.val - b.val;
 }
 arr.sort(cmpTest);