(root, queue, lane)
| 16748 | |
| 16749 | |
| 16750 | function entangleTransitionUpdate(root, queue, lane) { |
| 16751 | if (isTransitionLane(lane)) { |
| 16752 | var queueLanes = queue.lanes; // If any entangled lanes are no longer pending on the root, then they |
| 16753 | // must have finished. We can remove them from the shared queue, which |
| 16754 | // represents a superset of the actually pending lanes. In some cases we |
| 16755 | // may entangle more than we need to, but that's OK. In fact it's worse if |
| 16756 | // we *don't* entangle when we should. |
| 16757 | |
| 16758 | queueLanes = intersectLanes(queueLanes, root.pendingLanes); // Entangle the new transition lane with the other transition lanes. |
| 16759 | |
| 16760 | var newQueueLanes = mergeLanes(queueLanes, lane); |
| 16761 | queue.lanes = newQueueLanes; // Even if queue.lanes already include lane, we don't know for certain if |
| 16762 | // the lane finished since the last time we entangled it. So we need to |
| 16763 | // entangle it again, just to be sure. |
| 16764 | |
| 16765 | markRootEntangled(root, newQueueLanes); |
| 16766 | } |
| 16767 | } |
| 16768 | |
| 16769 | function markUpdateInDevTools(fiber, lane, action) { |
| 16770 |
no test coverage detected
searching dependent graphs…