gecko-dev/js/tests/ecma_2/String/split-001.js

107 lines
3.4 KiB
JavaScript
Raw Normal View History

1999-05-26 21:22:57 +00:00
/**
* File Name: String/split-001.js
* ECMA Section: 15.6.4.9
* Description: Based on ECMA 2 Draft 7 February 1999
*
* Author: christine@netscape.com
* Date: 19 February 1999
*/
/*
* Since regular expressions have been part of JavaScript since 1.2, there
* are already tests for regular expressions in the js1_2/regexp folder.
*
* These new tests try to supplement the existing tests, and verify that
* our implementation of RegExp conforms to the ECMA specification, but
* does not try to be as exhaustive as in previous tests.
*
* The [,limit] argument to String.split is new, and not covered in any
* existing tests.
*
* String.split cases are covered in ecma/String/15.5.4.8-*.js.
* String.split where separator is a RegExp are in
* js1_2/regexp/string_split.js
*
*/
var SECTION = "ecma_2/String/split-001.js";
var VERSION = "ECMA_2";
var TITLE = "String.prototype.split( regexp, [,limit] )";
startTest();
// the separator is not supplied
// separator is undefined
// separator is an empty string
AddSplitCases( "splitme", "", "''", ["s", "p", "l", "i", "t", "m", "e"] );
AddSplitCases( "splitme", new RegExp(), "new RegExp()", ["s", "p", "l", "i", "t", "m", "e"] );
// separartor is a regexp
// separator regexp value global setting is set
// string is an empty string
// if separator is an empty string, split each by character
// this is not a String object
// limit is not a number
// limit is undefined
// limit is larger than 2^32-1
// limit is a negative number
test();
function AddSplitCases( string, separator, str_sep, split_array ) {
// verify that the result of split is an object of type Array
AddTestCase(
"( " + string + " ).split(" + str_sep +").constructor == Array",
true,
string.split(separator).constructor == Array );
// check the number of items in the array
AddTestCase(
"( " + string + " ).split(" + str_sep +").length",
split_array.length,
string.split(separator).length );
// check the value of each array item
var limit = (split_array.length > string.split(separator).length )
? split_array.length : string.split(separator).length;
for ( var matches = 0; matches < split_array.length; matches++ ) {
AddTestCase(
"( " + string + " ).split(" + str_sep +")[" + matches +"]",
split_array[matches],
string.split( separator )[matches] );
}
}
function AddLimitedSplitCases(
string, separator, str_sep, limit, str_limit, split_array ) {
// verify that the result of split is an object of type Array
AddTestCase(
"( " + string + " ).split(" + str_sep +", " + str_limit +
" ).constructor == Array",
true,
string.split(separator, limit).constructor == Array );
// check the length of the array
AddTestCase(
"( " + string + " ).split(" + str_sep +", " + str_limit + " ).length",
length,
string.split(separator).length );
// check the value of each array item
for ( var matches = 0; matches < split_array.length; matches++ ) {
AddTestCase(
"( " + string + " ).split(" + str_sep +", " + str_limit + " )[" + matches +"]",
split_array[matches],
string.split( separator )[matches] );
}
}