carl
24.04
Computer ARithmetic Library
GCD_Monomial.h
Go to the documentation of this file.
1
#pragma once
2
3
#include "../Monomial.h"
4
5
namespace
carl
{
6
7
/**
8
* Calculates the least common multiple of two monomial pointers.
9
* If both are valid objects, the gcd of both is calculated.
10
* If only one is a valid object, this one is returned.
11
* If both are invalid objects, an empty monomial is returned.
12
* @param lhs First monomial.
13
* @param rhs Second monomial.
14
* @return gcd of lhs and rhs.
15
*/
16
Monomial::Arg
gcd
(
const
Monomial::Arg
& lhs,
const
Monomial::Arg
& rhs);
17
18
}
carl
carl is the main namespace for the library.
carl::gcd
cln::cl_I gcd(const cln::cl_I &a, const cln::cl_I &b)
Calculate the greatest common divisor of two integers.
Definition:
operations.h:310
carl::Monomial::Arg
std::shared_ptr< const Monomial > Arg
Definition:
Monomial.h:62
carl-arith
poly
umvpoly
functions
GCD_Monomial.h
Generated by
1.9.1