UNPKG

refun

Version:

A collection of React Hook-enabled functions that compose harmoniously with each other. Similar to `recompose`, but:

146 lines (111 loc) 4.3 kB
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault"); Object.defineProperty(exports, "__esModule", { value: true }); exports.unwindGenerator = exports.generatorIdFactory = exports.shallowEqualByKeys = exports.shallowEquals = void 0; var _regenerator = _interopRequireDefault(require("@babel/runtime/regenerator")); function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } it = o[Symbol.iterator](); return it.next.bind(it); } 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 shallowEquals = function shallowEquals(a, b) { if (a === b) { return true; } for (var key in b) { if (a[key] !== b[key]) { return false; } } for (var _key in a) { if (a[_key] !== b[_key]) { return false; } } return true; }; exports.shallowEquals = shallowEquals; var shallowEqualByKeys = function shallowEqualByKeys(a, b, keys) { if (a === b) { return true; } for (var _iterator = _createForOfIteratorHelperLoose(keys), _step; !(_step = _iterator()).done;) { var key = _step.value; if (a[key] !== b[key]) { return false; } } return true; }; exports.shallowEqualByKeys = shallowEqualByKeys; var generatorIdFactory = function generatorIdFactory() { var latestId = 0; var ids = new Set(); var switchToGenerator = function switchToGenerator(id) { return function () { ids.clear(); ids.add(id); }; }; var newId = function newId() { var id = latestId++; ids.add(id); return id; }; var isGeneratorRunning = function isGeneratorRunning(id) { return ids.has(id); }; return { switchToGenerator: switchToGenerator, newId: newId, isGeneratorRunning: isGeneratorRunning }; }; exports.generatorIdFactory = generatorIdFactory; var unwindGenerator = function unwindGenerator(gen, shouldContinue) { var handle = function handle(ir) { var value; return _regenerator.default.async(function handle$(_context) { while (1) { switch (_context.prev = _context.next) { case 0: if (!ir.done) { _context.next = 2; break; } return _context.abrupt("return"); case 2: _context.prev = 2; _context.next = 5; return _regenerator.default.awrap(ir.value); case 5: value = _context.sent; if (!shouldContinue()) { _context.next = 8; break; } return _context.abrupt("return", handle(gen.next(value))); case 8: gen.return(); _context.next = 16; break; case 11: _context.prev = 11; _context.t0 = _context["catch"](2); if (!shouldContinue()) { _context.next = 15; break; } return _context.abrupt("return", handle(gen.throw(_context.t0))); case 15: gen.return(); case 16: case "end": return _context.stop(); } } }, null, null, [[2, 11]], Promise); }; handle(gen.next()); }; exports.unwindGenerator = unwindGenerator; //# sourceMappingURL=utils.js.map