@tanstack/router-core 0.0.1-beta.36 → 0.0.1-beta.39

package/src/sharedClone.ts

@@ -0,0 +1,118 @@
+/**
+ * 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 JSON values for example.
+ */
+export function sharedClone<T>(prev: any, next: T, touchAll?: boolean): T {
+  const things = new Map()
+
+  function recurse(prev: any, next: any) {
+    if (prev === next) {
+      return prev
+    }
+
+    if (things.has(next)) {
+      return things.get(next)
+    }
+
+    const prevIsArray = Array.isArray(prev)
+    const nextIsArray = Array.isArray(next)
+    const prevIsObj = isPlainObject(prev)
+    const nextIsObj = isPlainObject(next)
+
+    const isArray = prevIsArray && nextIsArray
+    const isObj = prevIsObj && nextIsObj
+
+    const isSameStructure = isArray || isObj
+
+    // Both are arrays or objects
+    if (isSameStructure) {
+      const aSize = isArray ? prev.length : Object.keys(prev).length
+      const bItems = isArray ? next : Object.keys(next)
+      const bSize = bItems.length
+      const copy: any = isArray ? [] : {}
+
+      let equalItems = 0
+
+      for (let i = 0; i < bSize; i++) {
+        const key = isArray ? i : bItems[i]
+        if (copy[key] === prev[key]) {
+          equalItems++
+        }
+      }
+      if (aSize === bSize && equalItems === aSize) {
+        things.set(next, prev)
+        return prev
+      }
+      things.set(next, copy)
+      for (let i = 0; i < bSize; i++) {
+        const key = isArray ? i : bItems[i]
+        if (typeof bItems[i] === 'function') {
+          copy[key] = prev[key]
+        } else {
+          copy[key] = recurse(prev[key], next[key])
+        }
+        if (copy[key] === prev[key]) {
+          equalItems++
+        }
+      }
+
+      return copy
+    }
+
+    if (nextIsArray) {
+      const copy: any[] = []
+      things.set(next, copy)
+      for (let i = 0; i < next.length; i++) {
+        copy[i] = recurse(undefined, next[i])
+      }
+      return copy as T
+    }
+
+    if (nextIsObj) {
+      const copy = {} as any
+      things.set(next, copy)
+      const nextKeys = Object.keys(next)
+      for (let i = 0; i < nextKeys.length; i++) {
+        const key = nextKeys[i]!
+        copy[key] = recurse(undefined, next[key])
+      }
+      return copy as T
+    }
+
+    return next
+  }
+
+  return recurse(prev, next)
+}
+
+// Copied from: https://github.com/jonschlinkert/is-plain-object
+function isPlainObject(o: any) {
+  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: any) {
+  return Object.prototype.toString.call(o) === '[object Object]'
+}

package/src/utils.ts

@@ -60,71 +60,6 @@ export type PickExclude<T, U> = {
   [K in keyof T as T[K] extends U ? never : K]: T[K]
 }
 
-/**
- * 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 JSON values for example.
- */
-export function replaceEqualDeep(prev: any, next: any) {
-  if (prev === next) {
-    return prev
-  }
-
-  const array = Array.isArray(prev) && Array.isArray(next)
-
-  if (array || (isPlainObject(prev) && isPlainObject(next))) {
-    const aSize = array ? prev.length : Object.keys(prev).length
-    const bItems = array ? next : Object.keys(next)
-    const bSize = bItems.length
-    const copy: any = array ? [] : {}
-
-    let equalItems = 0
-
-    for (let i = 0; i < bSize; i++) {
-      const key = array ? i : bItems[i]
-      copy[key] = replaceEqualDeep(prev[key], next[key])
-      if (copy[key] === prev[key]) {
-        equalItems++
-      }
-    }
-
-    return aSize === bSize && equalItems === aSize ? prev : copy
-  }
-
-  return next
-}
-
-// Copied from: https://github.com/jonschlinkert/is-plain-object
-function isPlainObject(o: any) {
-  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: any) {
-  return Object.prototype.toString.call(o) === '[object Object]'
-}
-
 export function last<T>(arr: T[]) {
   return arr[arr.length - 1]
 }

package/build/cjs/_virtual/_rollupPluginBabelHelpers.js

@@ -1,31 +0,0 @@
-/**
- * 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 });
-
-function _extends() {
-  _extends = Object.assign ? Object.assign.bind() : function (target) {
-    for (var i = 1; i < arguments.length; i++) {
-      var source = arguments[i];
-      for (var key in source) {
-        if (Object.prototype.hasOwnProperty.call(source, key)) {
-          target[key] = source[key];
-        }
-      }
-    }
-    return target;
-  };
-  return _extends.apply(this, arguments);
-}
-
-exports["extends"] = _extends;
-//# sourceMappingURL=_rollupPluginBabelHelpers.js.map

package/build/cjs/_virtual/_rollupPluginBabelHelpers.js.map

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