数组的JavaScript阵列搜索 [英] javascript search array of arrays
本文介绍了数组的JavaScript阵列搜索的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
假设我们有以下的JS数组
VAR AR = [
[2,6,89,45]
[3,566,23,79]
[434,677,9,23]
];VAR VAL = [3,566,23,79];
有一个js内置函数的jQuery或其中某个可以搜索阵列的 AR 对于 VAL
感谢
***UPDATE*************
拍摄的融合的响应我创造了这个原型
Array.prototype.containsArray =功能(VAL){
变种散列= {};
对于(VAR I = 0; I< this.length;我++){
哈希[这[一] =我;
}
返回hash.hasOwnProperty(VAL);
}
解决方案
您可以创建一个哈希值。
VAR AR = [
[2,6,89,45]
[3,566,23,79]
[434,677,9,23]
];变种散列= {};
对于(VAR I = 0; I< ar.length; I + = 1){
哈希[AR [我] =我;
}VAR VAL = [434,677,9,23];如果(hash.hasOwnProperty(VAL)){
的document.write(哈希[VAL]);
}
Let's say we have the following js array
var ar = [
[2,6,89,45],
[3,566,23,79],
[434,677,9,23]
];
var val = [3,566,23,79];
Is there a js builtin function or jQuery one with which you can search the array ar for val?
Thanks
***UPDATE*************
Taking fusion's response I created this prototype
Array.prototype.containsArray = function(val) {
var hash = {};
for(var i=0; i<this.length; i++) {
hash[this[i]] = i;
}
return hash.hasOwnProperty(val);
}
解决方案
you could create a hash.
var ar = [
[2,6,89,45],
[3,566,23,79],
[434,677,9,23]
];
var hash = {};
for(var i = 0 ; i < ar.length; i += 1) {
hash[ar[i]] = i;
}
var val = [434,677,9,23];
if(hash.hasOwnProperty(val)) {
document.write(hash[val]);
}
这篇关于数组的JavaScript阵列搜索的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文