boostorg/integer
1
0
Fork 1
mirror of https://github.com/boostorg/integer.git synced 2025-11-02 09:11:38 +01:00
Code Issues Packages Projects Releases Wiki Activity

Don't run tests on gcc 4 and earlier; not worth the pain.

Browse Source
This commit is contained in:
Nick Thompson
2018-10-28 22:40:36 -06:00
parent bbb1da275b
commit c4c3373708
3 changed files with 7 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/modular_arithmetic/extended_euclidean.qbk
View File

@@ -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]