mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
59 lines
2.5 KiB
59 lines
2.5 KiB
// Copyright 2013 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
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// 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.
|
|
|
|
// Performance test for overriden methods. Makes sure that default case
|
|
// is faster (cached) than the general case.
|
|
|
|
// Default, cached.
|
|
var startTime = new Date();
|
|
for (var i = 0; i < 1000; i++) {
|
|
'a'.localeCompare('c');
|
|
}
|
|
var endTime = new Date();
|
|
var cachedTime = endTime.getTime() - startTime.getTime();
|
|
|
|
// Not cached.
|
|
startTime = new Date();
|
|
for (var i = 0; i < 1000; i++) {
|
|
'a'.localeCompare('c', 'sr');
|
|
}
|
|
endTime = new Date();
|
|
var nonCachedTime = endTime.getTime() - startTime.getTime();
|
|
|
|
// Using collator. Faster than default, but not by much.
|
|
var collator = Intl.Collator();
|
|
startTime = new Date();
|
|
for (var i = 0; i < 1000; i++) {
|
|
collator.compare('a', 'c');
|
|
}
|
|
endTime = new Date();
|
|
collatorTime = endTime.getTime() - startTime.getTime();
|
|
|
|
// Difference is within 20%.
|
|
assertTrue(collatorTime < cachedTime);
|
|
// Non-cached time is much slower, measured to 12.5 times.
|
|
assertTrue(cachedTime < nonCachedTime);
|
|
|