@vve/immer 9.0.0-alpha.1 → 9.0.0-alpha.11

package/es/common.js

@@ -0,0 +1,83 @@
+export var NOTHING = typeof Symbol !== "undefined" ? Symbol("immer-nothing") : {
+  ["immer-nothing"]: true
+};
+export var DRAFTABLE = typeof Symbol !== "undefined" && Symbol.for ? Symbol.for("immer-draftable") : "__$immer_draftable";
+export var DRAFT_STATE = typeof Symbol !== "undefined" && Symbol.for ? Symbol.for("immer-state") : "__$immer_state";
+export function isDraft(value) {
+  return !!value && !!value[DRAFT_STATE];
+}
+export function isDraftable(value) {
+  if (!value || typeof value !== "object") return false;
+  if (Array.isArray(value)) return true;
+  var proto = Object.getPrototypeOf(value);
+  if (!proto || proto === Object.prototype) return true;
+  return !!value[DRAFTABLE] || !!value.constructor[DRAFTABLE];
+}
+export function original(value) {
+  if (value && value[DRAFT_STATE]) {
+    return value[DRAFT_STATE].base;
+  }
+  // otherwise return undefined
+}
+
+export var assign = Object.assign || function assign(target, value) {
+  for (var key in value) {
+    if (has(value, key)) {
+      target[key] = value[key];
+    }
+  }
+  return target;
+};
+export var ownKeys = typeof Reflect !== "undefined" && Reflect.ownKeys ? Reflect.ownKeys : typeof Object.getOwnPropertySymbols !== "undefined" ? obj => Object.getOwnPropertyNames(obj).concat(Object.getOwnPropertySymbols(obj)) : Object.getOwnPropertyNames;
+export function shallowCopy(base) {
+  var invokeGetters = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+  if (Array.isArray(base)) return base.slice();
+  var clone = Object.create(Object.getPrototypeOf(base));
+  ownKeys(base).forEach(key => {
+    if (key === DRAFT_STATE) {
+      return; // Never copy over draft state.
+    }
+
+    var desc = Object.getOwnPropertyDescriptor(base, key);
+    var value = desc.value;
+    if (desc.get) {
+      if (!invokeGetters) {
+        throw new Error("Immer drafts cannot have computed properties");
+      }
+      value = desc.get.call(base);
+    }
+    if (desc.enumerable) {
+      clone[key] = value;
+    } else {
+      Object.defineProperty(clone, key, {
+        value,
+        writable: true,
+        configurable: true
+      });
+    }
+  });
+  return clone;
+}
+export function each(value, cb) {
+  if (Array.isArray(value)) {
+    for (var i = 0; i < value.length; i++) cb(i, value[i], value);
+  } else {
+    ownKeys(value).forEach(key => cb(key, value[key], value));
+  }
+}
+export function isEnumerable(base, prop) {
+  var desc = Object.getOwnPropertyDescriptor(base, prop);
+  return !!desc && desc.enumerable;
+}
+export function has(thing, prop) {
+  return Object.prototype.hasOwnProperty.call(thing, prop);
+}
+export function is(x, y) {
+  // From: https://github.com/facebook/fbjs/blob/c69904a511b900266935168223063dd8772dfc40/packages/fbjs/src/core/shallowEqual.js
+  if (x === y) {
+    return x !== 0 || 1 / x === 1 / y;
+  } else {
+    return x !== x && y !== y;
+  }
+}
+//# sourceMappingURL=common.js.map

package/es/common.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"common.js","names":["NOTHING","Symbol","DRAFTABLE","for","DRAFT_STATE","isDraft","value","isDraftable","Array","isArray","proto","Object","getPrototypeOf","prototype","constructor","original","base","assign","target","key","has","ownKeys","Reflect","getOwnPropertySymbols","obj","getOwnPropertyNames","concat","shallowCopy","invokeGetters","arguments","length","undefined","slice","clone","create","forEach","desc","getOwnPropertyDescriptor","get","Error","call","enumerable","defineProperty","writable","configurable","each","cb","i","isEnumerable","prop","thing","hasOwnProperty","is","x","y"],"sources":["../common.js"],"sourcesContent":["export const NOTHING =\n    typeof Symbol !== \"undefined\"\n        ? Symbol(\"immer-nothing\")\n        : {[\"immer-nothing\"]: true}\n\nexport const DRAFTABLE =\n    typeof Symbol !== \"undefined\" && Symbol.for\n        ? Symbol.for(\"immer-draftable\")\n        : \"__$immer_draftable\"\n\nexport const DRAFT_STATE =\n    typeof Symbol !== \"undefined\" && Symbol.for\n        ? Symbol.for(\"immer-state\")\n        : \"__$immer_state\"\n\nexport function isDraft(value) {\n    return !!value && !!value[DRAFT_STATE]\n}\n\nexport function isDraftable(value) {\n    if (!value || typeof value !== \"object\") return false\n    if (Array.isArray(value)) return true\n    const proto = Object.getPrototypeOf(value)\n    if (!proto || proto === Object.prototype) return true\n    return !!value[DRAFTABLE] || !!value.constructor[DRAFTABLE]\n}\n\nexport function original(value) {\n    if (value && value[DRAFT_STATE]) {\n        return value[DRAFT_STATE].base\n    }\n    // otherwise return undefined\n}\n\nexport const assign =\n    Object.assign ||\n    function assign(target, value) {\n        for (let key in value) {\n            if (has(value, key)) {\n                target[key] = value[key]\n            }\n        }\n        return target\n    }\n\nexport const ownKeys =\n    typeof Reflect !== \"undefined\" && Reflect.ownKeys\n        ? Reflect.ownKeys\n        : typeof Object.getOwnPropertySymbols !== \"undefined\"\n        ? obj =>\n              Object.getOwnPropertyNames(obj).concat(\n                  Object.getOwnPropertySymbols(obj)\n              )\n        : Object.getOwnPropertyNames\n\nexport function shallowCopy(base, invokeGetters = false) {\n    if (Array.isArray(base)) return base.slice()\n    const clone = Object.create(Object.getPrototypeOf(base))\n    ownKeys(base).forEach(key => {\n        if (key === DRAFT_STATE) {\n            return // Never copy over draft state.\n        }\n        const desc = Object.getOwnPropertyDescriptor(base, key)\n        let {value} = desc\n        if (desc.get) {\n            if (!invokeGetters) {\n                throw new Error(\"Immer drafts cannot have computed properties\")\n            }\n            value = desc.get.call(base)\n        }\n        if (desc.enumerable) {\n            clone[key] = value\n        } else {\n            Object.defineProperty(clone, key, {\n                value,\n                writable: true,\n                configurable: true\n            })\n        }\n    })\n    return clone\n}\n\nexport function each(value, cb) {\n    if (Array.isArray(value)) {\n        for (let i = 0; i < value.length; i++) cb(i, value[i], value)\n    } else {\n        ownKeys(value).forEach(key => cb(key, value[key], value))\n    }\n}\n\nexport function isEnumerable(base, prop) {\n    const desc = Object.getOwnPropertyDescriptor(base, prop)\n    return !!desc && desc.enumerable\n}\n\nexport function has(thing, prop) {\n    return Object.prototype.hasOwnProperty.call(thing, prop)\n}\n\nexport function is(x, y) {\n    // From: https://github.com/facebook/fbjs/blob/c69904a511b900266935168223063dd8772dfc40/packages/fbjs/src/core/shallowEqual.js\n    if (x === y) {\n        return x !== 0 || 1 / x === 1 / y\n    } else {\n        return x !== x && y !== y\n    }\n}\n"],"mappings":"AAAA,OAAO,IAAMA,OAAO,GAChB,OAAOC,MAAM,KAAK,WAAW,GACvBA,MAAM,CAAC,eAAe,CAAC,GACvB;EAAC,CAAC,eAAe,GAAG;AAAI,CAAC;AAEnC,OAAO,IAAMC,SAAS,GAClB,OAAOD,MAAM,KAAK,WAAW,IAAIA,MAAM,CAACE,GAAG,GACrCF,MAAM,CAACE,GAAG,CAAC,iBAAiB,CAAC,GAC7B,oBAAoB;AAE9B,OAAO,IAAMC,WAAW,GACpB,OAAOH,MAAM,KAAK,WAAW,IAAIA,MAAM,CAACE,GAAG,GACrCF,MAAM,CAACE,GAAG,CAAC,aAAa,CAAC,GACzB,gBAAgB;AAE1B,OAAO,SAASE,OAAOA,CAACC,KAAK,EAAE;EAC3B,OAAO,CAAC,CAACA,KAAK,IAAI,CAAC,CAACA,KAAK,CAACF,WAAW,CAAC;AAC1C;AAEA,OAAO,SAASG,WAAWA,CAACD,KAAK,EAAE;EAC/B,IAAI,CAACA,KAAK,IAAI,OAAOA,KAAK,KAAK,QAAQ,EAAE,OAAO,KAAK;EACrD,IAAIE,KAAK,CAACC,OAAO,CAACH,KAAK,CAAC,EAAE,OAAO,IAAI;EACrC,IAAMI,KAAK,GAAGC,MAAM,CAACC,cAAc,CAACN,KAAK,CAAC;EAC1C,IAAI,CAACI,KAAK,IAAIA,KAAK,KAAKC,MAAM,CAACE,SAAS,EAAE,OAAO,IAAI;EACrD,OAAO,CAAC,CAACP,KAAK,CAACJ,SAAS,CAAC,IAAI,CAAC,CAACI,KAAK,CAACQ,WAAW,CAACZ,SAAS,CAAC;AAC/D;AAEA,OAAO,SAASa,QAAQA,CAACT,KAAK,EAAE;EAC5B,IAAIA,KAAK,IAAIA,KAAK,CAACF,WAAW,CAAC,EAAE;IAC7B,OAAOE,KAAK,CAACF,WAAW,CAAC,CAACY,IAAI;EAClC;EACA;AACJ;;AAEA,OAAO,IAAMC,MAAM,GACfN,MAAM,CAACM,MAAM,IACb,SAASA,MAAMA,CAACC,MAAM,EAAEZ,KAAK,EAAE;EAC3B,KAAK,IAAIa,GAAG,IAAIb,KAAK,EAAE;IACnB,IAAIc,GAAG,CAACd,KAAK,EAAEa,GAAG,CAAC,EAAE;MACjBD,MAAM,CAACC,GAAG,CAAC,GAAGb,KAAK,CAACa,GAAG,CAAC;IAC5B;EACJ;EACA,OAAOD,MAAM;AACjB,CAAC;AAEL,OAAO,IAAMG,OAAO,GAChB,OAAOC,OAAO,KAAK,WAAW,IAAIA,OAAO,CAACD,OAAO,GAC3CC,OAAO,CAACD,OAAO,GACf,OAAOV,MAAM,CAACY,qBAAqB,KAAK,WAAW,GACnDC,GAAG,IACCb,MAAM,CAACc,mBAAmB,CAACD,GAAG,CAAC,CAACE,MAAM,CAClCf,MAAM,CAACY,qBAAqB,CAACC,GAAG,CAAC,CACpC,GACLb,MAAM,CAACc,mBAAmB;AAEpC,OAAO,SAASE,WAAWA,CAACX,IAAI,EAAyB;EAAA,IAAvBY,aAAa,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,KAAK;EACnD,IAAIrB,KAAK,CAACC,OAAO,CAACO,IAAI,CAAC,EAAE,OAAOA,IAAI,CAACgB,KAAK,EAAE;EAC5C,IAAMC,KAAK,GAAGtB,MAAM,CAACuB,MAAM,CAACvB,MAAM,CAACC,cAAc,CAACI,IAAI,CAAC,CAAC;EACxDK,OAAO,CAACL,IAAI,CAAC,CAACmB,OAAO,CAAChB,GAAG,IAAI;IACzB,IAAIA,GAAG,KAAKf,WAAW,EAAE;MACrB,OAAM,CAAC;IACX;;IACA,IAAMgC,IAAI,GAAGzB,MAAM,CAAC0B,wBAAwB,CAACrB,IAAI,EAAEG,GAAG,CAAC;IACvD,IAAKb,KAAK,GAAI8B,IAAI,CAAb9B,KAAK;IACV,IAAI8B,IAAI,CAACE,GAAG,EAAE;MACV,IAAI,CAACV,aAAa,EAAE;QAChB,MAAM,IAAIW,KAAK,CAAC,8CAA8C,CAAC;MACnE;MACAjC,KAAK,GAAG8B,IAAI,CAACE,GAAG,CAACE,IAAI,CAACxB,IAAI,CAAC;IAC/B;IACA,IAAIoB,IAAI,CAACK,UAAU,EAAE;MACjBR,KAAK,CAACd,GAAG,CAAC,GAAGb,KAAK;IACtB,CAAC,MAAM;MACHK,MAAM,CAAC+B,cAAc,CAACT,KAAK,EAAEd,GAAG,EAAE;QAC9Bb,KAAK;QACLqC,QAAQ,EAAE,IAAI;QACdC,YAAY,EAAE;MAClB,CAAC,CAAC;IACN;EACJ,CAAC,CAAC;EACF,OAAOX,KAAK;AAChB;AAEA,OAAO,SAASY,IAAIA,CAACvC,KAAK,EAAEwC,EAAE,EAAE;EAC5B,IAAItC,KAAK,CAACC,OAAO,CAACH,KAAK,CAAC,EAAE;IACtB,KAAK,IAAIyC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGzC,KAAK,CAACwB,MAAM,EAAEiB,CAAC,EAAE,EAAED,EAAE,CAACC,CAAC,EAAEzC,KAAK,CAACyC,CAAC,CAAC,EAAEzC,KAAK,CAAC;EACjE,CAAC,MAAM;IACHe,OAAO,CAACf,KAAK,CAAC,CAAC6B,OAAO,CAAChB,GAAG,IAAI2B,EAAE,CAAC3B,GAAG,EAAEb,KAAK,CAACa,GAAG,CAAC,EAAEb,KAAK,CAAC,CAAC;EAC7D;AACJ;AAEA,OAAO,SAAS0C,YAAYA,CAAChC,IAAI,EAAEiC,IAAI,EAAE;EACrC,IAAMb,IAAI,GAAGzB,MAAM,CAAC0B,wBAAwB,CAACrB,IAAI,EAAEiC,IAAI,CAAC;EACxD,OAAO,CAAC,CAACb,IAAI,IAAIA,IAAI,CAACK,UAAU;AACpC;AAEA,OAAO,SAASrB,GAAGA,CAAC8B,KAAK,EAAED,IAAI,EAAE;EAC7B,OAAOtC,MAAM,CAACE,SAAS,CAACsC,cAAc,CAACX,IAAI,CAACU,KAAK,EAAED,IAAI,CAAC;AAC5D;AAEA,OAAO,SAASG,EAAEA,CAACC,CAAC,EAAEC,CAAC,EAAE;EACrB;EACA,IAAID,CAAC,KAAKC,CAAC,EAAE;IACT,OAAOD,CAAC,KAAK,CAAC,IAAI,CAAC,GAAGA,CAAC,KAAK,CAAC,GAAGC,CAAC;EACrC,CAAC,MAAM;IACH,OAAOD,CAAC,KAAKA,CAAC,IAAIC,CAAC,KAAKA,CAAC;EAC7B;AACJ"}

package/es/es5.js

@@ -0,0 +1,242 @@
+"use strict";
+
+import { each, has, is, isDraft, isDraftable, isEnumerable, shallowCopy, DRAFT_STATE } from "./common";
+import { ImmerScope } from "./scope";
+
+// property descriptors are recycled to make sure we don't create a get and set closure per property,
+// but share them all instead
+var descriptors = {};
+var noop = () => {};
+export function willFinalize(scope, result, isReplaced) {
+  scope.drafts.forEach(draft => {
+    draft[DRAFT_STATE].finalizing = true;
+  });
+  if (!isReplaced) {
+    if (scope.patches) {
+      markChangesRecursively(scope.drafts[0]);
+    }
+    // This is faster when we don't care about which attributes changed.
+    markChangesSweep(scope.drafts);
+  }
+  // When a child draft is returned, look for changes.
+  else if (isDraft(result) && result[DRAFT_STATE].scope === scope) {
+    markChangesSweep(scope.drafts);
+  }
+}
+export function createProxy(base, parent) {
+  var isArray = Array.isArray(base);
+  var draft = clonePotentialDraft(base);
+  each(draft, prop => {
+    proxyProperty(draft, prop, isArray || isEnumerable(base, prop));
+  });
+
+  // See "proxy.js" for property documentation.
+  var scope = parent ? parent.scope : ImmerScope.current;
+  var state = {
+    scope,
+    modified: false,
+    finalizing: false,
+    // es5 only
+    finalized: false,
+    assigned: {},
+    parent,
+    base,
+    draft,
+    copy: null,
+    revoke,
+    revoked: false // es5 only
+  };
+
+  createHiddenProperty(draft, DRAFT_STATE, state);
+  scope.drafts.push(draft);
+  return draft;
+}
+function revoke() {
+  this.revoked = true;
+}
+function source(state) {
+  return state.copy || state.base;
+}
+
+// Access a property without creating an Immer draft.
+function peek(draft, prop) {
+  var state = draft[DRAFT_STATE];
+  if (state && !state.finalizing) {
+    state.finalizing = true;
+    var value = draft[prop];
+    state.finalizing = false;
+    return value;
+  }
+  return draft[prop];
+}
+function get(state, prop) {
+  assertUnrevoked(state);
+  var value = peek(source(state), prop);
+  if (state.finalizing) return value;
+  // Create a draft if the value is unmodified.
+  if (value === peek(state.base, prop) && isDraftable(value)) {
+    prepareCopy(state);
+    return state.copy[prop] = createProxy(value, state);
+  }
+  return value;
+}
+function set(state, prop, value) {
+  assertUnrevoked(state);
+  state.assigned[prop] = true;
+  if (!state.modified) {
+    if (is(value, peek(source(state), prop))) return;
+    markChanged(state);
+    prepareCopy(state);
+  }
+  state.copy[prop] = value;
+}
+function markChanged(state) {
+  if (!state.modified) {
+    state.modified = true;
+    if (state.parent) markChanged(state.parent);
+  }
+}
+function prepareCopy(state) {
+  if (!state.copy) state.copy = clonePotentialDraft(state.base);
+}
+function clonePotentialDraft(base) {
+  var state = base && base[DRAFT_STATE];
+  if (state) {
+    state.finalizing = true;
+    var draft = shallowCopy(state.draft, true);
+    state.finalizing = false;
+    return draft;
+  }
+  return shallowCopy(base);
+}
+function proxyProperty(draft, prop, enumerable) {
+  var desc = descriptors[prop];
+  if (desc) {
+    desc.enumerable = enumerable;
+  } else {
+    descriptors[prop] = desc = {
+      configurable: true,
+      enumerable,
+      get() {
+        return get(this[DRAFT_STATE], prop);
+      },
+      set(value) {
+        set(this[DRAFT_STATE], prop, value);
+      }
+    };
+  }
+  Object.defineProperty(draft, prop, desc);
+}
+function assertUnrevoked(state) {
+  if (state.revoked === true) throw new Error("Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? " + JSON.stringify(source(state)));
+}
+
+// This looks expensive, but only proxies are visited, and only objects without known changes are scanned.
+function markChangesSweep(drafts) {
+  // The natural order of drafts in the `scope` array is based on when they
+  // were accessed. By processing drafts in reverse natural order, we have a
+  // better chance of processing leaf nodes first. When a leaf node is known to
+  // have changed, we can avoid any traversal of its ancestor nodes.
+  for (var i = drafts.length - 1; i >= 0; i--) {
+    var state = drafts[i][DRAFT_STATE];
+    if (!state.modified) {
+      if (Array.isArray(state.base)) {
+        if (hasArrayChanges(state)) markChanged(state);
+      } else if (hasObjectChanges(state)) markChanged(state);
+    }
+  }
+}
+function markChangesRecursively(object) {
+  if (!object || typeof object !== "object") return;
+  var state = object[DRAFT_STATE];
+  if (!state) return;
+  var base = state.base,
+    draft = state.draft,
+    assigned = state.assigned;
+  if (!Array.isArray(object)) {
+    // Look for added keys.
+    Object.keys(draft).forEach(key => {
+      // The `undefined` check is a fast path for pre-existing keys.
+      if (base[key] === undefined && !has(base, key)) {
+        assigned[key] = true;
+        markChanged(state);
+      } else if (!assigned[key]) {
+        // Only untouched properties trigger recursion.
+        markChangesRecursively(draft[key]);
+      }
+    });
+    // Look for removed keys.
+    Object.keys(base).forEach(key => {
+      // The `undefined` check is a fast path for pre-existing keys.
+      if (draft[key] === undefined && !has(draft, key)) {
+        assigned[key] = false;
+        markChanged(state);
+      }
+    });
+  } else if (hasArrayChanges(state)) {
+    markChanged(state);
+    assigned.length = true;
+    if (draft.length < base.length) {
+      for (var i = draft.length; i < base.length; i++) assigned[i] = false;
+    } else {
+      for (var _i = base.length; _i < draft.length; _i++) assigned[_i] = true;
+    }
+    for (var _i2 = 0; _i2 < draft.length; _i2++) {
+      // Only untouched indices trigger recursion.
+      if (assigned[_i2] === undefined) markChangesRecursively(draft[_i2]);
+    }
+  }
+}
+function hasObjectChanges(state) {
+  var base = state.base,
+    draft = state.draft;
+
+  // Search for added keys and changed keys. Start at the back, because
+  // non-numeric keys are ordered by time of definition on the object.
+  var keys = Object.keys(draft);
+  for (var i = keys.length - 1; i >= 0; i--) {
+    var key = keys[i];
+    var baseValue = base[key];
+    // The `undefined` check is a fast path for pre-existing keys.
+    if (baseValue === undefined && !has(base, key)) {
+      return true;
+    }
+    // Once a base key is deleted, future changes go undetected, because its
+    // descriptor is erased. This branch detects any missed changes.
+    else {
+      var value = draft[key];
+      var _state = value && value[DRAFT_STATE];
+      if (_state ? _state.base !== baseValue : !is(value, baseValue)) {
+        return true;
+      }
+    }
+  }
+
+  // At this point, no keys were added or changed.
+  // Compare key count to determine if keys were deleted.
+  return keys.length !== Object.keys(base).length;
+}
+function hasArrayChanges(state) {
+  var draft = state.draft;
+  if (draft.length !== state.base.length) return true;
+  // See #116
+  // If we first shorten the length, our array interceptors will be removed.
+  // If after that new items are added, result in the same original length,
+  // those last items will have no intercepting property.
+  // So if there is no own descriptor on the last position, we know that items were removed and added
+  // N.B.: splice, unshift, etc only shift values around, but not prop descriptors, so we only have to check
+  // the last one
+  var descriptor = Object.getOwnPropertyDescriptor(draft, draft.length - 1);
+  // descriptor can be null, but only for newly created sparse arrays, eg. new Array(10)
+  if (descriptor && !descriptor.get) return true;
+  // For all other cases, we don't have to compare, as they would have been picked up by the index setters
+  return false;
+}
+function createHiddenProperty(target, prop, value) {
+  Object.defineProperty(target, prop, {
+    value: value,
+    enumerable: false,
+    writable: true
+  });
+}
+//# sourceMappingURL=es5.js.map

package/es/es5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"es5.js","names":["each","has","is","isDraft","isDraftable","isEnumerable","shallowCopy","DRAFT_STATE","ImmerScope","descriptors","noop","willFinalize","scope","result","isReplaced","drafts","forEach","draft","finalizing","patches","markChangesRecursively","markChangesSweep","createProxy","base","parent","isArray","Array","clonePotentialDraft","prop","proxyProperty","current","state","modified","finalized","assigned","copy","revoke","revoked","createHiddenProperty","push","source","peek","value","get","assertUnrevoked","prepareCopy","set","markChanged","enumerable","desc","configurable","Object","defineProperty","Error","JSON","stringify","i","length","hasArrayChanges","hasObjectChanges","object","keys","key","undefined","baseValue","descriptor","getOwnPropertyDescriptor","target","writable"],"sources":["../es5.js"],"sourcesContent":["\"use strict\"\nimport {\n    each,\n    has,\n    is,\n    isDraft,\n    isDraftable,\n    isEnumerable,\n    shallowCopy,\n    DRAFT_STATE\n} from \"./common\"\nimport {ImmerScope} from \"./scope\"\n\n// property descriptors are recycled to make sure we don't create a get and set closure per property,\n// but share them all instead\nconst descriptors = {}\nconst noop = () => {}\n\nexport function willFinalize(scope, result, isReplaced) {\n    scope.drafts.forEach(draft => {\n        draft[DRAFT_STATE].finalizing = true\n    })\n    if (!isReplaced) {\n        if (scope.patches) {\n            markChangesRecursively(scope.drafts[0])\n        }\n        // This is faster when we don't care about which attributes changed.\n        markChangesSweep(scope.drafts)\n    }\n    // When a child draft is returned, look for changes.\n    else if (isDraft(result) && result[DRAFT_STATE].scope === scope) {\n        markChangesSweep(scope.drafts)\n    }\n}\n\nexport function createProxy(base, parent) {\n    const isArray = Array.isArray(base)\n    const draft = clonePotentialDraft(base)\n    each(draft, prop => {\n        proxyProperty(draft, prop, isArray || isEnumerable(base, prop))\n    })\n\n    // See \"proxy.js\" for property documentation.\n    const scope = parent ? parent.scope : ImmerScope.current\n    const state = {\n        scope,\n        modified: false,\n        finalizing: false, // es5 only\n        finalized: false,\n        assigned: {},\n        parent,\n        base,\n        draft,\n        copy: null,\n        revoke,\n        revoked: false // es5 only\n    }\n\n    createHiddenProperty(draft, DRAFT_STATE, state)\n    scope.drafts.push(draft)\n    return draft\n}\n\nfunction revoke() {\n    this.revoked = true\n}\n\nfunction source(state) {\n    return state.copy || state.base\n}\n\n// Access a property without creating an Immer draft.\nfunction peek(draft, prop) {\n    const state = draft[DRAFT_STATE]\n    if (state && !state.finalizing) {\n        state.finalizing = true\n        const value = draft[prop]\n        state.finalizing = false\n        return value\n    }\n    return draft[prop]\n}\n\nfunction get(state, prop) {\n    assertUnrevoked(state)\n    const value = peek(source(state), prop)\n    if (state.finalizing) return value\n    // Create a draft if the value is unmodified.\n    if (value === peek(state.base, prop) && isDraftable(value)) {\n        prepareCopy(state)\n        return (state.copy[prop] = createProxy(value, state))\n    }\n    return value\n}\n\nfunction set(state, prop, value) {\n    assertUnrevoked(state)\n    state.assigned[prop] = true\n    if (!state.modified) {\n        if (is(value, peek(source(state), prop))) return\n        markChanged(state)\n        prepareCopy(state)\n    }\n    state.copy[prop] = value\n}\n\nfunction markChanged(state) {\n    if (!state.modified) {\n        state.modified = true\n        if (state.parent) markChanged(state.parent)\n    }\n}\n\nfunction prepareCopy(state) {\n    if (!state.copy) state.copy = clonePotentialDraft(state.base)\n}\n\nfunction clonePotentialDraft(base) {\n    const state = base && base[DRAFT_STATE]\n    if (state) {\n        state.finalizing = true\n        const draft = shallowCopy(state.draft, true)\n        state.finalizing = false\n        return draft\n    }\n    return shallowCopy(base)\n}\n\nfunction proxyProperty(draft, prop, enumerable) {\n    let desc = descriptors[prop]\n    if (desc) {\n        desc.enumerable = enumerable\n    } else {\n        descriptors[prop] = desc = {\n            configurable: true,\n            enumerable,\n            get() {\n                return get(this[DRAFT_STATE], prop)\n            },\n            set(value) {\n                set(this[DRAFT_STATE], prop, value)\n            }\n        }\n    }\n    Object.defineProperty(draft, prop, desc)\n}\n\nfunction assertUnrevoked(state) {\n    if (state.revoked === true)\n        throw new Error(\n            \"Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? \" +\n                JSON.stringify(source(state))\n        )\n}\n\n// This looks expensive, but only proxies are visited, and only objects without known changes are scanned.\nfunction markChangesSweep(drafts) {\n    // The natural order of drafts in the `scope` array is based on when they\n    // were accessed. By processing drafts in reverse natural order, we have a\n    // better chance of processing leaf nodes first. When a leaf node is known to\n    // have changed, we can avoid any traversal of its ancestor nodes.\n    for (let i = drafts.length - 1; i >= 0; i--) {\n        const state = drafts[i][DRAFT_STATE]\n        if (!state.modified) {\n            if (Array.isArray(state.base)) {\n                if (hasArrayChanges(state)) markChanged(state)\n            } else if (hasObjectChanges(state)) markChanged(state)\n        }\n    }\n}\n\nfunction markChangesRecursively(object) {\n    if (!object || typeof object !== \"object\") return\n    const state = object[DRAFT_STATE]\n    if (!state) return\n    const {base, draft, assigned} = state\n    if (!Array.isArray(object)) {\n        // Look for added keys.\n        Object.keys(draft).forEach(key => {\n            // The `undefined` check is a fast path for pre-existing keys.\n            if (base[key] === undefined && !has(base, key)) {\n                assigned[key] = true\n                markChanged(state)\n            } else if (!assigned[key]) {\n                // Only untouched properties trigger recursion.\n                markChangesRecursively(draft[key])\n            }\n        })\n        // Look for removed keys.\n        Object.keys(base).forEach(key => {\n            // The `undefined` check is a fast path for pre-existing keys.\n            if (draft[key] === undefined && !has(draft, key)) {\n                assigned[key] = false\n                markChanged(state)\n            }\n        })\n    } else if (hasArrayChanges(state)) {\n        markChanged(state)\n        assigned.length = true\n        if (draft.length < base.length) {\n            for (let i = draft.length; i < base.length; i++) assigned[i] = false\n        } else {\n            for (let i = base.length; i < draft.length; i++) assigned[i] = true\n        }\n        for (let i = 0; i < draft.length; i++) {\n            // Only untouched indices trigger recursion.\n            if (assigned[i] === undefined) markChangesRecursively(draft[i])\n        }\n    }\n}\n\nfunction hasObjectChanges(state) {\n    const {base, draft} = state\n\n    // Search for added keys and changed keys. Start at the back, because\n    // non-numeric keys are ordered by time of definition on the object.\n    const keys = Object.keys(draft)\n    for (let i = keys.length - 1; i >= 0; i--) {\n        const key = keys[i]\n        const baseValue = base[key]\n        // The `undefined` check is a fast path for pre-existing keys.\n        if (baseValue === undefined && !has(base, key)) {\n            return true\n        }\n        // Once a base key is deleted, future changes go undetected, because its\n        // descriptor is erased. This branch detects any missed changes.\n        else {\n            const value = draft[key]\n            const state = value && value[DRAFT_STATE]\n            if (state ? state.base !== baseValue : !is(value, baseValue)) {\n                return true\n            }\n        }\n    }\n\n    // At this point, no keys were added or changed.\n    // Compare key count to determine if keys were deleted.\n    return keys.length !== Object.keys(base).length\n}\n\nfunction hasArrayChanges(state) {\n    const {draft} = state\n    if (draft.length !== state.base.length) return true\n    // See #116\n    // If we first shorten the length, our array interceptors will be removed.\n    // If after that new items are added, result in the same original length,\n    // those last items will have no intercepting property.\n    // So if there is no own descriptor on the last position, we know that items were removed and added\n    // N.B.: splice, unshift, etc only shift values around, but not prop descriptors, so we only have to check\n    // the last one\n    const descriptor = Object.getOwnPropertyDescriptor(draft, draft.length - 1)\n    // descriptor can be null, but only for newly created sparse arrays, eg. new Array(10)\n    if (descriptor && !descriptor.get) return true\n    // For all other cases, we don't have to compare, as they would have been picked up by the index setters\n    return false\n}\n\nfunction createHiddenProperty(target, prop, value) {\n    Object.defineProperty(target, prop, {\n        value: value,\n        enumerable: false,\n        writable: true\n    })\n}\n"],"mappings":"AAAA,YAAY;;AACZ,SACIA,IAAI,EACJC,GAAG,EACHC,EAAE,EACFC,OAAO,EACPC,WAAW,EACXC,YAAY,EACZC,WAAW,EACXC,WAAW;AAEf,SAAQC,UAAU;;AAElB;AACA;AACA,IAAMC,WAAW,GAAG,CAAC,CAAC;AACtB,IAAMC,IAAI,GAAGA,CAAA,KAAM,CAAC,CAAC;AAErB,OAAO,SAASC,YAAYA,CAACC,KAAK,EAAEC,MAAM,EAAEC,UAAU,EAAE;EACpDF,KAAK,CAACG,MAAM,CAACC,OAAO,CAACC,KAAK,IAAI;IAC1BA,KAAK,CAACV,WAAW,CAAC,CAACW,UAAU,GAAG,IAAI;EACxC,CAAC,CAAC;EACF,IAAI,CAACJ,UAAU,EAAE;IACb,IAAIF,KAAK,CAACO,OAAO,EAAE;MACfC,sBAAsB,CAACR,KAAK,CAACG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3C;IACA;IACAM,gBAAgB,CAACT,KAAK,CAACG,MAAM,CAAC;EAClC;EACA;EAAA,KACK,IAAIZ,OAAO,CAACU,MAAM,CAAC,IAAIA,MAAM,CAACN,WAAW,CAAC,CAACK,KAAK,KAAKA,KAAK,EAAE;IAC7DS,gBAAgB,CAACT,KAAK,CAACG,MAAM,CAAC;EAClC;AACJ;AAEA,OAAO,SAASO,WAAWA,CAACC,IAAI,EAAEC,MAAM,EAAE;EACtC,IAAMC,OAAO,GAAGC,KAAK,CAACD,OAAO,CAACF,IAAI,CAAC;EACnC,IAAMN,KAAK,GAAGU,mBAAmB,CAACJ,IAAI,CAAC;EACvCvB,IAAI,CAACiB,KAAK,EAAEW,IAAI,IAAI;IAChBC,aAAa,CAACZ,KAAK,EAAEW,IAAI,EAAEH,OAAO,IAAIpB,YAAY,CAACkB,IAAI,EAAEK,IAAI,CAAC,CAAC;EACnE,CAAC,CAAC;;EAEF;EACA,IAAMhB,KAAK,GAAGY,MAAM,GAAGA,MAAM,CAACZ,KAAK,GAAGJ,UAAU,CAACsB,OAAO;EACxD,IAAMC,KAAK,GAAG;IACVnB,KAAK;IACLoB,QAAQ,EAAE,KAAK;IACfd,UAAU,EAAE,KAAK;IAAE;IACnBe,SAAS,EAAE,KAAK;IAChBC,QAAQ,EAAE,CAAC,CAAC;IACZV,MAAM;IACND,IAAI;IACJN,KAAK;IACLkB,IAAI,EAAE,IAAI;IACVC,MAAM;IACNC,OAAO,EAAE,KAAK,CAAC;EACnB,CAAC;;EAEDC,oBAAoB,CAACrB,KAAK,EAAEV,WAAW,EAAEwB,KAAK,CAAC;EAC/CnB,KAAK,CAACG,MAAM,CAACwB,IAAI,CAACtB,KAAK,CAAC;EACxB,OAAOA,KAAK;AAChB;AAEA,SAASmB,MAAMA,CAAA,EAAG;EACd,IAAI,CAACC,OAAO,GAAG,IAAI;AACvB;AAEA,SAASG,MAAMA,CAACT,KAAK,EAAE;EACnB,OAAOA,KAAK,CAACI,IAAI,IAAIJ,KAAK,CAACR,IAAI;AACnC;;AAEA;AACA,SAASkB,IAAIA,CAACxB,KAAK,EAAEW,IAAI,EAAE;EACvB,IAAMG,KAAK,GAAGd,KAAK,CAACV,WAAW,CAAC;EAChC,IAAIwB,KAAK,IAAI,CAACA,KAAK,CAACb,UAAU,EAAE;IAC5Ba,KAAK,CAACb,UAAU,GAAG,IAAI;IACvB,IAAMwB,KAAK,GAAGzB,KAAK,CAACW,IAAI,CAAC;IACzBG,KAAK,CAACb,UAAU,GAAG,KAAK;IACxB,OAAOwB,KAAK;EAChB;EACA,OAAOzB,KAAK,CAACW,IAAI,CAAC;AACtB;AAEA,SAASe,GAAGA,CAACZ,KAAK,EAAEH,IAAI,EAAE;EACtBgB,eAAe,CAACb,KAAK,CAAC;EACtB,IAAMW,KAAK,GAAGD,IAAI,CAACD,MAAM,CAACT,KAAK,CAAC,EAAEH,IAAI,CAAC;EACvC,IAAIG,KAAK,CAACb,UAAU,EAAE,OAAOwB,KAAK;EAClC;EACA,IAAIA,KAAK,KAAKD,IAAI,CAACV,KAAK,CAACR,IAAI,EAAEK,IAAI,CAAC,IAAIxB,WAAW,CAACsC,KAAK,CAAC,EAAE;IACxDG,WAAW,CAACd,KAAK,CAAC;IAClB,OAAQA,KAAK,CAACI,IAAI,CAACP,IAAI,CAAC,GAAGN,WAAW,CAACoB,KAAK,EAAEX,KAAK,CAAC;EACxD;EACA,OAAOW,KAAK;AAChB;AAEA,SAASI,GAAGA,CAACf,KAAK,EAAEH,IAAI,EAAEc,KAAK,EAAE;EAC7BE,eAAe,CAACb,KAAK,CAAC;EACtBA,KAAK,CAACG,QAAQ,CAACN,IAAI,CAAC,GAAG,IAAI;EAC3B,IAAI,CAACG,KAAK,CAACC,QAAQ,EAAE;IACjB,IAAI9B,EAAE,CAACwC,KAAK,EAAED,IAAI,CAACD,MAAM,CAACT,KAAK,CAAC,EAAEH,IAAI,CAAC,CAAC,EAAE;IAC1CmB,WAAW,CAAChB,KAAK,CAAC;IAClBc,WAAW,CAACd,KAAK,CAAC;EACtB;EACAA,KAAK,CAACI,IAAI,CAACP,IAAI,CAAC,GAAGc,KAAK;AAC5B;AAEA,SAASK,WAAWA,CAAChB,KAAK,EAAE;EACxB,IAAI,CAACA,KAAK,CAACC,QAAQ,EAAE;IACjBD,KAAK,CAACC,QAAQ,GAAG,IAAI;IACrB,IAAID,KAAK,CAACP,MAAM,EAAEuB,WAAW,CAAChB,KAAK,CAACP,MAAM,CAAC;EAC/C;AACJ;AAEA,SAASqB,WAAWA,CAACd,KAAK,EAAE;EACxB,IAAI,CAACA,KAAK,CAACI,IAAI,EAAEJ,KAAK,CAACI,IAAI,GAAGR,mBAAmB,CAACI,KAAK,CAACR,IAAI,CAAC;AACjE;AAEA,SAASI,mBAAmBA,CAACJ,IAAI,EAAE;EAC/B,IAAMQ,KAAK,GAAGR,IAAI,IAAIA,IAAI,CAAChB,WAAW,CAAC;EACvC,IAAIwB,KAAK,EAAE;IACPA,KAAK,CAACb,UAAU,GAAG,IAAI;IACvB,IAAMD,KAAK,GAAGX,WAAW,CAACyB,KAAK,CAACd,KAAK,EAAE,IAAI,CAAC;IAC5Cc,KAAK,CAACb,UAAU,GAAG,KAAK;IACxB,OAAOD,KAAK;EAChB;EACA,OAAOX,WAAW,CAACiB,IAAI,CAAC;AAC5B;AAEA,SAASM,aAAaA,CAACZ,KAAK,EAAEW,IAAI,EAAEoB,UAAU,EAAE;EAC5C,IAAIC,IAAI,GAAGxC,WAAW,CAACmB,IAAI,CAAC;EAC5B,IAAIqB,IAAI,EAAE;IACNA,IAAI,CAACD,UAAU,GAAGA,UAAU;EAChC,CAAC,MAAM;IACHvC,WAAW,CAACmB,IAAI,CAAC,GAAGqB,IAAI,GAAG;MACvBC,YAAY,EAAE,IAAI;MAClBF,UAAU;MACVL,GAAGA,CAAA,EAAG;QACF,OAAOA,GAAG,CAAC,IAAI,CAACpC,WAAW,CAAC,EAAEqB,IAAI,CAAC;MACvC,CAAC;MACDkB,GAAGA,CAACJ,KAAK,EAAE;QACPI,GAAG,CAAC,IAAI,CAACvC,WAAW,CAAC,EAAEqB,IAAI,EAAEc,KAAK,CAAC;MACvC;IACJ,CAAC;EACL;EACAS,MAAM,CAACC,cAAc,CAACnC,KAAK,EAAEW,IAAI,EAAEqB,IAAI,CAAC;AAC5C;AAEA,SAASL,eAAeA,CAACb,KAAK,EAAE;EAC5B,IAAIA,KAAK,CAACM,OAAO,KAAK,IAAI,EACtB,MAAM,IAAIgB,KAAK,CACX,sHAAsH,GAClHC,IAAI,CAACC,SAAS,CAACf,MAAM,CAACT,KAAK,CAAC,CAAC,CACpC;AACT;;AAEA;AACA,SAASV,gBAAgBA,CAACN,MAAM,EAAE;EAC9B;EACA;EACA;EACA;EACA,KAAK,IAAIyC,CAAC,GAAGzC,MAAM,CAAC0C,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;IACzC,IAAMzB,KAAK,GAAGhB,MAAM,CAACyC,CAAC,CAAC,CAACjD,WAAW,CAAC;IACpC,IAAI,CAACwB,KAAK,CAACC,QAAQ,EAAE;MACjB,IAAIN,KAAK,CAACD,OAAO,CAACM,KAAK,CAACR,IAAI,CAAC,EAAE;QAC3B,IAAImC,eAAe,CAAC3B,KAAK,CAAC,EAAEgB,WAAW,CAAChB,KAAK,CAAC;MAClD,CAAC,MAAM,IAAI4B,gBAAgB,CAAC5B,KAAK,CAAC,EAAEgB,WAAW,CAAChB,KAAK,CAAC;IAC1D;EACJ;AACJ;AAEA,SAASX,sBAAsBA,CAACwC,MAAM,EAAE;EACpC,IAAI,CAACA,MAAM,IAAI,OAAOA,MAAM,KAAK,QAAQ,EAAE;EAC3C,IAAM7B,KAAK,GAAG6B,MAAM,CAACrD,WAAW,CAAC;EACjC,IAAI,CAACwB,KAAK,EAAE;EACZ,IAAOR,IAAI,GAAqBQ,KAAK,CAA9BR,IAAI;IAAEN,KAAK,GAAcc,KAAK,CAAxBd,KAAK;IAAEiB,QAAQ,GAAIH,KAAK,CAAjBG,QAAQ;EAC5B,IAAI,CAACR,KAAK,CAACD,OAAO,CAACmC,MAAM,CAAC,EAAE;IACxB;IACAT,MAAM,CAACU,IAAI,CAAC5C,KAAK,CAAC,CAACD,OAAO,CAAC8C,GAAG,IAAI;MAC9B;MACA,IAAIvC,IAAI,CAACuC,GAAG,CAAC,KAAKC,SAAS,IAAI,CAAC9D,GAAG,CAACsB,IAAI,EAAEuC,GAAG,CAAC,EAAE;QAC5C5B,QAAQ,CAAC4B,GAAG,CAAC,GAAG,IAAI;QACpBf,WAAW,CAAChB,KAAK,CAAC;MACtB,CAAC,MAAM,IAAI,CAACG,QAAQ,CAAC4B,GAAG,CAAC,EAAE;QACvB;QACA1C,sBAAsB,CAACH,KAAK,CAAC6C,GAAG,CAAC,CAAC;MACtC;IACJ,CAAC,CAAC;IACF;IACAX,MAAM,CAACU,IAAI,CAACtC,IAAI,CAAC,CAACP,OAAO,CAAC8C,GAAG,IAAI;MAC7B;MACA,IAAI7C,KAAK,CAAC6C,GAAG,CAAC,KAAKC,SAAS,IAAI,CAAC9D,GAAG,CAACgB,KAAK,EAAE6C,GAAG,CAAC,EAAE;QAC9C5B,QAAQ,CAAC4B,GAAG,CAAC,GAAG,KAAK;QACrBf,WAAW,CAAChB,KAAK,CAAC;MACtB;IACJ,CAAC,CAAC;EACN,CAAC,MAAM,IAAI2B,eAAe,CAAC3B,KAAK,CAAC,EAAE;IAC/BgB,WAAW,CAAChB,KAAK,CAAC;IAClBG,QAAQ,CAACuB,MAAM,GAAG,IAAI;IACtB,IAAIxC,KAAK,CAACwC,MAAM,GAAGlC,IAAI,CAACkC,MAAM,EAAE;MAC5B,KAAK,IAAID,CAAC,GAAGvC,KAAK,CAACwC,MAAM,EAAED,CAAC,GAAGjC,IAAI,CAACkC,MAAM,EAAED,CAAC,EAAE,EAAEtB,QAAQ,CAACsB,CAAC,CAAC,GAAG,KAAK;IACxE,CAAC,MAAM;MACH,KAAK,IAAIA,EAAC,GAAGjC,IAAI,CAACkC,MAAM,EAAED,EAAC,GAAGvC,KAAK,CAACwC,MAAM,EAAED,EAAC,EAAE,EAAEtB,QAAQ,CAACsB,EAAC,CAAC,GAAG,IAAI;IACvE;IACA,KAAK,IAAIA,GAAC,GAAG,CAAC,EAAEA,GAAC,GAAGvC,KAAK,CAACwC,MAAM,EAAED,GAAC,EAAE,EAAE;MACnC;MACA,IAAItB,QAAQ,CAACsB,GAAC,CAAC,KAAKO,SAAS,EAAE3C,sBAAsB,CAACH,KAAK,CAACuC,GAAC,CAAC,CAAC;IACnE;EACJ;AACJ;AAEA,SAASG,gBAAgBA,CAAC5B,KAAK,EAAE;EAC7B,IAAOR,IAAI,GAAWQ,KAAK,CAApBR,IAAI;IAAEN,KAAK,GAAIc,KAAK,CAAdd,KAAK;;EAElB;EACA;EACA,IAAM4C,IAAI,GAAGV,MAAM,CAACU,IAAI,CAAC5C,KAAK,CAAC;EAC/B,KAAK,IAAIuC,CAAC,GAAGK,IAAI,CAACJ,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;IACvC,IAAMM,GAAG,GAAGD,IAAI,CAACL,CAAC,CAAC;IACnB,IAAMQ,SAAS,GAAGzC,IAAI,CAACuC,GAAG,CAAC;IAC3B;IACA,IAAIE,SAAS,KAAKD,SAAS,IAAI,CAAC9D,GAAG,CAACsB,IAAI,EAAEuC,GAAG,CAAC,EAAE;MAC5C,OAAO,IAAI;IACf;IACA;IACA;IAAA,KACK;MACD,IAAMpB,KAAK,GAAGzB,KAAK,CAAC6C,GAAG,CAAC;MACxB,IAAM/B,MAAK,GAAGW,KAAK,IAAIA,KAAK,CAACnC,WAAW,CAAC;MACzC,IAAIwB,MAAK,GAAGA,MAAK,CAACR,IAAI,KAAKyC,SAAS,GAAG,CAAC9D,EAAE,CAACwC,KAAK,EAAEsB,SAAS,CAAC,EAAE;QAC1D,OAAO,IAAI;MACf;IACJ;EACJ;;EAEA;EACA;EACA,OAAOH,IAAI,CAACJ,MAAM,KAAKN,MAAM,CAACU,IAAI,CAACtC,IAAI,CAAC,CAACkC,MAAM;AACnD;AAEA,SAASC,eAAeA,CAAC3B,KAAK,EAAE;EAC5B,IAAOd,KAAK,GAAIc,KAAK,CAAdd,KAAK;EACZ,IAAIA,KAAK,CAACwC,MAAM,KAAK1B,KAAK,CAACR,IAAI,CAACkC,MAAM,EAAE,OAAO,IAAI;EACnD;EACA;EACA;EACA;EACA;EACA;EACA;EACA,IAAMQ,UAAU,GAAGd,MAAM,CAACe,wBAAwB,CAACjD,KAAK,EAAEA,KAAK,CAACwC,MAAM,GAAG,CAAC,CAAC;EAC3E;EACA,IAAIQ,UAAU,IAAI,CAACA,UAAU,CAACtB,GAAG,EAAE,OAAO,IAAI;EAC9C;EACA,OAAO,KAAK;AAChB;AAEA,SAASL,oBAAoBA,CAAC6B,MAAM,EAAEvC,IAAI,EAAEc,KAAK,EAAE;EAC/CS,MAAM,CAACC,cAAc,CAACe,MAAM,EAAEvC,IAAI,EAAE;IAChCc,KAAK,EAAEA,KAAK;IACZM,UAAU,EAAE,KAAK;IACjBoB,QAAQ,EAAE;EACd,CAAC,CAAC;AACN"}

package/es/immer.js

@@ -0,0 +1,263 @@
+import * as legacyProxy from "./es5";
+import * as modernProxy from "./proxy";
+import { applyPatches, generatePatches } from "./patches";
+import { assign, each, has, is, isDraft, isDraftable, isEnumerable, shallowCopy, DRAFT_STATE, NOTHING } from "./common";
+import { ImmerScope } from "./scope";
+function verifyMinified() {}
+var configDefaults = {
+  useProxies: typeof Proxy !== "undefined" && typeof Reflect !== "undefined",
+  autoFreeze: typeof process !== "undefined" ? process.env.NODE_ENV !== "production" : verifyMinified.name === "verifyMinified",
+  onAssign: null,
+  onDelete: null,
+  onCopy: null
+};
+export class Immer {
+  constructor(config) {
+    assign(this, configDefaults, config);
+    this.setUseProxies(this.useProxies);
+    this.produce = this.produce.bind(this);
+  }
+  produce(base, recipe, patchListener) {
+    // curried invocation
+    if (typeof base === "function" && typeof recipe !== "function") {
+      var defaultBase = recipe;
+      recipe = base;
+      var self = this;
+      return function curriedProduce() {
+        var base = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : defaultBase;
+        for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+          args[_key - 1] = arguments[_key];
+        }
+        return self.produce(base, draft => recipe.call(this, draft, ...args)); // prettier-ignore
+      };
+    }
+
+    // prettier-ignore
+    {
+      if (typeof recipe !== "function") {
+        throw new Error("The first or second argument to `produce` must be a function");
+      }
+      if (patchListener !== undefined && typeof patchListener !== "function") {
+        throw new Error("The third argument to `produce` must be a function or undefined");
+      }
+    }
+    var result;
+
+    // Only plain objects, arrays, and "immerable classes" are drafted.
+    if (isDraftable(base)) {
+      var scope = ImmerScope.enter();
+      var proxy = this.createProxy(base);
+      var hasError = true;
+      try {
+        result = recipe(proxy);
+        hasError = false;
+      } finally {
+        // finally instead of catch + rethrow better preserves original stack
+        if (hasError) scope.revoke();else scope.leave();
+      }
+      if (result instanceof Promise) {
+        return result.then(result => {
+          scope.usePatches(patchListener);
+          return this.processResult(result, scope);
+        }, error => {
+          scope.revoke();
+          throw error;
+        });
+      }
+      scope.usePatches(patchListener);
+      return this.processResult(result, scope);
+    } else {
+      result = recipe(base);
+      if (result === undefined) return base;
+      return result !== NOTHING ? result : undefined;
+    }
+  }
+  createDraft(base) {
+    if (!isDraftable(base)) {
+      throw new Error("First argument to `createDraft` must be a plain object, an array, or an immerable object"); // prettier-ignore
+    }
+
+    var scope = ImmerScope.enter();
+    var proxy = this.createProxy(base, null);
+    proxy[DRAFT_STATE].isManual = true;
+    scope.leave();
+    return proxy;
+  }
+  finishDraft(draft, patchListener, keepAlive) {
+    var state = draft && draft[DRAFT_STATE];
+    if (!state || !state.isManual) {
+      throw new Error("First argument to `finishDraft` must be a draft returned by `createDraft`"); // prettier-ignore
+    }
+
+    if (state.finalized) {
+      throw new Error("The given draft is already finalized"); // prettier-ignore
+    }
+
+    var scope = state.scope;
+    scope.usePatches(patchListener);
+    return this.processResult(undefined, scope, keepAlive);
+  }
+  setAutoFreeze(value) {
+    this.autoFreeze = value;
+  }
+  setUseProxies(value) {
+    this.useProxies = value;
+    assign(this, value ? modernProxy : legacyProxy);
+  }
+  applyPatches(base, patches) {
+    // Mutate the base state when a draft is passed.
+    if (isDraft(base)) {
+      return applyPatches(base, patches);
+    }
+    // Otherwise, produce a copy of the base state.
+    return this.produce(base, draft => applyPatches(draft, patches));
+  }
+  /** @internal */
+  processResult(result, scope, keepAlive) {
+    var baseDraft = scope.drafts[0];
+    var isReplaced = result !== undefined && result !== baseDraft;
+    this.willFinalize(scope, result, isReplaced);
+    if (isReplaced) {
+      if (baseDraft[DRAFT_STATE].modified) {
+        scope.revoke(keepAlive);
+        throw new Error("An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft."); // prettier-ignore
+      }
+
+      if (isDraftable(result)) {
+        // Finalize the result in case it contains (or is) a subset of the draft.
+        result = this.finalize(result, null, scope);
+      }
+      if (scope.patches) {
+        scope.patches.push({
+          op: "replace",
+          path: [],
+          value: result
+        });
+        scope.inversePatches.push({
+          op: "replace",
+          path: [],
+          value: baseDraft[DRAFT_STATE].base
+        });
+      }
+    } else {
+      // Finalize the base draft.
+      result = this.finalize(baseDraft, [], scope, keepAlive);
+    }
+    scope.revoke(keepAlive);
+    if (scope.patches) {
+      scope.patchListener(scope.patches, scope.inversePatches);
+    }
+    return result !== NOTHING ? result : undefined;
+  }
+  /**
+   * @internal
+   * Finalize a draft, returning either the unmodified base state or a modified
+   * copy of the base state.
+   */
+  finalize(draft, path, scope, keepAlive) {
+    var state = draft[DRAFT_STATE];
+    if (!state) {
+      if (Object.isFrozen(draft)) return draft;
+      return this.finalizeTree(draft, null, scope);
+    }
+    // Never finalize drafts owned by another scope.
+    if (state.scope !== scope) {
+      return draft;
+    }
+    if (!state.modified) {
+      return state.base;
+    }
+    if (!state.finalized) {
+      if (!keepAlive) state.finalized = true;
+      this.finalizeTree(state.draft, path, scope);
+      if (this.onDelete) {
+        // The `assigned` object is unreliable with ES5 drafts.
+        if (this.useProxies) {
+          var assigned = state.assigned;
+          for (var prop in assigned) {
+            if (!assigned[prop]) this.onDelete(state, prop);
+          }
+        } else {
+          var base = state.base,
+            copy = state.copy;
+          each(base, prop => {
+            if (!has(copy, prop)) this.onDelete(state, prop);
+          });
+        }
+      }
+      if (this.onCopy) {
+        this.onCopy(state);
+      }
+
+      // At this point, all descendants of `state.copy` have been finalized,
+      // so we can be sure that `scope.canAutoFreeze` is accurate.
+      if (this.autoFreeze && scope.canAutoFreeze) {
+        Object.freeze(state.copy);
+      }
+      if (path && scope.patches) {
+        generatePatches(state, path, scope.patches, scope.inversePatches);
+      }
+    }
+    return state.copy;
+  }
+  /**
+   * @internal
+   * Finalize all drafts in the given state tree.
+   */
+  finalizeTree(root, rootPath, scope) {
+    var state = root[DRAFT_STATE];
+    if (state) {
+      if (!this.useProxies) {
+        // Create the final copy, with added keys and without deleted keys.
+        state.copy = shallowCopy(state.draft, true);
+      }
+      root = state.copy;
+    }
+    var needPatches = !!rootPath && !!scope.patches;
+    var finalizeProperty = (prop, value, parent) => {
+      if (value === parent) {
+        throw Error("Immer forbids circular references");
+      }
+
+      // In the `finalizeTree` method, only the `root` object may be a draft.
+      var isDraftProp = !!state && parent === root;
+      if (isDraft(value)) {
+        var path = isDraftProp && needPatches && !state.assigned[prop] ? rootPath.concat(prop) : null;
+
+        // Drafts owned by `scope` are finalized here.
+        value = this.finalize(value, path, scope);
+
+        // Drafts from another scope must prevent auto-freezing.
+        if (isDraft(value)) {
+          scope.canAutoFreeze = false;
+        }
+
+        // Preserve non-enumerable properties.
+        if (Array.isArray(parent) || isEnumerable(parent, prop)) {
+          parent[prop] = value;
+        } else {
+          Object.defineProperty(parent, prop, {
+            value
+          });
+        }
+
+        // Unchanged drafts are never passed to the `onAssign` hook.
+        if (isDraftProp && value === state.base[prop]) return;
+      }
+      // Unchanged draft properties are ignored.
+      else if (isDraftProp && is(value, state.base[prop])) {
+        return;
+      }
+      // Search new objects for unfinalized drafts. Frozen objects should never contain drafts.
+      else if (isDraftable(value) && !Object.isFrozen(value)) {
+        each(value, finalizeProperty);
+      }
+      if (isDraftProp && this.onAssign) {
+        this.onAssign(state, prop, value);
+      }
+    };
+    each(root, finalizeProperty);
+    return root;
+  }
+}
+//# sourceMappingURL=immer.js.map