mirror of https://github.com/CGAL/cgal
Reference Mpzf/Gmpzf/MP_Float from each other's doc
This commit is contained in:
parent
b0e2e44894
commit
28790e8da9
|
|
@ -9,7 +9,8 @@ numbers of the form \f$ m*2^e\f$, where \f$ m\f$ is an arbitrary precision integ
|
||||||
based on the \gmp library, and \f$ e\f$
|
based on the \gmp library, and \f$ e\f$
|
||||||
is of type `long`. This type can be considered exact, even if the
|
is of type `long`. This type can be considered exact, even if the
|
||||||
exponent is not a multiple-precision number. This number type offers
|
exponent is not a multiple-precision number. This number type offers
|
||||||
functionality very similar to `MP_Float` but is generally faster.
|
functionality very similar to `MP_Float` but is generally faster. `Mpzf` also
|
||||||
|
provides similar functionality and is generally faster than `Gmpzf`.
|
||||||
|
|
||||||
\cgalModels{EuclideanRing,RealEmbeddable}
|
\cgalModels{EuclideanRing,RealEmbeddable}
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -24,8 +24,8 @@ plan to also have a multiprecision exponent to fix this issue.
|
||||||
|
|
||||||
The implementation of `MP_Float` is simple but provides a quadratic
|
The implementation of `MP_Float` is simple but provides a quadratic
|
||||||
complexity for multiplications. This can be a problem for large operands.
|
complexity for multiplications. This can be a problem for large operands.
|
||||||
For faster implementations of the same functionality with large integral
|
For faster implementations of the same functionality, if `GMP` is available,
|
||||||
values, you may want to consider using `GMP` or `LEDA` instead.
|
you may want to consider using `Mpzf` or `Gmpzf`.
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue