Summary: 20 instances, 16 unique

Text	Count
// TODO: Kahan uses a much more complicated expression here; possibly	1
// TODO: make this API and make it possible to implement more	1
// TODO: constraint should really be weaker than FloatingPoint,	1
// TODO: If we were really, really careful about overflow, some of these	1
// TODO: this implementation is not quite correct, because n may be	2
// TODO: This could be performed more efficiently.	1
// TODO: this implementation is not quite correct, because either n or	3
/// TODO: introductory text on complex numbers	1
// TODO: consider providing an FMA-less implementation for use when	1
// TODO: detect when RealType is Float and just promote to Double, then	1
// Further TODO: decide policy for point at infinity / NaN. Unlike most	1
// TODO: it's unfortunate that we can't specify a custom random source	1
// BinaryInteger. Hence, this is a TODO for the future.	1
// TODO: this is untested currently.	2
// TODO: figure out if there's some way to avoid these surprising results	1
// TODO: Kahan uses a different expression for evaluation here; it	1