-
Notifications
You must be signed in to change notification settings - Fork 904
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
chore: get basic swapping working, but preview still weird
- Loading branch information
Showing
3 changed files
with
174 additions
and
96 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,41 +1,34 @@ | ||
| /* eslint-disable import/prefer-default-export */ | ||
| import { insertNode } from './tree-data-utils'; | ||
| import { | ||
| insertNode, | ||
| getDescendantCount, | ||
| getFlatDataFromTree, | ||
| } from './tree-data-utils'; | ||
|
|
||
| let memoizedInsertArgsArray = []; | ||
| let memoizedInsertKeysArray = []; | ||
| let memoizedInsertResult = null; | ||
| const memoize = f => { | ||
| let savedArgsArray = []; | ||
| let savedKeysArray = []; | ||
| let savedResult = null; | ||
|
|
||
| /** | ||
| * Insert a node into the tree at the given depth, after the minimum index | ||
| * | ||
| * @param {!Object[]} treeData - Tree data | ||
| * @param {!number} depth - The depth to insert the node at (the first level of the array being depth 0) | ||
| * @param {!number} minimumTreeIndex - The lowest possible treeIndex to insert the node at | ||
| * @param {!Object} newNode - The node to insert into the tree | ||
| * @param {boolean=} ignoreCollapsed - Ignore children of nodes without `expanded` set to `true` | ||
| * @param {boolean=} expandParent - If true, expands the parent of the inserted node | ||
| * @param {!function} getNodeKey - Function to get the key from the nodeData and tree index | ||
| * | ||
| * @return {Object} result | ||
| * @return {Object[]} result.treeData - The tree data with the node added | ||
| * @return {number} result.treeIndex - The tree index at which the node was inserted | ||
| * @return {number[]|string[]} result.path - Array of keys leading to the node location after insertion | ||
| */ | ||
| export function memoizedInsertNode(args) { | ||
| const keysArray = Object.keys(args).sort(); | ||
| const argsArray = keysArray.map(key => args[key]); | ||
| return args => { | ||
| 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 !== memoizedInsertArgsArray.length || | ||
| argsArray.some((arg, index) => arg !== memoizedInsertArgsArray[index]) || | ||
| keysArray.some((key, index) => key !== memoizedInsertKeysArray[index]) | ||
| ) { | ||
| memoizedInsertArgsArray = argsArray; | ||
| memoizedInsertKeysArray = keysArray; | ||
| memoizedInsertResult = insertNode(args); | ||
| } | ||
| // 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 memoizedInsertResult; | ||
| } | ||
| return savedResult; | ||
| }; | ||
| }; | ||
|
|
||
| export const memoizedInsertNode = memoize(insertNode); | ||
| export const memoizedGetFlatDataFromTree = memoize(getFlatDataFromTree); | ||
| export const memoizedGetDescendantCount = memoize(getDescendantCount); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters