eb6b3f601a
Make use of it when we know that something can't be a NaN. Review URL: http://codereview.chromium.org/524059 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3566 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
67 lines
3.1 KiB
JavaScript
67 lines
3.1 KiB
JavaScript
// Copyright 2008 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.
|
|
|
|
var a = [NaN, -1, 0, 1, 1.2, -7.9, true, false, 'foo', '0', 'NaN' ];
|
|
for (var i in a) {
|
|
var x = a[i];
|
|
assertFalse(NaN == x, "NaN == " + x);
|
|
assertFalse(NaN === x, "NaN === " + x);
|
|
assertFalse(NaN < x, "NaN < " + x);
|
|
assertFalse(NaN > x, "NaN > " + x);
|
|
assertFalse(NaN <= x, "NaN <= " + x);
|
|
assertFalse(NaN >= x, "NaN >= " + x);
|
|
|
|
assertFalse(x == NaN, "" + x + " == NaN");
|
|
assertFalse(x === NaN, "" + x + " === NaN");
|
|
assertFalse(x < NaN, "" + x + " < NaN");
|
|
assertFalse(x > NaN, "" + x + " > NaN");
|
|
assertFalse(x <= NaN, "" + x + " <= NaN");
|
|
assertFalse(x >= NaN, "" + x + " >= NaN");
|
|
}
|
|
|
|
var b = ["NaN", "-1", "0", "1", "1.2", "-7.9", "true", "false", "'foo'", "'0'",
|
|
"'NaN'" ];
|
|
for (var i in b) {
|
|
var x = b[i];
|
|
var program =
|
|
"assertFalse(NaN == " + x + ", 'NaN == ' + " + x + ");\n" +
|
|
"assertFalse(NaN === " + x + ", 'NaN === ' + " + x + ");\n" +
|
|
"assertFalse(NaN < " + x + ", 'NaN < ' + " + x + ");\n" +
|
|
"assertFalse(NaN > " + x + ", 'NaN > ' + " + x + ");\n" +
|
|
"assertFalse(NaN <= " + x + ", 'NaN <= ' + " + x + ");\n" +
|
|
"assertFalse(NaN >= " + x + ", 'NaN >= ' + " + x + ");\n" +
|
|
|
|
"assertFalse(" + x + " == NaN, '' + " + x + " + ' == NaN');\n" +
|
|
"assertFalse(" + x + " === NaN, '' + " + x + " + ' === NaN');\n" +
|
|
"assertFalse(" + x + " < NaN, '' + " + x + " + ' < NaN');\n" +
|
|
"assertFalse(" + x + " > NaN, '' + " + x + " + ' > NaN');\n" +
|
|
"assertFalse(" + x + " <= NaN, '' + " + x + " + ' <= NaN');\n" +
|
|
"assertFalse(" + x + " >= NaN, '' + " + x + " + ' >= NaN');\n";
|
|
eval(program);
|
|
}
|
|
|