fn normalize<L: Limbs>(a: L, b: (Choice, L), c: L) -> (L, (Choice, L), L)Expand description
Normalize an almost-reduced element.
For a positive definite binary quadratic form (a, b, c) such that:
b^2 - 4ac = deltawheredelta < 0(the form is well-defined for a negative discriminant)- $delta \cong 1 \mod 2$
0 <= a, c(aandcaren’t negative, as enforced by the type system)|b| <= a <= c
Yield the reduced equivalent form (a', b', c') such that:
|b'| <= a' <= c'b' >= 0if(|b'| == a') || (a' == c')
This is intended to correspond to steps 2 and 5 of Algorithm 1.