()
| 5853 | concurrentQueuesIndex = 0, |
| 5854 | concurrentlyUpdatedLanes = 0; |
| 5855 | function finishQueueingConcurrentUpdates() { |
| 5856 | for ( |
| 5857 | var endIndex = concurrentQueuesIndex, |
| 5858 | i = (concurrentlyUpdatedLanes = concurrentQueuesIndex = 0); |
| 5859 | i < endIndex; |
| 5860 | |
| 5861 | ) { |
| 5862 | var fiber = concurrentQueues[i]; |
| 5863 | concurrentQueues[i++] = null; |
| 5864 | var queue = concurrentQueues[i]; |
| 5865 | concurrentQueues[i++] = null; |
| 5866 | var update = concurrentQueues[i]; |
| 5867 | concurrentQueues[i++] = null; |
| 5868 | var lane = concurrentQueues[i]; |
| 5869 | concurrentQueues[i++] = null; |
| 5870 | if (null !== queue && null !== update) { |
| 5871 | var pending = queue.pending; |
| 5872 | null === pending |
| 5873 | ? (update.next = update) |
| 5874 | : ((update.next = pending.next), (pending.next = update)); |
| 5875 | queue.pending = update; |
| 5876 | } |
| 5877 | 0 !== lane && markUpdateLaneFromFiberToRoot(fiber, update, lane); |
| 5878 | } |
| 5879 | } |
| 5880 | function enqueueUpdate$1(fiber, queue, update, lane) { |
| 5881 | concurrentQueues[concurrentQueuesIndex++] = fiber; |
| 5882 | concurrentQueues[concurrentQueuesIndex++] = queue; |
no test coverage detected
searching dependent graphs…