mirror of
https://github.com/boostorg/integer.git
synced 2025-07-31 13:17:12 +02:00
Don't run tests on gcc 4 and earlier; not worth the pain.
This commit is contained in:
@ -38,6 +38,8 @@ The extended Euclidean algorithm solves the integer relation /mx + ny/ = gcd(/m/
|
||||
int y = res.y;
|
||||
// mx + ny = gcd(m,n) should now hold
|
||||
|
||||
Unlike most of the library, the extended Euclidean algorithm requires C++11 features.
|
||||
|
||||
[endsect]
|
||||
|
||||
[section References]
|
||||
|
Reference in New Issue
Block a user