Javascript 我试图检查给定值是否作为对象数组中的键存在
我试图检查给定值是否作为对象数组中的键存在Javascript 我试图检查给定值是否作为对象数组中的键存在,javascript,arrays,object,Javascript,Arrays,Object,我试图检查给定值是否作为对象数组中的键存在 var obj = [{ tapCount1: '10' }, { tapCount2: '500' }, { tapCount3: '1250' }, { tapCount4: '1250' }, { wtOfSample: '41.00' }, { initialVolume: '66.0' }, { tapCountvol1: '60.0' }, { tapCountvol2: '53.0' }, { tapC
var obj = [{
tapCount1: '10'
}, {
tapCount2: '500'
}, {
tapCount3: '1250'
}, {
tapCount4: '1250'
}, {
wtOfSample: '41.00'
}, {
initialVolume: '66.0'
}, {
tapCountvol1: '60.0'
}, {
tapCountvol2: '53.0'
}, {
tapCountvol3: '52.0'
}, {
tapDensity: '0.788'
}, {
compressibilityIndex: '21.212'
}, {
hausnerRatio: '1.269'
}];
我使用了下面的代码
if (arrTDTData.hasOwnProperty("tapCount1") == false) {
count1 = 0;
} else {
count1 = arrTDTData.tapCount1;
}
我想检查key是否等于tapCount1,然后它将返回true,否则flase`如果要检查数组中是否存在具有
tapCount1
key的对象,可以使用some()
some()
方法测试数组中是否至少有一个元素
通过所提供函数实现的测试。它返回一个
布尔值
var obj=[{“tapCount1”:“10”},{“tapCount2”:“500”},{“tapCount3”:“1250”},{“tapCount4”:“1250”},{“wtOfSample”:“41.00”},{“initialVolume”:“66.0”},{“tapCountvol1”:“60.0”},{“tapCountvol2”:“53.0”},{“tapCountvol3”:“52.0”},{“tapcountdensity”:“0.788”{“压缩指数”:“21.2691”},{;
var result=obj.some(o=>o中的“tapCount1”);
控制台日志(结果)
使用包含和映射和对象。键(和减少以展平阵列):
var obj=[{tapCount1:'10'},{tapCount2:'500'},{tapCount3:'1250'},{tapCount4:'1250'},{wtOfSample:'41.00'},{initialVolume:'66.0'},{tapCountvol1:'60.0'},{tapCountvol2:'53.0'},{tapCountvol3:'52.0'},{tapCountvol3:'52.0.788'},{tapcompusibilityindex:'21.2691'};
const res=obj.map(Object.keys)。reduce((acc,curr)=>acc.concat(curr))。包括(“tapCount1”);
控制台日志(res)代码>您可以获取单个对象并检查想要的属性
var数组=[{tapCount1:'10'},{tapCount2:'500'},{tapCount3:'1250'},{tapCount4:'1250'},{wtOfSample:'41.00'},{initialVolume:'66.0'},{tapCountvol1:'60.0'},{tapCountvol2:'53.0'},{tapCountvol3:'52.0'},{tapcountdensity:'0.788'},{tapcompressibilityindex:'21.212'},{hauserratio:',
tapCount1='tapCount1'在Object.assign({},…数组)中;
console.log(tapCount1)代码>预期的输出是什么?然后代码第二部分的istead使用return arrTDTData.hasOwnProperty(“tapCount1”);