@razorpay/blade/build/lib/web/production/utils/hasSameObjectStructure/hasSameObjectStructure.js

The Design System that powers Razorpay

import isObject from '../lodashButBetter/isObject.js';
import keys from '../lodashButBetter/keys.js';

function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, 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 normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
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 };
//# sourceMappingURL=hasSameObjectStructure.js.map