Extended euclidean algorithm for numbers.
More...
#include <EEA.h>
|
static std::pair< IntegerType, IntegerType > | calculate (const IntegerType &a, const IntegerType &b) |
|
static void | calculate_recursive (const IntegerType &a, const IntegerType &b, IntegerType &s, IntegerType &t) |
|
template<typename IntegerType>
struct carl::EEA< IntegerType >
Extended euclidean algorithm for numbers.
Definition at line 18 of file EEA.h.
◆ calculate()
template<typename IntegerType >
static std::pair<IntegerType, IntegerType> carl::EEA< IntegerType >::calculate |
( |
const IntegerType & |
a, |
|
|
const IntegerType & |
b |
|
) |
| |
|
inlinestatic |
Definition at line 20 of file EEA.h.
◆ calculate_recursive()
template<typename IntegerType >
static void carl::EEA< IntegerType >::calculate_recursive |
( |
const IntegerType & |
a, |
|
|
const IntegerType & |
b, |
|
|
IntegerType & |
s, |
|
|
IntegerType & |
t |
|
) |
| |
|
inlinestatic |
- Todo:
- a iterative implementation might be faster
Definition at line 42 of file EEA.h.
The documentation for this struct was generated from the following file:
- carl-arith/numbers/adaption_native/EEA.h