panstromek: I remember reading somewhere (probably here) that borrow checking has
O(n^3)asymptotic complexity, relative to the size of the function.Nadrieril: Compared to match exhaustiveness which is NP-hard and trait solving which is undecidable, a polynomial complexity feels refreshingly sane.
20 Likes