(workInProgress, capturedUpdate)
| 10788 | } |
| 10789 | } |
| 10790 | function enqueueCapturedUpdate(workInProgress, capturedUpdate) { |
| 10791 | var queue = workInProgress.updateQueue, |
| 10792 | current = workInProgress.alternate; |
| 10793 | if ( |
| 10794 | null !== current && |
| 10795 | ((current = current.updateQueue), queue === current) |
| 10796 | ) { |
| 10797 | var newFirst = null, |
| 10798 | newLast = null; |
| 10799 | queue = queue.firstBaseUpdate; |
| 10800 | if (null !== queue) { |
| 10801 | do { |
| 10802 | var clone = { |
| 10803 | lane: queue.lane, |
| 10804 | tag: queue.tag, |
| 10805 | payload: queue.payload, |
| 10806 | callback: null, |
| 10807 | next: null |
| 10808 | }; |
| 10809 | null === newLast |
| 10810 | ? (newFirst = newLast = clone) |
| 10811 | : (newLast = newLast.next = clone); |
| 10812 | queue = queue.next; |
| 10813 | } while (null !== queue); |
| 10814 | null === newLast |
| 10815 | ? (newFirst = newLast = capturedUpdate) |
| 10816 | : (newLast = newLast.next = capturedUpdate); |
| 10817 | } else newFirst = newLast = capturedUpdate; |
| 10818 | queue = { |
| 10819 | baseState: current.baseState, |
| 10820 | firstBaseUpdate: newFirst, |
| 10821 | lastBaseUpdate: newLast, |
| 10822 | shared: current.shared, |
| 10823 | callbacks: current.callbacks |
| 10824 | }; |
| 10825 | workInProgress.updateQueue = queue; |
| 10826 | return; |
| 10827 | } |
| 10828 | workInProgress = queue.lastBaseUpdate; |
| 10829 | null === workInProgress |
| 10830 | ? (queue.firstBaseUpdate = capturedUpdate) |
| 10831 | : (workInProgress.next = capturedUpdate); |
| 10832 | queue.lastBaseUpdate = capturedUpdate; |
| 10833 | } |
| 10834 | var didReadFromEntangledAsyncAction = !1; |
| 10835 | function suspendIfUpdateReadFromEntangledAsyncAction() { |
| 10836 | if (didReadFromEntangledAsyncAction) { |
no outgoing calls
no test coverage detected
searching dependent graphs…