0
I Use This!
High Activity

Commits : Listings

Analyzed about 7 hours ago. based on code collected about 7 hours ago.
Jul 16, 2018 — Jul 16, 2019
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
long_poly.c: fixed bug in long_poly_sqr when input is zero utils.h: added prototype for nbits() Makefile: added options -W -Wall Anon32 More... over 11 years ago
added missing header Anon32 More... over 11 years ago
added missing include fixed fprint_relation() [apparently not used currently] Anon32 More... over 11 years ago
less pignoufing is required. More to come. Anon32 More... over 11 years ago
The square bug patched in new function find_prime_factor. Hope this will not cause problem later on in factoring, that admitting p1 = p2 in the answer. Anon32 More... over 11 years ago
added some auto-generated files, they will disappear soon anyway. Anon32 More... over 11 years ago
A lot of cleaning done including simplification of types, variables, etc. Plus the use of rwmax to prevent some dense rows to be used. Clever strategies must be tried now. Anon32 More... over 11 years ago
using rwmax better. Anon32 More... over 11 years ago
Take paramater order change in purge.c into account + prepare for the use of rwmax. Anon32 More... over 11 years ago
Now, light columns can enter the square dance if needed. More to come. Anon32 More... over 11 years ago
A little bit of cleaning and adapting to multifile input, easier to play with. Anon32 More... over 11 years ago
The even smarter version. Once I get bigger relation files, I will look at the next smarter one... Anon32 More... over 11 years ago
Cleaned version, expecting the next one to be even smarter. Anon32 More... over 11 years ago
Prepare for multiple jobs on the same data and/or machine. Anon32 More... over 11 years ago
Two major novelties: 1. a faster merge, using intricate data structures reminiscent of that used in graph theory. More in tex one of these days. I hope this will resist gigabytes of data. For the time being, this is ok for c80, where the running time is spent elsewhere. The "slow" merge is still around. Probably, things have to be cleaned and simplified a bit and for huge data, some choices will have to be made. 2. After all, minimal spanning trees can be used. They are more tricky to use correctly that simply pivoting. The current implementation might not be optimal, but seems to work. Prim's algo is easier for our purpose I think. As a result, the coding in name.merge.his evolved, as well as replay.c for obvious compatibility reasons. Anon32 More... over 11 years ago
ndepmin and ndepmax are in the same boat Anon32 More... over 11 years ago
typos + new param in allsqrt.c Anon32 More... over 11 years ago
turn the alloca cruft back on for a while, it is used indeed by some old code in bw. Anon32 More... over 11 years ago
changed a nasty file name Anon32 More... over 11 years ago
some defaults for gf2x Anon32 More... over 11 years ago
reworked gf2x package Anon32 More... over 11 years ago
Various changes to help the thing compile under openbsd. Anon32 More... over 11 years ago
Stick to C99 headers in polyselect. Anon32 More... over 11 years ago
Added vanilla gf2x package. Anon32 More... over 11 years ago
got rid of DBL_MAX (does not exist under *BSD, thanks Jerome Milan) Anon32 More... over 11 years ago
added an estimation of the finishing time for master-binary Anon32 More... over 11 years ago
global Makefile ; does make clean. Looked up into specific make_cleanses Added some header protection Deprecated cputime(), added uint64_t microseconds() and double seconds() Killed some gobs of warnings. % modifiers in printf and scanf should me more reasonable. Anon32 More... over 11 years ago
Some random changes to accomodate for cado input. More to come. Anon32 More... over 11 years ago
added transpose code. bw should now almost understand the cado format (it remains to simulate zero rows). Anon32 More... over 11 years ago
whitespace change Anon32 More... over 11 years ago