@razorpay/blade
Version:
The Design System that powers Razorpay
53 lines (45 loc) • 2.65 kB
JavaScript
import isObject from '../lodashButBetter/isObject.js';
import keys from '../lodashButBetter/keys.js';
function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
var _hasSameObjectStructure = function hasSameObjectStructure(obj1, obj2) {
// Check if both objects are objects or not
if (!isObject(obj1) || !isObject(obj2)) {
return isObject(obj1) === isObject(obj2);
}
// Get the keys of both objects
var keys1 = keys(obj1);
var keys2 = keys(obj2);
// Check if the length of the keys are the same
if (keys1.length !== keys2.length) {
return false;
}
// Compare keys
keys1.sort();
keys2.sort();
for (var i = 0; i < keys1.length; i++) {
if (keys1[i] !== keys2[i]) {
return false;
}
}
// Recursively check the key structures of nested objects
var _iterator = _createForOfIteratorHelper(keys1),
_step;
try {
for (_iterator.s(); !(_step = _iterator.n()).done;) {
var _key = _step.value;
if (!_hasSameObjectStructure(obj1[_key], obj2[_key])) {
return false;
}
}
// If all checks pass, the structures are the same
} catch (err) {
_iterator.e(err);
} finally {
_iterator.f();
}
return true;
};
export { _hasSameObjectStructure as hasSameObjectStructure };
//# sourceMappingURL=hasSameObjectStructure.js.map