Shorten constructor names in JS tickprocessor.

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 12 matching lines @@
 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // Load the Splay tree implementation from <project root>/tools.
 // Files: tools/splaytree.js
 
 
 (function testIsEmpty() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   assertTrue(tree.isEmpty());
   tree.insert(0, 'value');
   assertFalse(tree.isEmpty());
 })();
 
 
 (function testExportValues() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   assertArrayEquals([], tree.exportValues());
   tree.insert(0, 'value');
   assertArrayEquals(['value'], tree.exportValues());
   tree.insert(0, 'value');
   assertArrayEquals(['value'], tree.exportValues());
 })();
 
 
 function createSampleTree() {
   // Creates the following tree:
@@ skipping 20 matching lines @@
                right: { key: 90, value: 90,
                         left: { key: 70, value: 70, left: null,
                                 right: { key: 80, value: 80,
                                          left: null, right: null } },
                         right: { key: 100, value: 100,
                                  left: null, right: null } } } };
 };
 
 
 (function testSplay() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   tree.root_ = createSampleTree();
   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'],
                     tree.exportValues());
   tree.splay_(80);
   assertArrayEquals(['80', '60', '90', '50', '70', '100', '30', '10', '40', '20', '15'],
                     tree.exportValues());
 })();
 
 
 (function testInsert() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   tree.insert(5, 'root');
   tree.insert(3, 'left');
   assertArrayEquals(['left', 'root'], tree.exportValues());
   tree.insert(7, 'right');
   assertArrayEquals(['right', 'root', 'left'], tree.exportValues());
 })();
 
 
 (function testFind() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   tree.insert(5, 'root');
   tree.insert(3, 'left');
   tree.insert(7, 'right');
   assertEquals('root', tree.find(5).value);
   assertEquals('left', tree.find(3).value);
   assertEquals('right', tree.find(7).value);
   assertEquals(null, tree.find(0));
   assertEquals(null, tree.find(100));
   assertEquals(null, tree.find(-100));
 })();
 
 
 (function testFindMin() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   assertEquals(null, tree.findMin());
   tree.insert(5, 'root');
   tree.insert(3, 'left');
   tree.insert(7, 'right');
   assertEquals('left', tree.findMin().value);
 })();
 
 
 (function testFindMax() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   assertEquals(null, tree.findMax());
   tree.insert(5, 'root');
   tree.insert(3, 'left');
   tree.insert(7, 'right');
   assertEquals('right', tree.findMax().value);
 })();
 
 
 (function testFindGreatestLessThan() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   assertEquals(null, tree.findGreatestLessThan(10));
   tree.insert(5, 'root');
   tree.insert(3, 'left');
   tree.insert(7, 'right');
   assertEquals('right', tree.findGreatestLessThan(10).value);
   assertEquals('right', tree.findGreatestLessThan(7).value);
   assertEquals('root', tree.findGreatestLessThan(6).value);
   assertEquals('left', tree.findGreatestLessThan(4).value);
   assertEquals(null, tree.findGreatestLessThan(2));
 })();
 
 
 (function testRemove() {
-  var tree = new goog.structs.SplayTree();
+  var tree = new SplayTree();
   assertThrows('tree.remove(5)');
   tree.insert(5, 'root');
   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());
 })();