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.
72 lines
2.6 KiB
72 lines
2.6 KiB
11 years ago
|
// 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("Test for bug 31689: RegExp#exec's returned Array-like object behaves differently from regular Arrays");
|
||
|
|
||
|
var tests = [
|
||
|
[ /(a)(_)?.+(c)(_)?.+(e)(_)?.+/, 'abcdef', '["abcdef", "a", undefined, "c", undefined, "e", undefined]' ],
|
||
|
[ /(a)(_)?/, 'abcdef', '["a", "a", undefined]' ],
|
||
|
[ /(_)?.+(a)/, 'xabcdef', '["xa", undefined, "a"]' ],
|
||
|
[ /(_)?.+(a)(_)?/, 'xabcdef', '["xa", undefined, "a", undefined]' ],
|
||
|
];
|
||
|
|
||
|
function testRegExpMatchesArray(i)
|
||
|
{
|
||
|
return tests[i][0].exec(tests[i][1]);
|
||
|
}
|
||
|
|
||
|
function testInOperator(i)
|
||
|
{
|
||
|
var re = tests[i][0],
|
||
|
str = tests[i][1],
|
||
|
inArray = [],
|
||
|
matches = re.exec(str);
|
||
|
|
||
|
for (var j = 0; j < matches.length; j++) {
|
||
|
if (j in matches) {
|
||
|
inArray.push(matches[j]);
|
||
|
}
|
||
|
}
|
||
|
return inArray;
|
||
|
}
|
||
|
|
||
|
function testForEachFunction(i)
|
||
|
{
|
||
|
var re = tests[i][0],
|
||
|
str = tests[i][1],
|
||
|
inArray = [],
|
||
|
matches = re.exec(str);
|
||
|
|
||
|
matches.forEach(function(m) {
|
||
|
inArray.push(m);
|
||
|
});
|
||
|
return inArray;
|
||
|
|
||
|
}
|
||
|
|
||
|
for (var i in tests) {
|
||
|
shouldBe('testRegExpMatchesArray(' + i + ')', tests[i][2]);
|
||
|
shouldBe('testInOperator(' + i + ')', tests[i][2]);
|
||
|
shouldBe('testForEachFunction(' + i + ')', tests[i][2]);
|
||
|
}
|