MCPcopy Create free account
hub / github.com/danielstocks/react-sortable / mapRemainingChildren

Function mapRemainingChildren

bundle.js:7085–7087  ·  view source on GitHub ↗
(returnFiber,currentFirstChild)

Source from the content-addressed store, hash-verified

7083return null;}// TODO: For the shouldClone case, this could be micro-optimized a bit by
7084// assuming that after the first child we've already added everything.
7085var childToDelete=currentFirstChild;while(childToDelete!==null){deleteChild(returnFiber,childToDelete);childToDelete=childToDelete.sibling;}return null;}function mapRemainingChildren(returnFiber,currentFirstChild){// Add the remaining children to a temporary map so that we can find them by
7086// keys quickly. Implicit (null) keys get added to this set with their index
7087var existingChildren=new Map();var existingChild=currentFirstChild;while(existingChild!==null){if(existingChild.key!==null){existingChildren.set(existingChild.key,existingChild);}else{existingChildren.set(existingChild.index,existingChild);}existingChild=existingChild.sibling;}return existingChildren;}function useFiber(fiber,priority){// We currently set sibling to null and index to 0 here because it is easy
7088// to forget to do before returning it. E.g. for the single child case.
7089if(shouldClone){var clone=createWorkInProgress$2(fiber,priority);clone.index=0;clone.sibling=null;return clone;}else{// We override the pending priority even if it is higher, because if
7090// we're reconciling at a lower priority that means that this was

Callers 2

reconcileChildrenArrayFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected