Every line of 'lodash compare arrays' code snippets is scanned for vulnerabilities by our powerful machine learning engine that combs millions of open source libraries, ensuring your JavaScript code is secure.
87 function CompareArrays(a, b) { 88 89 if (Array.isArray(a) === false || Array.isArray(b) === false) { 90 return false; 91 } 92 93 if (a.length !== b.length) { 94 return false; 95 } 96 97 for (let n = 0; n < a.length; n++) { 98 if (a[n] !== b[n]) { 99 return false; 100 } 101 } 102 103 return true; 104 }
7 function compare_arrays(a1, a2) { 8 for(var k in a1) { 9 if(a1[k] !== a2[k]) { 10 return false; 11 } 12 } 13 for(var k in a2) { 14 if(a2[k] !== a1[k]) { 15 return false; 16 } 17 } 18 return true; 19 }
88 function compare(a, b) { 89 if (Array.isArray(a)) { 90 return compareArray(a, b); 91 } else if ( 92 typeof a === "number" || 93 typeof a === "string" || 94 a === false || 95 a === true || 96 a === null 97 ) { 98 return a === b; 99 } else { 100 return compareObjects(a, b); 101 } 102 }
52 export function compareArray(array1, array2) { 53 if (array2.length !== array1.length) { 54 return false; 55 } 56 for (var i = 0; i < array1.length; i++) { 57 if (array2[i].compareArray) { 58 if (!array2[i].compareArray(array1[i])) { 59 return false; 60 } 61 } 62 if (array2[i] !== array1[i]) { 63 return false; 64 } 65 } 66 return true; 67 }
77 function compareSortedArrays(array1, array2) { 78 if (array1.length !== array2.length) { 79 return false; 80 } 81 for (let i = 0, len = array1.length; i < len; i++) { 82 if (array1[i] !== array2[i]) { 83 return false; 84 } 85 } 86 return true; 87 }
96 function compareArray(a1, a2){ 97 var ret = true; 98 var i = 0; 99 var len = a1.length; 100 if(len != a2.length){ 101 ret = false; 102 } else { 103 for(; i < len; i++){ 104 if(a1[i] != a2[i]){ 105 ret = false; 106 break; 107 } 108 } 109 } 110 return ret; 111 }
29 function sortKeys (a, b) { 30 var result = compare(a, b, EntitiesData.entitiesFirst) - compare(a, b, EntitiesData.oprionsLast); 31 return result; 32 }/*}}}*/
1 export default function shallowEquals(a, b, compare) { 2 let aIsNull = a === null; 3 let bIsNull = b === null; 4 5 if (aIsNull !== bIsNull) return false; 6 7 let aIsArray = Array.isArray(a); 8 let bIsArray = Array.isArray(b); 9 10 if (aIsArray !== bIsArray) return false; 11 12 let aTypeof = typeof a; 13 let bTypeof = typeof b; 14 15 if (aTypeof !== bTypeof) return false; 16 if (flat(aTypeof)) return compare 17 ? compare(a, b) 18 : a === b; 19 20 return aIsArray 21 ? shallowArray(a, b, compare) 22 : shallowObject(a, b, compare); 23 }
13 export function mergeArrays(a, b) { 14 const merged = a.slice() 15 16 for (const element of b) { 17 if (a.indexOf(element) < 0) { 18 merged.push(element) 19 } 20 } 21 22 return merged.sort((a, b) => a - b) 23 24 // ES6 version, requires Set polyfill. 25 // let merged = new Set(a) 26 // for (const element of b) 27 // { 28 // merged.add(i) 29 // } 30 // return Array.from(merged).sort((a, b) => a - b) 31 }
17 function compare (a, b, order) { 18 if ( !Array.isArray(order) ) { return 0; } 19 var 20 max = order.length, 21 makeIndex = (x) => ( x < 0 ) ? max : x, 22 ax = makeIndex(order.indexOf(a)), 23 bx = makeIndex(order.indexOf(b)), 24 result = ax - bx 25 ; 26 return result; 27 }/*}}}*/