不,它没有.出于这个原因,大多数流行的库在其实用程序包中都附带了一个.有关示例,请查看jQuery的100和Prototype的101.
jQuery的实现和您可能想象的一样简单:
function inArray(needle, haystack) {
var length = haystack.length;
for(var i = 0; i < length; i++) {
if(haystack[i] == needle) return true;
}
return false;
}
如果你正在处理大量的数组元素,上述方法会很好地解决这个问题.
EDIT:哎呀.我甚至没注意到你想看看一个数组是否在另一个数组中.根据PHP文档,这是PHP in_array
的预期行为:
$a = array(array('p', 'h'), array('p', 'r'), 'o');
if (in_array(array('p', 'h'), $a)) {
echo "'ph' was found\n";
}
if (in_array(array('f', 'i'), $a)) {
echo "'fi' was found\n";
}
if (in_array('o', $a)) {
echo "'o' was found\n";
}
// Output:
// 'ph' was found
// 'o' was found
Chris和Alex发布的代码不遵循这种行为.Alex的是Prototype的indexOf的官方版本,Chris的更像PHP的array_intersect
.这就是你想要的:
function arrayCompare(a1, a2) {
if (a1.length != a2.length) return false;
var length = a2.length;
for (var i = 0; i < length; i++) {
if (a1[i] !== a2[i]) return false;
}
return true;
}
function inArray(needle, haystack) {
var length = haystack.length;
for(var i = 0; i < length; i++) {
if(typeof haystack[i] == 'object') {
if(arrayCompare(haystack[i], needle)) return true;
} else {
if(haystack[i] == needle) return true;
}
}
return false;
}
这是我对上面内容的测试:
var a = [['p','h'],['p','r'],'o'];
if(inArray(['p','h'], a)) {
alert('ph was found');
}
if(inArray(['f','i'], a)) {
alert('fi was found');
}
if(inArray('o', a)) {
alert('o was found');
}
// Results:
// alerts 'ph' was found
// alerts 'o' was found
请注意,我故意没有扩展数组原型,因为这样做通常是个坏主意.