国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 開發(fā) > JS > 正文

js比較兩個(gè)單獨(dú)的數(shù)組或?qū)ο笫欠裣嗟鹊膶?shí)例代碼

2024-05-06 16:50:21
字體:
供稿:網(wǎng)友

所謂js的中的傳值,其實(shí)也就是說5種基本數(shù)據(jù)類型(null,undefind,boolean,number,string)

傳引用也就是說的那個(gè)引用數(shù)據(jù)類型,(array和object)

基本數(shù)據(jù)類型的值不可變,而引用數(shù)據(jù)類型的值是可變的

所以當(dāng)你比較數(shù)組和對(duì)象時(shí),都是false;除非你是克隆的原份數(shù)據(jù)

即: var a = { name: "李四" }; var b = a;

大家通常稱對(duì)象為引用類型,以此來和基本類型進(jìn)行區(qū)分; 而對(duì)象值都是引用,所以的對(duì)象的比較也叫引用的比較,當(dāng)且當(dāng)他們都指向同一個(gè)引用時(shí),即都引用的同一個(gè)基對(duì)象時(shí),它們才相等.

1.比較兩個(gè)單獨(dú)的數(shù)組是否相等

JSON.stringify(a1) == JSON.stringify(a2)

a1.toString() == a2.toString()

要判斷2個(gè)數(shù)組是否相同,把數(shù)組轉(zhuǎn)換成字符串進(jìn)行比較。

如果要比較兩個(gè)數(shù)組的元素是否相等,則:

JSON.stringify([1,2,3].sort()) === JSON.stringify([3,2,1].sort());

[1,2,3].sort().toString() === [3,2,1].sort().toString();

判斷2個(gè)數(shù)組是否相同,首先要把數(shù)組進(jìn)行排序,然后轉(zhuǎn)換成字符串進(jìn)行比較。

2.比較兩個(gè)單獨(dú)的對(duì)象是否相等

let cmp = ( x, y ) => {// If both x and y are null or undefined and exactly the same if ( x === y ) {  return true; }// If they are not strictly equal, they both need to be Objects if ( ! ( x instanceof Object ) || ! ( y instanceof Object ) ) {  return false; }//They must have the exact same prototype chain,the closest we can do is//test the constructor. if ( x.constructor !== y.constructor ) {  return false; } for ( var p in x ) {  //Inherited properties were tested using x.constructor === y.constructor  if ( x.hasOwnProperty( p ) ) {  // Allows comparing x[ p ] and y[ p ] when set to undefined  if ( ! y.hasOwnProperty( p ) ) {   return false;  }  // If they have the same strict value or identity then they are equal  if ( x[ p ] === y[ p ] ) {   continue;  }  // Numbers, Strings, Functions, Booleans must be strictly equal  if ( typeof( x[ p ] ) !== "object" ) {   return false;  }  // Objects and Arrays must be tested recursively  if ( ! Object.equals( x[ p ], y[ p ] ) ) {   return false;  }  } } for ( p in y ) {  // allows x[ p ] to be set to undefined  if ( y.hasOwnProperty( p ) && ! x.hasOwnProperty( p ) ) {  return false;  } } return true;};

下面是StackOverflow大神封裝的方法,可以學(xué)習(xí)一下:

1.比較數(shù)組

// Warn if overriding existing methodif(Array.prototype.equals) console.warn("Overriding existing Array.prototype.equals. Possible causes: New API defines the method, there's a framework conflict or you've got double inclusions in your code.");// attach the .equals method to Array's prototype to call it on any arrayArray.prototype.equals = function (array) { // if the other array is a falsy value, return if (!array)  return false; // compare lengths - can save a lot of time  if (this.length != array.length)  return false; for (var i = 0, l = this.length; i < l; i++) {  // Check if we have nested arrays  if (this[i] instanceof Array && array[i] instanceof Array) {   // recurse into the nested arrays   if (!this[i].equals(array[i]))    return false;    }     else if (this[i] != array[i]) {    // Warning - two different object instances will never be equal: {x:20} != {x:20}   return false;   }    }   return true;}// Hide method from for-in loopsObject.defineProperty(Array.prototype, "equals", {enumerable: false});

2.比較對(duì)象

Object.prototype.equals = function(object2) {  //For the first loop, we only check for types  for (propName in this) {    //Check for inherited methods and properties - like .equals itself    //https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/hasOwnProperty    //Return false if the return value is different    if (this.hasOwnProperty(propName) != object2.hasOwnProperty(propName)) {      return false;    }    //Check instance type    else if (typeof this[propName] != typeof object2[propName]) {      //Different types => not equal      return false;    }  }  //Now a deeper check using other objects property names  for(propName in object2) {    //We must check instances anyway, there may be a property that only exists in object2      //I wonder, if remembering the checked values from the first loop would be faster or not     if (this.hasOwnProperty(propName) != object2.hasOwnProperty(propName)) {      return false;    }    else if (typeof this[propName] != typeof object2[propName]) {      return false;    }    //If the property is inherited, do not check any more (it must be equa if both objects inherit it)    if(!this.hasOwnProperty(propName))     continue;    //Now the detail check and recursion    //This returns the script back to the array comparing    /**REQUIRES Array.equals**/    if (this[propName] instanceof Array && object2[propName] instanceof Array) {          // recurse into the nested arrays      if (!this[propName].equals(object2[propName]))            return false;    }    else if (this[propName] instanceof Object && object2[propName] instanceof Object) {          // recurse into another objects          //console.log("Recursing to compare ", this[propName],"with",object2[propName], " both named /""+propName+"/"");      if (!this[propName].equals(object2[propName]))            return false;    }    //Normal value comparison for strings and numbers    else if(this[propName] != object2[propName]) {      return false;    }  }  //If everything passed, let's say YES  return true;}

總結(jié)

以上所述是小編給大家介紹的js比較兩個(gè)單獨(dú)的數(shù)組或?qū)ο笫欠裣嗟鹊膶?shí)例代碼,希望對(duì)大家有所幫助,如果大家有任何疑問請(qǐng)給我留言,小編會(huì)及時(shí)回復(fù)大家的。在此也非常感謝大家對(duì)VeVb武林網(wǎng)網(wǎng)站的支持!
如果你覺得本文對(duì)你有幫助,歡迎轉(zhuǎn)載,煩請(qǐng)注明出處,謝謝!


注:相關(guān)教程知識(shí)閱讀請(qǐng)移步到JavaScript/Ajax教程頻道。
發(fā)表評(píng)論 共有條評(píng)論
用戶名: 密碼:
驗(yàn)證碼: 匿名發(fā)表
主站蜘蛛池模板: 百色市| 平泉县| 汽车| 綦江县| 太白县| 武隆县| 漠河县| 会理县| 石城县| 正安县| 类乌齐县| 舒兰市| 栾川县| 莱州市| 仁化县| 夹江县| 金秀| 沙湾县| 南江县| 平度市| 汽车| 桓台县| 福贡县| 武穴市| 繁峙县| 屯昌县| 清水河县| 石渠县| 太仓市| 宣汉县| 晋宁县| 华亭县| 七台河市| 小金县| 寿阳县| 乌拉特前旗| 祁阳县| 宾阳县| 莱芜市| 静海县| 兴义市|