songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

comment was moved to the user manual

This commit is contained in:
Andreas Fabri 2012-10-03 06:17:23 +00:00
parent 744556a941
commit 4ef4b18fd1
1 changed files with 0 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
Modular_arithmetic/examples/Modular_arithmetic/modular_filter.cpp
View File

@ -1,18 +1,3 @@
/* Modular arithmetic can be used as a filter, in this example modular
arithmetic is used to avoid unnecessary gcd computations of polynomials.
A gcd computation can be very costly due to coefficient growth within the
Euclidean algorithm.
The general idea is that firstly the gcd is computed with respect
to one prime only. If this modular gcd is constant we can (in most cases)
conclude that the actual gcd is constant as well.
For this purpose the example introduces the function may_have_common_factor.
Note that there are two versions of this function, namely for the case
that the coefficient type is Modularizable and that it is not.
If the type is not Modularizable the filter is just not applied and the
function returns true.
*/
#include <CGAL/basic.h>