aboutsummaryrefslogtreecommitdiffstats
path: root/tests/auto/declarative/parserstress/tests/ecma/Math/15.8.2.12.js
diff options
context:
space:
mode:
Diffstat (limited to 'tests/auto/declarative/parserstress/tests/ecma/Math/15.8.2.12.js')
-rw-r--r--tests/auto/declarative/parserstress/tests/ecma/Math/15.8.2.12.js177
1 files changed, 0 insertions, 177 deletions
diff --git a/tests/auto/declarative/parserstress/tests/ecma/Math/15.8.2.12.js b/tests/auto/declarative/parserstress/tests/ecma/Math/15.8.2.12.js
deleted file mode 100644
index a33a5aca4a..0000000000
--- a/tests/auto/declarative/parserstress/tests/ecma/Math/15.8.2.12.js
+++ /dev/null
@@ -1,177 +0,0 @@
-/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
-/* ***** BEGIN LICENSE BLOCK *****
- * Version: MPL 1.1/GPL 2.0/LGPL 2.1
- *
- * The contents of this file are subject to the Mozilla Public License Version
- * 1.1 (the "License"); you may not use this file except in compliance with
- * the License. You may obtain a copy of the License at
- * http://www.mozilla.org/MPL/
- *
- * Software distributed under the License is distributed on an "AS IS" basis,
- * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
- * for the specific language governing rights and limitations under the
- * License.
- *
- * The Original Code is Mozilla Communicator client code, released
- * March 31, 1998.
- *
- * The Initial Developer of the Original Code is
- * Netscape Communications Corporation.
- * Portions created by the Initial Developer are Copyright (C) 1998
- * the Initial Developer. All Rights Reserved.
- *
- * Contributor(s):
- *
- * Alternatively, the contents of this file may be used under the terms of
- * either the GNU General Public License Version 2 or later (the "GPL"), or
- * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
- * in which case the provisions of the GPL or the LGPL are applicable instead
- * of those above. If you wish to allow use of your version of this file only
- * under the terms of either the GPL or the LGPL, and not to allow others to
- * use your version of this file under the terms of the MPL, indicate your
- * decision by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL or the LGPL. If you do not delete
- * the provisions above, a recipient may use your version of this file under
- * the terms of any one of the MPL, the GPL or the LGPL.
- *
- * ***** END LICENSE BLOCK ***** */
-
-gTestfile = '15.8.2.12.js';
-
-/**
- File Name: 15.8.2.12.js
- ECMA Section: 15.8.2.12 Math.min(x, y)
- Description: return the smaller of the two arguments.
- special cases:
- - if x is NaN or y is NaN return NaN
- - if x < y return x
- - if y > x return y
- - if x is +0 and y is +0 return +0
- - if x is +0 and y is -0 return -0
- - if x is -0 and y is +0 return -0
- - if x is -0 and y is -0 return -0
- Author: christine@netscape.com
- Date: 7 july 1997
-*/
-
-
-var SECTION = "15.8.2.12";
-var VERSION = "ECMA_1";
-var TITLE = "Math.min(x, y)";
-var BUGNUMBER="76439";
-
-startTest();
-
-writeHeaderToLog( SECTION + " "+ TITLE);
-
-new TestCase( SECTION,
- "Math.min.length",
- 2,
- Math.min.length );
-
-new TestCase( SECTION,
- "Math.min()",
- Infinity,
- Math.min() );
-
-new TestCase( SECTION,
- "Math.min(void 0, 1)",
- Number.NaN,
- Math.min( void 0, 1 ) );
-
-new TestCase( SECTION,
- "Math.min(void 0, void 0)",
- Number.NaN,
- Math.min( void 0, void 0 ) );
-
-new TestCase( SECTION,
- "Math.min(null, 1)",
- 0,
- Math.min( null, 1 ) );
-
-new TestCase( SECTION,
- "Math.min(-1, null)",
- -1,
- Math.min( -1, null ) );
-
-new TestCase( SECTION,
- "Math.min(true, false)",
- 0,
- Math.min(true,false) );
-
-new TestCase( SECTION,
- "Math.min('-99','99')",
- -99,
- Math.min( "-99","99") );
-
-new TestCase( SECTION,
- "Math.min(NaN,0)",
- Number.NaN,
- Math.min(Number.NaN,0) );
-
-new TestCase( SECTION,
- "Math.min(NaN,1)",
- Number.NaN,
- Math.min(Number.NaN,1) );
-
-new TestCase( SECTION,
- "Math.min(NaN,-1)",
- Number.NaN,
- Math.min(Number.NaN,-1) );
-
-new TestCase( SECTION,
- "Math.min(0,NaN)",
- Number.NaN,
- Math.min(0,Number.NaN) );
-
-new TestCase( SECTION,
- "Math.min(1,NaN)",
- Number.NaN,
- Math.min(1,Number.NaN) );
-
-new TestCase( SECTION,
- "Math.min(-1,NaN)",
- Number.NaN,
- Math.min(-1,Number.NaN) );
-
-new TestCase( SECTION,
- "Math.min(NaN,NaN)",
- Number.NaN,
- Math.min(Number.NaN,Number.NaN) );
-
-new TestCase( SECTION,
- "Math.min(1,1.0000000001)",
- 1,
- Math.min(1,1.0000000001) );
-
-new TestCase( SECTION,
- "Math.min(1.0000000001,1)",
- 1,
- Math.min(1.0000000001,1) );
-
-new TestCase( SECTION,
- "Math.min(0,0)",
- 0,
- Math.min(0,0) );
-
-new TestCase( SECTION,
- "Math.min(0,-0)",
- -0,
- Math.min(0,-0) );
-
-new TestCase( SECTION,
- "Math.min(-0,-0)",
- -0,
- Math.min(-0,-0) );
-
-new TestCase( SECTION,
- "Infinity/Math.min(0,-0)",
- -Infinity,
- Infinity/Math.min(0,-0) );
-
-new TestCase( SECTION,
- "Infinity/Math.min(-0,-0)",
- -Infinity,
- Infinity/Math.min(-0,-0) );
-
-test();