@tanstack/router-core 0.0.1-beta.5 → 0.0.1-beta.51

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2021 Tanner Linsley
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/build/cjs/actions.js

@@ -0,0 +1,94 @@
+/**
+ * router-core
+ *
+ * Copyright (c) TanStack
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE.md file in the root directory of this source tree.
+ *
+ * @license MIT
+ */
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var invariant = require('tiny-invariant');
+var store = require('./store.js');
+
+function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }
+
+var invariant__default = /*#__PURE__*/_interopDefaultLegacy(invariant);
+
+// RouterAction is a constrained identify function that takes options: key, action, onSuccess, onError, onSettled, etc
+function createAction(options) {
+  const store$1 = store.createStore({
+    submissions: []
+  }, options.debug);
+  return {
+    options,
+    store: store$1,
+    reset: () => {
+      store$1.setState(s => {
+        s.submissions = [];
+      });
+    },
+    submit: async payload => {
+      const submission = {
+        submittedAt: Date.now(),
+        status: 'pending',
+        payload: payload,
+        invalidate: () => {
+          setSubmission(s => {
+            s.isInvalid = true;
+          });
+        },
+        getIsLatest: () => store$1.state.submissions[store$1.state.submissions.length - 1]?.submittedAt === submission.submittedAt
+      };
+      const setSubmission = updater => {
+        store$1.setState(s => {
+          const a = s.submissions.find(d => d.submittedAt === submission.submittedAt);
+          invariant__default["default"](a, 'Could not find submission in store');
+          updater(a);
+        });
+      };
+      store$1.setState(s => {
+        s.submissions.push(submission);
+        s.submissions.reverse();
+        s.submissions = s.submissions.slice(0, options.maxSubmissions ?? 10);
+        s.submissions.reverse();
+      });
+      const after = async () => {
+        options.onEachSettled?.(submission);
+        if (submission.getIsLatest()) await options.onLatestSettled?.(submission);
+      };
+      try {
+        const res = await options.action?.(submission.payload);
+        setSubmission(s => {
+          s.response = res;
+        });
+        await options.onEachSuccess?.(submission);
+        if (submission.getIsLatest()) await options.onLatestSuccess?.(submission);
+        await after();
+        setSubmission(s => {
+          s.status = 'success';
+        });
+        return res;
+      } catch (err) {
+        console.error(err);
+        setSubmission(s => {
+          s.error = err;
+        });
+        await options.onEachError?.(submission);
+        if (submission.getIsLatest()) await options.onLatestError?.(submission);
+        await after();
+        setSubmission(s => {
+          s.status = 'error';
+        });
+        throw err;
+      }
+    }
+  };
+}
+
+exports.createAction = createAction;
+//# sourceMappingURL=actions.js.map

package/build/cjs/actions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"actions.js","sources":["../../src/actions.ts"],"sourcesContent":["// RouterAction is a constrained identify function that takes options: key, action, onSuccess, onError, onSettled, etc\n\nimport invariant from 'tiny-invariant'\nimport { batch, createStore, Store } from './store'\n\nexport interface ActionOptions<\n  TKey extends string = string,\n  TPayload = unknown,\n  TResponse = unknown,\n  TError = Error,\n> {\n  key?: TKey\n  action: (payload: TPayload) => TResponse | Promise<TResponse>\n  onLatestSuccess?: ActionCallback<TPayload, TResponse, TError>\n  onEachSuccess?: ActionCallback<TPayload, TResponse, TError>\n  onLatestError?: ActionCallback<TPayload, TResponse, TError>\n  onEachError?: ActionCallback<TPayload, TResponse, TError>\n  onLatestSettled?: ActionCallback<TPayload, TResponse, TError>\n  onEachSettled?: ActionCallback<TPayload, TResponse, TError>\n  maxSubmissions?: number\n  debug?: boolean\n}\n\ntype ActionCallback<TPayload, TResponse, TError> = (\n  submission: ActionSubmission<TPayload, TResponse, TError>,\n) => void | Promise<void>\n\nexport interface Action<\n  TKey extends string = string,\n  TPayload = unknown,\n  TResponse = unknown,\n  TError = Error,\n> {\n  options: ActionOptions<TKey, TPayload, TResponse, TError>\n  submit: (payload?: TPayload) => Promise<TResponse>\n  reset: () => void\n  store: Store<ActionStore<TPayload, TResponse, TError>>\n}\n\nexport interface ActionStore<\n  TPayload = unknown,\n  TResponse = unknown,\n  TError = Error,\n> {\n  submissions: ActionSubmission<TPayload, TResponse, TError>[]\n}\n\nexport type ActionFn<TActionPayload = unknown, TActionResponse = unknown> = (\n  submission: TActionPayload,\n) => TActionResponse | Promise<TActionResponse>\n\nexport interface ActionSubmission<\n  TPayload = unknown,\n  TResponse = unknown,\n  TError = Error,\n> {\n  submittedAt: number\n  status: 'idle' | 'pending' | 'success' | 'error'\n  payload: TPayload\n  response?: TResponse\n  error?: TError\n  isInvalid?: boolean\n  invalidate: () => void\n  getIsLatest: () => boolean\n}\n\nexport function createAction<TKey extends string, TPayload, TResponse, TError>(\n  options: ActionOptions<TKey, TPayload, TResponse, TError>,\n): Action<TKey, TPayload, TResponse, TError> {\n  const store = createStore<ActionStore<TPayload, TResponse, TError>>(\n    {\n      submissions: [],\n    },\n    options.debug,\n  )\n\n  return {\n    options,\n    store,\n    reset: () => {\n      store.setState((s) => {\n        s.submissions = []\n      })\n    },\n    submit: async (payload) => {\n      const submission: ActionSubmission<TPayload, TResponse, TError> = {\n        submittedAt: Date.now(),\n        status: 'pending',\n        payload: payload as TPayload,\n        invalidate: () => {\n          setSubmission((s) => {\n            s.isInvalid = true\n          })\n        },\n        getIsLatest: () =>\n          store.state.submissions[store.state.submissions.length - 1]\n            ?.submittedAt === submission.submittedAt,\n      }\n\n      const setSubmission = (\n        updater: (\n          submission: ActionSubmission<TPayload, TResponse, TError>,\n        ) => void,\n      ) => {\n        store.setState((s) => {\n          const a = s.submissions.find(\n            (d) => d.submittedAt === submission.submittedAt,\n          )\n\n          invariant(a, 'Could not find submission in store')\n\n          updater(a)\n        })\n      }\n\n      store.setState((s) => {\n        s.submissions.push(submission)\n        s.submissions.reverse()\n        s.submissions = s.submissions.slice(0, options.maxSubmissions ?? 10)\n        s.submissions.reverse()\n      })\n\n      const after = async () => {\n        options.onEachSettled?.(submission)\n        if (submission.getIsLatest())\n          await options.onLatestSettled?.(submission)\n      }\n\n      try {\n        const res = await options.action?.(submission.payload)\n        setSubmission((s) => {\n          s.response = res\n        })\n        await options.onEachSuccess?.(submission)\n        if (submission.getIsLatest())\n          await options.onLatestSuccess?.(submission)\n        await after()\n        setSubmission((s) => {\n          s.status = 'success'\n        })\n        return res\n      } catch (err: any) {\n        console.error(err)\n        setSubmission((s) => {\n          s.error = err\n        })\n        await options.onEachError?.(submission)\n        if (submission.getIsLatest()) await options.onLatestError?.(submission)\n        await after()\n        setSubmission((s) => {\n          s.status = 'error'\n        })\n        throw err\n      }\n    },\n  }\n}\n"],"names":["createAction","options","store","createStore","submissions","debug","reset","setState","s","submit","payload","submission","submittedAt","Date","now","status","invalidate","setSubmission","isInvalid","getIsLatest","state","length","updater","a","find","d","invariant","push","reverse","slice","maxSubmissions","after","onEachSettled","onLatestSettled","res","action","response","onEachSuccess","onLatestSuccess","err","console","error","onEachError","onLatestError"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;AAkEO,SAASA,YAAY,CAC1BC,OAAyD,EACd;EAC3C,MAAMC,OAAK,GAAGC,iBAAW,CACvB;AACEC,IAAAA,WAAW,EAAE,EAAA;AACf,GAAC,EACDH,OAAO,CAACI,KAAK,CACd,CAAA;EAED,OAAO;IACLJ,OAAO;WACPC,OAAK;AACLI,IAAAA,KAAK,EAAE,MAAM;AACXJ,MAAAA,OAAK,CAACK,QAAQ,CAAEC,CAAC,IAAK;QACpBA,CAAC,CAACJ,WAAW,GAAG,EAAE,CAAA;AACpB,OAAC,CAAC,CAAA;KACH;IACDK,MAAM,EAAE,MAAOC,OAAO,IAAK;AACzB,MAAA,MAAMC,UAAyD,GAAG;AAChEC,QAAAA,WAAW,EAAEC,IAAI,CAACC,GAAG,EAAE;AACvBC,QAAAA,MAAM,EAAE,SAAS;AACjBL,QAAAA,OAAO,EAAEA,OAAmB;AAC5BM,QAAAA,UAAU,EAAE,MAAM;UAChBC,aAAa,CAAET,CAAC,IAAK;YACnBA,CAAC,CAACU,SAAS,GAAG,IAAI,CAAA;AACpB,WAAC,CAAC,CAAA;SACH;QACDC,WAAW,EAAE,MACXjB,OAAK,CAACkB,KAAK,CAAChB,WAAW,CAACF,OAAK,CAACkB,KAAK,CAAChB,WAAW,CAACiB,MAAM,GAAG,CAAC,CAAC,EACvDT,WAAW,KAAKD,UAAU,CAACC,WAAAA;OAClC,CAAA;MAED,MAAMK,aAAa,GACjBK,OAES,IACN;AACHpB,QAAAA,OAAK,CAACK,QAAQ,CAAEC,CAAC,IAAK;AACpB,UAAA,MAAMe,CAAC,GAAGf,CAAC,CAACJ,WAAW,CAACoB,IAAI,CACzBC,CAAC,IAAKA,CAAC,CAACb,WAAW,KAAKD,UAAU,CAACC,WAAW,CAChD,CAAA;AAEDc,UAAAA,6BAAS,CAACH,CAAC,EAAE,oCAAoC,CAAC,CAAA;UAElDD,OAAO,CAACC,CAAC,CAAC,CAAA;AACZ,SAAC,CAAC,CAAA;OACH,CAAA;AAEDrB,MAAAA,OAAK,CAACK,QAAQ,CAAEC,CAAC,IAAK;AACpBA,QAAAA,CAAC,CAACJ,WAAW,CAACuB,IAAI,CAAChB,UAAU,CAAC,CAAA;AAC9BH,QAAAA,CAAC,CAACJ,WAAW,CAACwB,OAAO,EAAE,CAAA;AACvBpB,QAAAA,CAAC,CAACJ,WAAW,GAAGI,CAAC,CAACJ,WAAW,CAACyB,KAAK,CAAC,CAAC,EAAE5B,OAAO,CAAC6B,cAAc,IAAI,EAAE,CAAC,CAAA;AACpEtB,QAAAA,CAAC,CAACJ,WAAW,CAACwB,OAAO,EAAE,CAAA;AACzB,OAAC,CAAC,CAAA;MAEF,MAAMG,KAAK,GAAG,YAAY;AACxB9B,QAAAA,OAAO,CAAC+B,aAAa,GAAGrB,UAAU,CAAC,CAAA;QACnC,IAAIA,UAAU,CAACQ,WAAW,EAAE,EAC1B,MAAMlB,OAAO,CAACgC,eAAe,GAAGtB,UAAU,CAAC,CAAA;OAC9C,CAAA;MAED,IAAI;QACF,MAAMuB,GAAG,GAAG,MAAMjC,OAAO,CAACkC,MAAM,GAAGxB,UAAU,CAACD,OAAO,CAAC,CAAA;QACtDO,aAAa,CAAET,CAAC,IAAK;UACnBA,CAAC,CAAC4B,QAAQ,GAAGF,GAAG,CAAA;AAClB,SAAC,CAAC,CAAA;AACF,QAAA,MAAMjC,OAAO,CAACoC,aAAa,GAAG1B,UAAU,CAAC,CAAA;QACzC,IAAIA,UAAU,CAACQ,WAAW,EAAE,EAC1B,MAAMlB,OAAO,CAACqC,eAAe,GAAG3B,UAAU,CAAC,CAAA;AAC7C,QAAA,MAAMoB,KAAK,EAAE,CAAA;QACbd,aAAa,CAAET,CAAC,IAAK;UACnBA,CAAC,CAACO,MAAM,GAAG,SAAS,CAAA;AACtB,SAAC,CAAC,CAAA;AACF,QAAA,OAAOmB,GAAG,CAAA;OACX,CAAC,OAAOK,GAAQ,EAAE;AACjBC,QAAAA,OAAO,CAACC,KAAK,CAACF,GAAG,CAAC,CAAA;QAClBtB,aAAa,CAAET,CAAC,IAAK;UACnBA,CAAC,CAACiC,KAAK,GAAGF,GAAG,CAAA;AACf,SAAC,CAAC,CAAA;AACF,QAAA,MAAMtC,OAAO,CAACyC,WAAW,GAAG/B,UAAU,CAAC,CAAA;QACvC,IAAIA,UAAU,CAACQ,WAAW,EAAE,EAAE,MAAMlB,OAAO,CAAC0C,aAAa,GAAGhC,UAAU,CAAC,CAAA;AACvE,QAAA,MAAMoB,KAAK,EAAE,CAAA;QACbd,aAAa,CAAET,CAAC,IAAK;UACnBA,CAAC,CAACO,MAAM,GAAG,OAAO,CAAA;AACpB,SAAC,CAAC,CAAA;AACF,QAAA,MAAMwB,GAAG,CAAA;AACX,OAAA;AACF,KAAA;GACD,CAAA;AACH;;;;"}

package/build/cjs/history.js

@@ -0,0 +1,163 @@
+/**
+ * router-core
+ *
+ * Copyright (c) TanStack
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE.md file in the root directory of this source tree.
+ *
+ * @license MIT
+ */
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+// While the public API was clearly inspired by the "history" npm package,
+// This implementation attempts to be more lightweight by
+// making assumptions about the way TanStack Router works
+
+const popStateEvent = 'popstate';
+function createHistory(opts) {
+  let currentLocation = opts.getLocation();
+  let unsub = () => {};
+  let listeners = new Set();
+  const onUpdate = () => {
+    currentLocation = opts.getLocation();
+    listeners.forEach(listener => listener());
+  };
+  return {
+    get location() {
+      return currentLocation;
+    },
+    listen: cb => {
+      if (listeners.size === 0) {
+        unsub = opts.listener(onUpdate);
+      }
+      listeners.add(cb);
+      return () => {
+        listeners.delete(cb);
+        if (listeners.size === 0) {
+          unsub();
+        }
+      };
+    },
+    push: (path, state) => {
+      opts.pushState(path, state);
+      onUpdate();
+    },
+    replace: (path, state) => {
+      opts.replaceState(path, state);
+      onUpdate();
+    },
+    go: index => {
+      opts.go(index);
+      onUpdate();
+    },
+    back: () => {
+      opts.back();
+      onUpdate();
+    },
+    forward: () => {
+      opts.forward();
+      onUpdate();
+    }
+  };
+}
+function createBrowserHistory(opts) {
+  const getHref = opts?.getHref ?? (() => `${window.location.pathname}${window.location.hash}${window.location.search}`);
+  const createHref = opts?.createHref ?? (path => path);
+  const getLocation = () => parseLocation(getHref(), history.state);
+  return createHistory({
+    getLocation,
+    listener: onUpdate => {
+      window.addEventListener(popStateEvent, onUpdate);
+      return () => {
+        window.removeEventListener(popStateEvent, onUpdate);
+      };
+    },
+    pushState: (path, state) => {
+      window.history.pushState({
+        ...state,
+        key: createRandomKey()
+      }, '', createHref(path));
+    },
+    replaceState: (path, state) => {
+      window.history.replaceState({
+        ...state,
+        key: createRandomKey()
+      }, '', createHref(path));
+    },
+    back: () => window.history.back(),
+    forward: () => window.history.forward(),
+    go: n => window.history.go(n)
+  });
+}
+function createHashHistory() {
+  return createBrowserHistory({
+    getHref: () => window.location.hash.substring(1),
+    createHref: path => `#${path}`
+  });
+}
+function createMemoryHistory(opts = {
+  initialEntries: ['/']
+}) {
+  const entries = opts.initialEntries;
+  let index = opts.initialIndex ?? entries.length - 1;
+  let currentState = {};
+  const getLocation = () => parseLocation(entries[index], currentState);
+  return createHistory({
+    getLocation,
+    listener: onUpdate => {
+      window.addEventListener(popStateEvent, onUpdate);
+      // We might need to handle the hashchange event in the future
+      // window.addEventListener(hashChangeEvent, onUpdate)
+      return () => {
+        window.removeEventListener(popStateEvent, onUpdate);
+      };
+    },
+    pushState: (path, state) => {
+      currentState = {
+        ...state,
+        key: createRandomKey()
+      };
+      entries.push(path);
+      index++;
+    },
+    replaceState: (path, state) => {
+      currentState = {
+        ...state,
+        key: createRandomKey()
+      };
+      entries[index] = path;
+    },
+    back: () => {
+      index--;
+    },
+    forward: () => {
+      index = Math.min(index + 1, entries.length - 1);
+    },
+    go: n => window.history.go(n)
+  });
+}
+function parseLocation(href, state) {
+  let hashIndex = href.indexOf('#');
+  let searchIndex = href.indexOf('?');
+  const pathEnd = Math.min(hashIndex, searchIndex);
+  return {
+    href,
+    pathname: pathEnd > -1 ? href.substring(0, pathEnd) : href,
+    hash: hashIndex > -1 ? href.substring(hashIndex, searchIndex) : '',
+    search: searchIndex > -1 ? href.substring(searchIndex) : '',
+    state
+  };
+}
+
+// Thanks co-pilot!
+function createRandomKey() {
+  return (Math.random() + 1).toString(36).substring(7);
+}
+
+exports.createBrowserHistory = createBrowserHistory;
+exports.createHashHistory = createHashHistory;
+exports.createMemoryHistory = createMemoryHistory;
+//# sourceMappingURL=history.js.map

package/build/cjs/history.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"history.js","sources":["../../src/history.ts"],"sourcesContent":["// While the public API was clearly inspired by the \"history\" npm package,\n// This implementation attempts to be more lightweight by\n// making assumptions about the way TanStack Router works\n\nexport interface RouterHistory {\n  location: RouterLocation\n  listen: (cb: () => void) => () => void\n  push: (path: string, state: any) => void\n  replace: (path: string, state: any) => void\n  go: (index: number) => void\n  back: () => void\n  forward: () => void\n}\n\nexport interface ParsedPath {\n  href: string\n  pathname: string\n  search: string\n  hash: string\n}\n\nexport interface RouterLocation extends ParsedPath {\n  state: any\n}\n\nconst popStateEvent = 'popstate'\n\nfunction createHistory(opts: {\n  getLocation: () => RouterLocation\n  listener: (onUpdate: () => void) => () => void\n  pushState: (path: string, state: any) => void\n  replaceState: (path: string, state: any) => void\n  go: (n: number) => void\n  back: () => void\n  forward: () => void\n}): RouterHistory {\n  let currentLocation = opts.getLocation()\n  let unsub = () => {}\n  let listeners = new Set<() => void>()\n\n  const onUpdate = () => {\n    currentLocation = opts.getLocation()\n\n    listeners.forEach((listener) => listener())\n  }\n\n  return {\n    get location() {\n      return currentLocation\n    },\n    listen: (cb: () => void) => {\n      if (listeners.size === 0) {\n        unsub = opts.listener(onUpdate)\n      }\n      listeners.add(cb)\n\n      return () => {\n        listeners.delete(cb)\n        if (listeners.size === 0) {\n          unsub()\n        }\n      }\n    },\n    push: (path: string, state: any) => {\n      opts.pushState(path, state)\n      onUpdate()\n    },\n    replace: (path: string, state: any) => {\n      opts.replaceState(path, state)\n      onUpdate()\n    },\n    go: (index) => {\n      opts.go(index)\n      onUpdate()\n    },\n    back: () => {\n      opts.back()\n      onUpdate()\n    },\n    forward: () => {\n      opts.forward()\n      onUpdate()\n    },\n  }\n}\n\nexport function createBrowserHistory(opts?: {\n  getHref?: () => string\n  createHref?: (path: string) => string\n}): RouterHistory {\n  const getHref =\n    opts?.getHref ??\n    (() =>\n      `${window.location.pathname}${window.location.hash}${window.location.search}`)\n  const createHref = opts?.createHref ?? ((path) => path)\n  const getLocation = () => parseLocation(getHref(), history.state)\n\n  return createHistory({\n    getLocation,\n    listener: (onUpdate) => {\n      window.addEventListener(popStateEvent, onUpdate)\n      return () => {\n        window.removeEventListener(popStateEvent, onUpdate)\n      }\n    },\n    pushState: (path, state) => {\n      window.history.pushState(\n        { ...state, key: createRandomKey() },\n        '',\n        createHref(path),\n      )\n    },\n    replaceState: (path, state) => {\n      window.history.replaceState(\n        { ...state, key: createRandomKey() },\n        '',\n        createHref(path),\n      )\n    },\n    back: () => window.history.back(),\n    forward: () => window.history.forward(),\n    go: (n) => window.history.go(n),\n  })\n}\n\nexport function createHashHistory(): RouterHistory {\n  return createBrowserHistory({\n    getHref: () => window.location.hash.substring(1),\n    createHref: (path) => `#${path}`,\n  })\n}\n\nexport function createMemoryHistory(\n  opts: {\n    initialEntries: string[]\n    initialIndex?: number\n  } = {\n    initialEntries: ['/'],\n  },\n): RouterHistory {\n  const entries = opts.initialEntries\n  let index = opts.initialIndex ?? entries.length - 1\n  let currentState = {}\n\n  const getLocation = () => parseLocation(entries[index]!, currentState)\n\n  return createHistory({\n    getLocation,\n    listener: (onUpdate) => {\n      window.addEventListener(popStateEvent, onUpdate)\n      // We might need to handle the hashchange event in the future\n      // window.addEventListener(hashChangeEvent, onUpdate)\n      return () => {\n        window.removeEventListener(popStateEvent, onUpdate)\n      }\n    },\n    pushState: (path, state) => {\n      currentState = {\n        ...state,\n        key: createRandomKey(),\n      }\n      entries.push(path)\n      index++\n    },\n    replaceState: (path, state) => {\n      currentState = {\n        ...state,\n        key: createRandomKey(),\n      }\n      entries[index] = path\n    },\n    back: () => {\n      index--\n    },\n    forward: () => {\n      index = Math.min(index + 1, entries.length - 1)\n    },\n    go: (n) => window.history.go(n),\n  })\n}\n\nfunction parseLocation(href: string, state: any): RouterLocation {\n  let hashIndex = href.indexOf('#')\n  let searchIndex = href.indexOf('?')\n  const pathEnd = Math.min(hashIndex, searchIndex)\n\n  return {\n    href,\n    pathname: pathEnd > -1 ? href.substring(0, pathEnd) : href,\n    hash: hashIndex > -1 ? href.substring(hashIndex, searchIndex) : '',\n    search: searchIndex > -1 ? href.substring(searchIndex) : '',\n    state,\n  }\n}\n\n// Thanks co-pilot!\nfunction createRandomKey() {\n  return (Math.random() + 1).toString(36).substring(7)\n}\n"],"names":["popStateEvent","createHistory","opts","currentLocation","getLocation","unsub","listeners","Set","onUpdate","forEach","listener","location","listen","cb","size","add","delete","push","path","state","pushState","replace","replaceState","go","index","back","forward","createBrowserHistory","getHref","window","pathname","hash","search","createHref","parseLocation","history","addEventListener","removeEventListener","key","createRandomKey","n","createHashHistory","substring","createMemoryHistory","initialEntries","entries","initialIndex","length","currentState","Math","min","href","hashIndex","indexOf","searchIndex","pathEnd","random","toString"],"mappings":";;;;;;;;;;;;;;AAAA;AACA;AACA;;AAuBA,MAAMA,aAAa,GAAG,UAAU,CAAA;AAEhC,SAASC,aAAa,CAACC,IAQtB,EAAiB;AAChB,EAAA,IAAIC,eAAe,GAAGD,IAAI,CAACE,WAAW,EAAE,CAAA;AACxC,EAAA,IAAIC,KAAK,GAAG,MAAM,EAAE,CAAA;AACpB,EAAA,IAAIC,SAAS,GAAG,IAAIC,GAAG,EAAc,CAAA;EAErC,MAAMC,QAAQ,GAAG,MAAM;AACrBL,IAAAA,eAAe,GAAGD,IAAI,CAACE,WAAW,EAAE,CAAA;AAEpCE,IAAAA,SAAS,CAACG,OAAO,CAAEC,QAAQ,IAAKA,QAAQ,EAAE,CAAC,CAAA;GAC5C,CAAA;EAED,OAAO;AACL,IAAA,IAAIC,QAAQ,GAAG;AACb,MAAA,OAAOR,eAAe,CAAA;KACvB;IACDS,MAAM,EAAGC,EAAc,IAAK;AAC1B,MAAA,IAAIP,SAAS,CAACQ,IAAI,KAAK,CAAC,EAAE;AACxBT,QAAAA,KAAK,GAAGH,IAAI,CAACQ,QAAQ,CAACF,QAAQ,CAAC,CAAA;AACjC,OAAA;AACAF,MAAAA,SAAS,CAACS,GAAG,CAACF,EAAE,CAAC,CAAA;AAEjB,MAAA,OAAO,MAAM;AACXP,QAAAA,SAAS,CAACU,MAAM,CAACH,EAAE,CAAC,CAAA;AACpB,QAAA,IAAIP,SAAS,CAACQ,IAAI,KAAK,CAAC,EAAE;AACxBT,UAAAA,KAAK,EAAE,CAAA;AACT,SAAA;OACD,CAAA;KACF;AACDY,IAAAA,IAAI,EAAE,CAACC,IAAY,EAAEC,KAAU,KAAK;AAClCjB,MAAAA,IAAI,CAACkB,SAAS,CAACF,IAAI,EAAEC,KAAK,CAAC,CAAA;AAC3BX,MAAAA,QAAQ,EAAE,CAAA;KACX;AACDa,IAAAA,OAAO,EAAE,CAACH,IAAY,EAAEC,KAAU,KAAK;AACrCjB,MAAAA,IAAI,CAACoB,YAAY,CAACJ,IAAI,EAAEC,KAAK,CAAC,CAAA;AAC9BX,MAAAA,QAAQ,EAAE,CAAA;KACX;IACDe,EAAE,EAAGC,KAAK,IAAK;AACbtB,MAAAA,IAAI,CAACqB,EAAE,CAACC,KAAK,CAAC,CAAA;AACdhB,MAAAA,QAAQ,EAAE,CAAA;KACX;AACDiB,IAAAA,IAAI,EAAE,MAAM;MACVvB,IAAI,CAACuB,IAAI,EAAE,CAAA;AACXjB,MAAAA,QAAQ,EAAE,CAAA;KACX;AACDkB,IAAAA,OAAO,EAAE,MAAM;MACbxB,IAAI,CAACwB,OAAO,EAAE,CAAA;AACdlB,MAAAA,QAAQ,EAAE,CAAA;AACZ,KAAA;GACD,CAAA;AACH,CAAA;AAEO,SAASmB,oBAAoB,CAACzB,IAGpC,EAAiB;EAChB,MAAM0B,OAAO,GACX1B,IAAI,EAAE0B,OAAO,KACZ,MACE,CAAEC,EAAAA,MAAM,CAAClB,QAAQ,CAACmB,QAAS,GAAED,MAAM,CAAClB,QAAQ,CAACoB,IAAK,CAAA,EAAEF,MAAM,CAAClB,QAAQ,CAACqB,MAAO,CAAA,CAAC,CAAC,CAAA;EAClF,MAAMC,UAAU,GAAG/B,IAAI,EAAE+B,UAAU,KAAMf,IAAI,IAAKA,IAAI,CAAC,CAAA;EACvD,MAAMd,WAAW,GAAG,MAAM8B,aAAa,CAACN,OAAO,EAAE,EAAEO,OAAO,CAAChB,KAAK,CAAC,CAAA;AAEjE,EAAA,OAAOlB,aAAa,CAAC;IACnBG,WAAW;IACXM,QAAQ,EAAGF,QAAQ,IAAK;AACtBqB,MAAAA,MAAM,CAACO,gBAAgB,CAACpC,aAAa,EAAEQ,QAAQ,CAAC,CAAA;AAChD,MAAA,OAAO,MAAM;AACXqB,QAAAA,MAAM,CAACQ,mBAAmB,CAACrC,aAAa,EAAEQ,QAAQ,CAAC,CAAA;OACpD,CAAA;KACF;AACDY,IAAAA,SAAS,EAAE,CAACF,IAAI,EAAEC,KAAK,KAAK;AAC1BU,MAAAA,MAAM,CAACM,OAAO,CAACf,SAAS,CACtB;AAAE,QAAA,GAAGD,KAAK;AAAEmB,QAAAA,GAAG,EAAEC,eAAe,EAAA;AAAG,OAAC,EACpC,EAAE,EACFN,UAAU,CAACf,IAAI,CAAC,CACjB,CAAA;KACF;AACDI,IAAAA,YAAY,EAAE,CAACJ,IAAI,EAAEC,KAAK,KAAK;AAC7BU,MAAAA,MAAM,CAACM,OAAO,CAACb,YAAY,CACzB;AAAE,QAAA,GAAGH,KAAK;AAAEmB,QAAAA,GAAG,EAAEC,eAAe,EAAA;AAAG,OAAC,EACpC,EAAE,EACFN,UAAU,CAACf,IAAI,CAAC,CACjB,CAAA;KACF;AACDO,IAAAA,IAAI,EAAE,MAAMI,MAAM,CAACM,OAAO,CAACV,IAAI,EAAE;AACjCC,IAAAA,OAAO,EAAE,MAAMG,MAAM,CAACM,OAAO,CAACT,OAAO,EAAE;IACvCH,EAAE,EAAGiB,CAAC,IAAKX,MAAM,CAACM,OAAO,CAACZ,EAAE,CAACiB,CAAC,CAAA;AAChC,GAAC,CAAC,CAAA;AACJ,CAAA;AAEO,SAASC,iBAAiB,GAAkB;AACjD,EAAA,OAAOd,oBAAoB,CAAC;IAC1BC,OAAO,EAAE,MAAMC,MAAM,CAAClB,QAAQ,CAACoB,IAAI,CAACW,SAAS,CAAC,CAAC,CAAC;AAChDT,IAAAA,UAAU,EAAGf,IAAI,IAAM,CAAA,CAAA,EAAGA,IAAK,CAAA,CAAA;AACjC,GAAC,CAAC,CAAA;AACJ,CAAA;AAEO,SAASyB,mBAAmB,CACjCzC,IAGC,GAAG;EACF0C,cAAc,EAAE,CAAC,GAAG,CAAA;AACtB,CAAC,EACc;AACf,EAAA,MAAMC,OAAO,GAAG3C,IAAI,CAAC0C,cAAc,CAAA;EACnC,IAAIpB,KAAK,GAAGtB,IAAI,CAAC4C,YAAY,IAAID,OAAO,CAACE,MAAM,GAAG,CAAC,CAAA;EACnD,IAAIC,YAAY,GAAG,EAAE,CAAA;EAErB,MAAM5C,WAAW,GAAG,MAAM8B,aAAa,CAACW,OAAO,CAACrB,KAAK,CAAC,EAAGwB,YAAY,CAAC,CAAA;AAEtE,EAAA,OAAO/C,aAAa,CAAC;IACnBG,WAAW;IACXM,QAAQ,EAAGF,QAAQ,IAAK;AACtBqB,MAAAA,MAAM,CAACO,gBAAgB,CAACpC,aAAa,EAAEQ,QAAQ,CAAC,CAAA;AAChD;AACA;AACA,MAAA,OAAO,MAAM;AACXqB,QAAAA,MAAM,CAACQ,mBAAmB,CAACrC,aAAa,EAAEQ,QAAQ,CAAC,CAAA;OACpD,CAAA;KACF;AACDY,IAAAA,SAAS,EAAE,CAACF,IAAI,EAAEC,KAAK,KAAK;AAC1B6B,MAAAA,YAAY,GAAG;AACb,QAAA,GAAG7B,KAAK;AACRmB,QAAAA,GAAG,EAAEC,eAAe,EAAA;OACrB,CAAA;AACDM,MAAAA,OAAO,CAAC5B,IAAI,CAACC,IAAI,CAAC,CAAA;AAClBM,MAAAA,KAAK,EAAE,CAAA;KACR;AACDF,IAAAA,YAAY,EAAE,CAACJ,IAAI,EAAEC,KAAK,KAAK;AAC7B6B,MAAAA,YAAY,GAAG;AACb,QAAA,GAAG7B,KAAK;AACRmB,QAAAA,GAAG,EAAEC,eAAe,EAAA;OACrB,CAAA;AACDM,MAAAA,OAAO,CAACrB,KAAK,CAAC,GAAGN,IAAI,CAAA;KACtB;AACDO,IAAAA,IAAI,EAAE,MAAM;AACVD,MAAAA,KAAK,EAAE,CAAA;KACR;AACDE,IAAAA,OAAO,EAAE,MAAM;AACbF,MAAAA,KAAK,GAAGyB,IAAI,CAACC,GAAG,CAAC1B,KAAK,GAAG,CAAC,EAAEqB,OAAO,CAACE,MAAM,GAAG,CAAC,CAAC,CAAA;KAChD;IACDxB,EAAE,EAAGiB,CAAC,IAAKX,MAAM,CAACM,OAAO,CAACZ,EAAE,CAACiB,CAAC,CAAA;AAChC,GAAC,CAAC,CAAA;AACJ,CAAA;AAEA,SAASN,aAAa,CAACiB,IAAY,EAAEhC,KAAU,EAAkB;AAC/D,EAAA,IAAIiC,SAAS,GAAGD,IAAI,CAACE,OAAO,CAAC,GAAG,CAAC,CAAA;AACjC,EAAA,IAAIC,WAAW,GAAGH,IAAI,CAACE,OAAO,CAAC,GAAG,CAAC,CAAA;EACnC,MAAME,OAAO,GAAGN,IAAI,CAACC,GAAG,CAACE,SAAS,EAAEE,WAAW,CAAC,CAAA;EAEhD,OAAO;IACLH,IAAI;AACJrB,IAAAA,QAAQ,EAAEyB,OAAO,GAAG,CAAC,CAAC,GAAGJ,IAAI,CAACT,SAAS,CAAC,CAAC,EAAEa,OAAO,CAAC,GAAGJ,IAAI;AAC1DpB,IAAAA,IAAI,EAAEqB,SAAS,GAAG,CAAC,CAAC,GAAGD,IAAI,CAACT,SAAS,CAACU,SAAS,EAAEE,WAAW,CAAC,GAAG,EAAE;AAClEtB,IAAAA,MAAM,EAAEsB,WAAW,GAAG,CAAC,CAAC,GAAGH,IAAI,CAACT,SAAS,CAACY,WAAW,CAAC,GAAG,EAAE;AAC3DnC,IAAAA,KAAAA;GACD,CAAA;AACH,CAAA;;AAEA;AACA,SAASoB,eAAe,GAAG;AACzB,EAAA,OAAO,CAACU,IAAI,CAACO,MAAM,EAAE,GAAG,CAAC,EAAEC,QAAQ,CAAC,EAAE,CAAC,CAACf,SAAS,CAAC,CAAC,CAAC,CAAA;AACtD;;;;;;"}

package/build/cjs/{packages/router-core/src/index.js → index.js}

@@ -12,8 +12,8 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-var index = require('../../../node_modules/history/index.js');
-var tinyInvariant = require('../../../node_modules/tiny-invariant/dist/esm/tiny-invariant.js');
+var invariant = require('tiny-invariant');
+var history = require('./history.js');
 var path = require('./path.js');
 var qss = require('./qss.js');
 var route = require('./route.js');
@@ -22,13 +22,23 @@ var routeMatch = require('./routeMatch.js');
 var router = require('./router.js');
 var searchParams = require('./searchParams.js');
 var utils = require('./utils.js');
+var interop = require('./interop.js');
+var actions = require('./actions.js');
+var store = require('./store.js');
 
+function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }
 
+var invariant__default = /*#__PURE__*/_interopDefaultLegacy(invariant);
 
-exports.createBrowserHistory = index.createBrowserHistory;
-exports.createHashHistory = index.createHashHistory;
-exports.createMemoryHistory = index.createMemoryHistory;
-exports.invariant = tinyInvariant["default"];
+
+
+Object.defineProperty(exports, 'invariant', {
+	enumerable: true,
+	get: function () { return invariant__default["default"]; }
+});
+exports.createBrowserHistory = history.createBrowserHistory;
+exports.createHashHistory = history.createHashHistory;
+exports.createMemoryHistory = history.createMemoryHistory;
 exports.cleanPath = path.cleanPath;
 exports.interpolatePath = path.interpolatePath;
 exports.joinPaths = path.joinPaths;
@@ -41,18 +51,23 @@ exports.trimPathLeft = path.trimPathLeft;
 exports.trimPathRight = path.trimPathRight;
 exports.decode = qss.decode;
 exports.encode = qss.encode;
-exports.cascadeLoaderData = route.cascadeLoaderData;
-exports.createRoute = route.createRoute;
+exports.Route = route.Route;
 exports.createRouteConfig = routeConfig.createRouteConfig;
 exports.rootRouteId = routeConfig.rootRouteId;
-exports.createRouteMatch = routeMatch.createRouteMatch;
-exports.createRouter = router.createRouter;
+exports.RouteMatch = routeMatch.RouteMatch;
+exports.Router = router.Router;
+exports.defaultFetchServerDataFn = router.defaultFetchServerDataFn;
 exports.defaultParseSearch = searchParams.defaultParseSearch;
 exports.defaultStringifySearch = searchParams.defaultStringifySearch;
 exports.parseSearchWith = searchParams.parseSearchWith;
 exports.stringifySearchWith = searchParams.stringifySearchWith;
 exports.functionalUpdate = utils.functionalUpdate;
 exports.last = utils.last;
-exports.replaceEqualDeep = utils.replaceEqualDeep;
+exports.pick = utils.pick;
 exports.warning = utils.warning;
+exports.replaceEqualDeep = interop.replaceEqualDeep;
+exports.trackDeep = interop.trackDeep;
+exports.createAction = actions.createAction;
+exports.batch = store.batch;
+exports.createStore = store.createStore;
 //# sourceMappingURL=index.js.map

package/build/cjs/{packages/router-core/src/index.js.map → index.js.map}

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/build/cjs/interop.js

@@ -0,0 +1,175 @@
+/**
+ * router-core
+ *
+ * Copyright (c) TanStack
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE.md file in the root directory of this source tree.
+ *
+ * @license MIT
+ */
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+// /**
+//  * This function converts a store to an immutable value, which is
+//  * more complex than you think. On first read, (when prev is undefined)
+//  * every value must be recursively touched so tracking is "deep".
+//  * Every object/array structure must also be cloned to
+//  * have a new reference, otherwise it will get mutated by subsequent
+//  * store updates.
+//  *
+//  * In the case that prev is supplied, we have to do deep comparisons
+//  * between prev and next objects/array references and if they are deeply
+//  * equal, we can return the prev version for referential equality.
+//  */
+// export function storeToImmutable<T>(prev: any, next: T): T {
+//   const cache = new Map()
+
+//   // Visit all nodes
+//   // clone all next structures
+//   // from bottom up, if prev === next, return prev
+
+//   function recurse(prev: any, next: any) {
+//     if (cache.has(next)) {
+//       return cache.get(next)
+//     }
+
+//     const prevIsArray = Array.isArray(prev)
+//     const nextIsArray = Array.isArray(next)
+//     const prevIsObj = isPlainObject(prev)
+//     const nextIsObj = isPlainObject(next)
+//     const nextIsComplex = nextIsArray || nextIsObj
+
+//     const isArray = prevIsArray && nextIsArray
+//     const isObj = prevIsObj && nextIsObj
+
+//     const isSameStructure = isArray || isObj
+
+//     if (nextIsComplex) {
+//       const prevSize = isArray
+//         ? prev.length
+//         : isObj
+//         ? Object.keys(prev).length
+//         : -1
+//       const nextKeys = isArray ? next : Object.keys(next)
+//       const nextSize = nextKeys.length
+
+//       let changed = false
+//       const copy: any = nextIsArray ? [] : {}
+
+//       for (let i = 0; i < nextSize; i++) {
+//         const key = isArray ? i : nextKeys[i]
+//         const prevValue = isSameStructure ? prev[key] : undefined
+//         const nextValue = next[key]
+
+//         // Recurse the new value
+//         try {
+//           console.count(key)
+//           copy[key] = recurse(prevValue, nextValue)
+//         } catch {}
+
+//         // If the new value has changed reference,
+//         // mark the obj/array as changed
+//         if (!changed && copy[key] !== prevValue) {
+//           changed = true
+//         }
+//       }
+
+//       // No items have changed!
+//       // If something has changed, return a clone of the next obj/array
+//       if (changed || prevSize !== nextSize) {
+//         cache.set(next, copy)
+//         return copy
+//       }
+
+//       // If they are exactly the same, return the prev obj/array
+//       cache.set(next, prev)
+//       return prev
+//     }
+
+//     cache.set(next, next)
+//     return next
+//   }
+
+//   return recurse(prev, next)
+// }
+
+/**
+ * This function returns `a` if `b` is deeply equal.
+ * If not, it will replace any deeply equal children of `b` with those of `a`.
+ * This can be used for structural sharing between immutable JSON values for example.
+ * Do not use this with signals
+ */
+function replaceEqualDeep(prev, _next) {
+  if (prev === _next) {
+    return prev;
+  }
+  const next = _next;
+  const array = Array.isArray(prev) && Array.isArray(next);
+  if (array || isPlainObject(prev) && isPlainObject(next)) {
+    const prevSize = array ? prev.length : Object.keys(prev).length;
+    const nextItems = array ? next : Object.keys(next);
+    const nextSize = nextItems.length;
+    const copy = array ? [] : {};
+    let equalItems = 0;
+    for (let i = 0; i < nextSize; i++) {
+      const key = array ? i : nextItems[i];
+      copy[key] = replaceEqualDeep(prev[key], next[key]);
+      if (copy[key] === prev[key]) {
+        equalItems++;
+      }
+    }
+    return prevSize === nextSize && equalItems === prevSize ? prev : copy;
+  }
+  return next;
+}
+
+// Copied from: https://github.com/jonschlinkert/is-plain-object
+function isPlainObject(o) {
+  if (!hasObjectPrototype(o)) {
+    return false;
+  }
+
+  // If has modified constructor
+  const ctor = o.constructor;
+  if (typeof ctor === 'undefined') {
+    return true;
+  }
+
+  // If has modified prototype
+  const prot = ctor.prototype;
+  if (!hasObjectPrototype(prot)) {
+    return false;
+  }
+
+  // If constructor does not have an Object-specific method
+  if (!prot.hasOwnProperty('isPrototypeOf')) {
+    return false;
+  }
+
+  // Most likely a plain Object
+  return true;
+}
+function hasObjectPrototype(o) {
+  return Object.prototype.toString.call(o) === '[object Object]';
+}
+function trackDeep(obj) {
+  const seen = new Set();
+  JSON.stringify(obj, (_, value) => {
+    if (typeof value === 'function') {
+      return undefined;
+    }
+    if (typeof value === 'object' && value !== null) {
+      if (seen.has(value)) return;
+      seen.add(value);
+    }
+    return value;
+  });
+  return obj;
+}
+
+exports.replaceEqualDeep = replaceEqualDeep;
+exports.trackDeep = trackDeep;
+//# sourceMappingURL=interop.js.map

package/build/cjs/interop.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"interop.js","sources":["../../src/interop.ts"],"sourcesContent":["// /**\n//  * This function converts a store to an immutable value, which is\n//  * more complex than you think. On first read, (when prev is undefined)\n//  * every value must be recursively touched so tracking is \"deep\".\n//  * Every object/array structure must also be cloned to\n//  * have a new reference, otherwise it will get mutated by subsequent\n//  * store updates.\n//  *\n//  * In the case that prev is supplied, we have to do deep comparisons\n//  * between prev and next objects/array references and if they are deeply\n//  * equal, we can return the prev version for referential equality.\n//  */\n// export function storeToImmutable<T>(prev: any, next: T): T {\n//   const cache = new Map()\n\n//   // Visit all nodes\n//   // clone all next structures\n//   // from bottom up, if prev === next, return prev\n\n//   function recurse(prev: any, next: any) {\n//     if (cache.has(next)) {\n//       return cache.get(next)\n//     }\n\n//     const prevIsArray = Array.isArray(prev)\n//     const nextIsArray = Array.isArray(next)\n//     const prevIsObj = isPlainObject(prev)\n//     const nextIsObj = isPlainObject(next)\n//     const nextIsComplex = nextIsArray || nextIsObj\n\n//     const isArray = prevIsArray && nextIsArray\n//     const isObj = prevIsObj && nextIsObj\n\n//     const isSameStructure = isArray || isObj\n\n//     if (nextIsComplex) {\n//       const prevSize = isArray\n//         ? prev.length\n//         : isObj\n//         ? Object.keys(prev).length\n//         : -1\n//       const nextKeys = isArray ? next : Object.keys(next)\n//       const nextSize = nextKeys.length\n\n//       let changed = false\n//       const copy: any = nextIsArray ? [] : {}\n\n//       for (let i = 0; i < nextSize; i++) {\n//         const key = isArray ? i : nextKeys[i]\n//         const prevValue = isSameStructure ? prev[key] : undefined\n//         const nextValue = next[key]\n\n//         // Recurse the new value\n//         try {\n//           console.count(key)\n//           copy[key] = recurse(prevValue, nextValue)\n//         } catch {}\n\n//         // If the new value has changed reference,\n//         // mark the obj/array as changed\n//         if (!changed && copy[key] !== prevValue) {\n//           changed = true\n//         }\n//       }\n\n//       // No items have changed!\n//       // If something has changed, return a clone of the next obj/array\n//       if (changed || prevSize !== nextSize) {\n//         cache.set(next, copy)\n//         return copy\n//       }\n\n//       // If they are exactly the same, return the prev obj/array\n//       cache.set(next, prev)\n//       return prev\n//     }\n\n//     cache.set(next, next)\n//     return next\n//   }\n\n//   return recurse(prev, next)\n// }\n\n/**\n * This function returns `a` if `b` is deeply equal.\n * If not, it will replace any deeply equal children of `b` with those of `a`.\n * This can be used for structural sharing between immutable JSON values for example.\n * Do not use this with signals\n */\nexport function replaceEqualDeep<T>(prev: any, _next: T): T {\n  if (prev === _next) {\n    return prev\n  }\n\n  const next = _next as any\n\n  const array = Array.isArray(prev) && Array.isArray(next)\n\n  if (array || (isPlainObject(prev) && isPlainObject(next))) {\n    const prevSize = array ? prev.length : Object.keys(prev).length\n    const nextItems = array ? next : Object.keys(next)\n    const nextSize = nextItems.length\n    const copy: any = array ? [] : {}\n\n    let equalItems = 0\n\n    for (let i = 0; i < nextSize; i++) {\n      const key = array ? i : nextItems[i]\n      copy[key] = replaceEqualDeep(prev[key], next[key])\n      if (copy[key] === prev[key]) {\n        equalItems++\n      }\n    }\n\n    return prevSize === nextSize && equalItems === prevSize ? prev : copy\n  }\n\n  return next\n}\n\n// Copied from: https://github.com/jonschlinkert/is-plain-object\nfunction isPlainObject(o: any) {\n  if (!hasObjectPrototype(o)) {\n    return false\n  }\n\n  // If has modified constructor\n  const ctor = o.constructor\n  if (typeof ctor === 'undefined') {\n    return true\n  }\n\n  // If has modified prototype\n  const prot = ctor.prototype\n  if (!hasObjectPrototype(prot)) {\n    return false\n  }\n\n  // If constructor does not have an Object-specific method\n  if (!prot.hasOwnProperty('isPrototypeOf')) {\n    return false\n  }\n\n  // Most likely a plain Object\n  return true\n}\n\nfunction hasObjectPrototype(o: any) {\n  return Object.prototype.toString.call(o) === '[object Object]'\n}\n\nexport function trackDeep<T>(obj: T): T {\n  const seen = new Set()\n\n  JSON.stringify(obj, (_, value) => {\n    if (typeof value === 'function') {\n      return undefined\n    }\n    if (typeof value === 'object' && value !== null) {\n      if (seen.has(value)) return\n      seen.add(value)\n    }\n\n    return value\n  })\n\n  return obj\n}\n"],"names":["replaceEqualDeep","prev","_next","next","array","Array","isArray","isPlainObject","prevSize","length","Object","keys","nextItems","nextSize","copy","equalItems","i","key","o","hasObjectPrototype","ctor","constructor","prot","prototype","hasOwnProperty","toString","call","trackDeep","obj","seen","Set","JSON","stringify","_","value","undefined","has","add"],"mappings":";;;;;;;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,gBAAgB,CAAIC,IAAS,EAAEC,KAAQ,EAAK;EAC1D,IAAID,IAAI,KAAKC,KAAK,EAAE;AAClB,IAAA,OAAOD,IAAI,CAAA;AACb,GAAA;EAEA,MAAME,IAAI,GAAGD,KAAY,CAAA;AAEzB,EAAA,MAAME,KAAK,GAAGC,KAAK,CAACC,OAAO,CAACL,IAAI,CAAC,IAAII,KAAK,CAACC,OAAO,CAACH,IAAI,CAAC,CAAA;EAExD,IAAIC,KAAK,IAAKG,aAAa,CAACN,IAAI,CAAC,IAAIM,aAAa,CAACJ,IAAI,CAAE,EAAE;AACzD,IAAA,MAAMK,QAAQ,GAAGJ,KAAK,GAAGH,IAAI,CAACQ,MAAM,GAAGC,MAAM,CAACC,IAAI,CAACV,IAAI,CAAC,CAACQ,MAAM,CAAA;IAC/D,MAAMG,SAAS,GAAGR,KAAK,GAAGD,IAAI,GAAGO,MAAM,CAACC,IAAI,CAACR,IAAI,CAAC,CAAA;AAClD,IAAA,MAAMU,QAAQ,GAAGD,SAAS,CAACH,MAAM,CAAA;AACjC,IAAA,MAAMK,IAAS,GAAGV,KAAK,GAAG,EAAE,GAAG,EAAE,CAAA;IAEjC,IAAIW,UAAU,GAAG,CAAC,CAAA;IAElB,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,QAAQ,EAAEG,CAAC,EAAE,EAAE;MACjC,MAAMC,GAAG,GAAGb,KAAK,GAAGY,CAAC,GAAGJ,SAAS,CAACI,CAAC,CAAC,CAAA;AACpCF,MAAAA,IAAI,CAACG,GAAG,CAAC,GAAGjB,gBAAgB,CAACC,IAAI,CAACgB,GAAG,CAAC,EAAEd,IAAI,CAACc,GAAG,CAAC,CAAC,CAAA;MAClD,IAAIH,IAAI,CAACG,GAAG,CAAC,KAAKhB,IAAI,CAACgB,GAAG,CAAC,EAAE;AAC3BF,QAAAA,UAAU,EAAE,CAAA;AACd,OAAA;AACF,KAAA;IAEA,OAAOP,QAAQ,KAAKK,QAAQ,IAAIE,UAAU,KAAKP,QAAQ,GAAGP,IAAI,GAAGa,IAAI,CAAA;AACvE,GAAA;AAEA,EAAA,OAAOX,IAAI,CAAA;AACb,CAAA;;AAEA;AACA,SAASI,aAAa,CAACW,CAAM,EAAE;AAC7B,EAAA,IAAI,CAACC,kBAAkB,CAACD,CAAC,CAAC,EAAE;AAC1B,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA;AACA,EAAA,MAAME,IAAI,GAAGF,CAAC,CAACG,WAAW,CAAA;AAC1B,EAAA,IAAI,OAAOD,IAAI,KAAK,WAAW,EAAE;AAC/B,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;;AAEA;AACA,EAAA,MAAME,IAAI,GAAGF,IAAI,CAACG,SAAS,CAAA;AAC3B,EAAA,IAAI,CAACJ,kBAAkB,CAACG,IAAI,CAAC,EAAE;AAC7B,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA;AACA,EAAA,IAAI,CAACA,IAAI,CAACE,cAAc,CAAC,eAAe,CAAC,EAAE;AACzC,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA;AACA,EAAA,OAAO,IAAI,CAAA;AACb,CAAA;AAEA,SAASL,kBAAkB,CAACD,CAAM,EAAE;EAClC,OAAOR,MAAM,CAACa,SAAS,CAACE,QAAQ,CAACC,IAAI,CAACR,CAAC,CAAC,KAAK,iBAAiB,CAAA;AAChE,CAAA;AAEO,SAASS,SAAS,CAAIC,GAAM,EAAK;AACtC,EAAA,MAAMC,IAAI,GAAG,IAAIC,GAAG,EAAE,CAAA;EAEtBC,IAAI,CAACC,SAAS,CAACJ,GAAG,EAAE,CAACK,CAAC,EAAEC,KAAK,KAAK;AAChC,IAAA,IAAI,OAAOA,KAAK,KAAK,UAAU,EAAE;AAC/B,MAAA,OAAOC,SAAS,CAAA;AAClB,KAAA;IACA,IAAI,OAAOD,KAAK,KAAK,QAAQ,IAAIA,KAAK,KAAK,IAAI,EAAE;AAC/C,MAAA,IAAIL,IAAI,CAACO,GAAG,CAACF,KAAK,CAAC,EAAE,OAAA;AACrBL,MAAAA,IAAI,CAACQ,GAAG,CAACH,KAAK,CAAC,CAAA;AACjB,KAAA;AAEA,IAAA,OAAOA,KAAK,CAAA;AACd,GAAC,CAAC,CAAA;AAEF,EAAA,OAAON,GAAG,CAAA;AACZ;;;;;"}