@marciocamello/react-sortable-tree/src/utils/memoized-tree-data-utils.ts

Drag-and-drop sortable component for nested data and hierarchies

import {
  getDescendantCount,
  getFlatDataFromTree,
  insertNode,
} from './tree-data-utils'

const memoize = (f: (...args: any) => void) => {
  let savedArgsArray: any = []
  let savedKeysArray: any = []
  let savedResult: any

  return (args: any) => {
    const keysArray = Object.keys(args).sort()
    const argsArray = keysArray.map((key) => args[key])

    // If the arguments for the last insert operation are different than this time,
    // recalculate the result
    if (
      argsArray.length !== savedArgsArray.length ||
      argsArray.some((arg, index) => arg !== savedArgsArray[index]) ||
      keysArray.some((key, index) => key !== savedKeysArray[index])
    ) {
      savedArgsArray = argsArray
      savedKeysArray = keysArray
      savedResult = f(args)
    }

    return savedResult
  }
}

export const memoizedInsertNode = memoize(insertNode)
export const memoizedGetFlatDataFromTree = memoize(getFlatDataFromTree)
export const memoizedGetDescendantCount = memoize(getDescendantCount)