https://sourceforge.net/p/gjsieve/wiki/History/Recent changes to HistoryenTue, 04 Sep 2012 13:48:33 -0000https://sourceforge.net/p/gjsieve/wiki/History/<pre>--- v1 +++ v2 @@ -1,4 +1,7 @@ -#summary History of GJSieve +History of GJSieve +--- + +This is a brief version history of GJSieve, which is a program I initially started writing when I first began learning C and other C-based languages early in 2012. There are a lot of versions of GJSieve -- </pre>Jaska BörnerTue, 04 Sep 2012 13:48:33 -0000https://sourceforge.net9ebd255d56b716526542ef0ae175399328197a3ehttps://sourceforge.net/p/gjsieve/wiki/History/#summary History of GJSieve There are a lot of versions of GJSieve -- Yep. And this is a good example, since GJSieve is what started my coding adventures months ago. See, it's like this: * gjsieve v0.1 - this was an incredibly basic, ~100 line program that was incapable of displaying numbers longer than 11 digits. It was also sometimes wrong about a number being prime. So yeah. Along came: * gjsieve v0.2 - correct, at least, but still highly limited! * gjsieve v0.3 - compact and efficient, but still kind of useless because it couldn't calculate big or even sort-of-big numbers. Versions less than 1 were written mostly by G. Arico. That is certainly not to say he made mistakes. And who cares if he did? I've written way more code than he has. Therefore, I have made exponentially more mistakes! That was early 2012. Around June/July, we got these: * gjsieve v1.0 - totally re-written (though still highly limited) and very stable by comparison. However, it was not perfect. * gjsieve v1.1 - even better and faster and smoother and generally all-around great little program that still couldn't display (let alone calculate) large numbers because of stdlib limitations. And then along came external libraries: * gjsieve v1.5 - re-written again, though not entirely. Uses the MPIR fork of GMP for very large integer calculations. Rough alpha. * gjsieve v1.5.1 - release testing alpha. Considerably more stable and very efficient. Capable of and observed calculating numbers with thousands of digits. Theoretically capable of calculating numbers up to 980M digits. And then I realized a simple console executable did not afford the user quite enough control, so along came: * gjsieve v1.5.4 - essentially the same programatically as 1.5.1, but operates as a pure Windows application with a straightforward but efficient graphical frontend. * gjsieve v1.5.5 - more highly optimized number testing - more accurately, compositeness testing - with a cleaner and more organized GUI * gjsieve v1.7.0 - not different enough in terms of code to merit a re-designation of v2, yet graphically sleeker, more streamlined, and decidedly more feature-rich. * gjsieve v1.8.0 - more graphically polished and computationally stable. Introduced a new two-button testing process Current --- * gjsieve v1.9.0 - the multi-threaded, high-powered equivalent of 1.8.0. It tests the number in a different thread to avoid seizing up. Forthcoming --- * gjsieve v2.0.0 - based on design prototypes in IsItPrime v1.7.0, a triple-threaded (or six-threaded) powerful prime-number testing program with several different testing options. In development. Jaska BörnerTue, 04 Sep 2012 13:47:29 -0000https://sourceforge.neta472cfb345e14d3bb9f127c6c66804899ca2d17b