(fiber)
| 3846 | throw Error(formatProdErrorMessage(188)); |
| 3847 | } |
| 3848 | function findCurrentFiberUsingSlowPath(fiber) { |
| 3849 | var alternate = fiber.alternate; |
| 3850 | if (!alternate) { |
| 3851 | alternate = getNearestMountedFiber(fiber); |
| 3852 | if (null === alternate) throw Error(formatProdErrorMessage(188)); |
| 3853 | return alternate !== fiber ? null : fiber; |
| 3854 | } |
| 3855 | for (var a = fiber, b = alternate; ; ) { |
| 3856 | var parentA = a.return; |
| 3857 | if (null === parentA) break; |
| 3858 | var parentB = parentA.alternate; |
| 3859 | if (null === parentB) { |
| 3860 | b = parentA.return; |
| 3861 | if (null !== b) { |
| 3862 | a = b; |
| 3863 | continue; |
| 3864 | } |
| 3865 | break; |
| 3866 | } |
| 3867 | if (parentA.child === parentB.child) { |
| 3868 | for (parentB = parentA.child; parentB; ) { |
| 3869 | if (parentB === a) return assertIsMounted(parentA), fiber; |
| 3870 | if (parentB === b) return assertIsMounted(parentA), alternate; |
| 3871 | parentB = parentB.sibling; |
| 3872 | } |
| 3873 | throw Error(formatProdErrorMessage(188)); |
| 3874 | } |
| 3875 | if (a.return !== b.return) (a = parentA), (b = parentB); |
| 3876 | else { |
| 3877 | for (var didFindChild = !1, child$2 = parentA.child; child$2; ) { |
| 3878 | if (child$2 === a) { |
| 3879 | didFindChild = !0; |
| 3880 | a = parentA; |
| 3881 | b = parentB; |
| 3882 | break; |
| 3883 | } |
| 3884 | if (child$2 === b) { |
| 3885 | didFindChild = !0; |
| 3886 | b = parentA; |
| 3887 | a = parentB; |
| 3888 | break; |
| 3889 | } |
| 3890 | child$2 = child$2.sibling; |
| 3891 | } |
| 3892 | if (!didFindChild) { |
| 3893 | for (child$2 = parentB.child; child$2; ) { |
| 3894 | if (child$2 === a) { |
| 3895 | didFindChild = !0; |
| 3896 | a = parentB; |
| 3897 | b = parentA; |
| 3898 | break; |
| 3899 | } |
| 3900 | if (child$2 === b) { |
| 3901 | didFindChild = !0; |
| 3902 | b = parentB; |
| 3903 | a = parentA; |
| 3904 | break; |
| 3905 | } |
no test coverage detected
searching dependent graphs…