You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I haven't added NaturalInteger (#112) yet, but I noticed one more thing: I could efficiently derive a safe 2-by-1 division algorithm from an unsafe protocol requirement. It might reduce some overhead in other algorithms. I've also considered a more elaborate Guarantee-esque (#62) approach, but I don't think it would add much value in this case.
protocolNaturalInteger{@unsafe@inlinablestaticfunc division(unchecked dividend:Doublet<Self>, by divisor:Nonzero<Self>)->Division<Self,Self>}
Of note, I don't believe the 2-by-1 standard library algorithm is a built-in so I could perhaps roll my own at some point.
The text was updated successfully, but these errors were encountered:
I haven't added
NaturalInteger
(#112) yet, but I noticed one more thing: I could efficiently derive a safe 2-by-1 division algorithm from an unsafe protocol requirement. It might reduce some overhead in other algorithms. I've also considered a more elaborate Guarantee-esque (#62) approach, but I don't think it would add much value in this case.Of note, I don't believe the 2-by-1 standard library algorithm is a built-in so I could perhaps roll my own at some point.
The text was updated successfully, but these errors were encountered: