Navigation: Up, Table of Contents,  Short Table of Contents,  Package Overview,  Bibliography,  Index,  Title Page

CGAL::Gcd<NT>

Definition

The function Gcd<NT> computes the greatest common divisor of two values.

#include <CGAL/number_utils_classes.h>

Is Model for the Concepts

AdaptableFunctor

NT f ( NT ntval1, NT ntval2)
computes the greatest common divisor of two numbers. If ntval1 is 0, the function returns ntval2.
Precondition: : ntval2 is not zero.

Implementation

Uses Euclid's algorithm.

Next: mpq_class
Navigation: Up, Table of Contents,  Short Table of Contents,  Package Overview,  Bibliography,  Index,  Title Page
CGAL Open Source Project. Release 3.2.1. 13 July 2006.