tomsfastmath
TomsFastMath is a fast public domain, open source, large integer arithmetic library written in portable ISO C. (by libtom)
gauss
Symbolic Math Library (by Marcos30004347)
| tomsfastmath | gauss | |
|---|---|---|
| 1 | 1 | |
| 204 | 3 | |
| 0.5% | - | |
| 5.5 | 0.0 | |
| 5 months ago | 9 months ago | |
| C | HTML | |
| GNU General Public License v3.0 or later | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
tomsfastmath
Posts with mentions or reviews of tomsfastmath.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-13.
gauss
Posts with mentions or reviews of gauss.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-13.
-
How are infinitely large numbers represented and used like Python’s int class and Haskell’s Integer type?
You can find the python implementation for big integers at "https://github.com/python/cpython/blob/main/Objects/longobject.c". In resume, big integers are stored as linear arrays of 32 bits integers on the heap, the number is stored base 230, I dont remember exactly why they let 2 bits out, but I guess there is some edge cases when doing arithmetic that need those extra bits, this base makes it easier to speedup computations using bitwise operations and base 10 is really inefficient sinse we are working with binary computers. The algorithms in the python source are taken from "The Art of Computer Programming Volume 2" Book from Donald Knuth, I have also implemented some of those algorithms on my computer algebra system, so if you are having difficulty following the python source I recomend you give a look at "https://github.com/Marcos30004347/gauss/blob/main/gauss/Algebra/Int.hpp", there you will find some extra references as well.
What are some alternatives?
When comparing tomsfastmath and gauss you can also consider the following projects:
gmp-wasm - Fork of the GNU Multiple Precision Arithmetic Library (GMP), suitable for compilation into WebAssembly.
LibTomMath - LibTomMath is a free open source portable number theoretic multiple-precision integer library written entirely in C.
CPython - The Python programming language