Cleanup of mjsunit.js code and make assertEquals more strict.

test/mjsunit/tools/splaytree.js

 // Copyright 2009 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 63 matching lines @@
                                 right: { key: 80, value: 80,
                                          left: null, right: null } },
                         right: { key: 100, value: 100,
                                  left: null, right: null } } } };
 };
 
 
 (function testSplay() {
   var tree = new SplayTree();
   tree.root_ = createSampleTree();
-  assertArrayEquals(['50', '30', '60', '10', '40', '90', '20', '70', '100', '15', '80'],
+  assertArrayEquals([50, 30, 60, 10, 40, 90, 20, 70, 100, 15, 80],
                     tree.exportValues());
   tree.splay_(50);
-  assertArrayEquals(['50', '30', '60', '10', '40', '90', '20', '70', '100', '15', '80'],
+  assertArrayEquals([50, 30, 60, 10, 40, 90, 20, 70, 100, 15, 80],
                     tree.exportValues());
   tree.splay_(80);
-  assertArrayEquals(['80', '60', '90', '50', '70', '100', '30', '10', '40', '20', '15'],
+  assertArrayEquals([80, 60, 90, 50, 70, 100, 30, 10, 40, 20, 15],
                     tree.exportValues());
 })();
 
 
 (function testInsert() {
   var tree = new SplayTree();
   tree.insert(5, 'root');
   tree.insert(3, 'left');
   assertArrayEquals(['left', 'root'], tree.exportValues());
   tree.insert(7, 'right');
@@ skipping 56 matching lines @@
   tree.insert(3, 'left');
   tree.insert(7, 'right');
   assertThrows('tree.remove(1)');
   assertThrows('tree.remove(6)');
   assertThrows('tree.remove(10)');
   assertEquals('root', tree.remove(5).value);
   assertEquals('left', tree.remove(3).value);
   assertEquals('right', tree.remove(7).value);
   assertArrayEquals([], tree.exportValues());
 })();