69590a370f
R=jkummerow@chromium.org Review URL: https://codereview.chromium.org/18068003 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@15370 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
46 lines
2.0 KiB
JavaScript
46 lines
2.0 KiB
JavaScript
// Copyright 2013 the V8 project authors. All rights reserved.
|
|
// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions
|
|
// are met:
|
|
// 1. Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// 2. 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.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS 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 APPLE INC. OR ITS 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.
|
|
|
|
description(
|
|
"This tests that passing an inconsistent compareFn to sort() doesn't cause a crash."
|
|
);
|
|
|
|
for (var attempt = 0; attempt < 100; ++attempt) {
|
|
var arr = [];
|
|
for (var i = 0; i < 64; ++i)
|
|
arr[i] = i;
|
|
arr.sort(function() { return 0.5 - Math.random(); });
|
|
}
|
|
|
|
// Sorting objects that change each time sort() looks at them is the same as using a random compareFn.
|
|
function RandomObject() {
|
|
this.toString = function() { return (Math.random() * 100).toString(); }
|
|
}
|
|
|
|
for (var attempt = 0; attempt < 100; ++attempt) {
|
|
var arr = [];
|
|
for (var i = 0; i < 64; ++i)
|
|
arr[i] = new RandomObject;
|
|
arr.sort();
|
|
}
|