8 Commits

Author	SHA1	Message	Date
Mamy Ratsimbazafy	6eeba3d41a	Division: Fix recursive divide-and-conquer (#20) ... * Simplify div2n1n * Revert borrow detection, needed a cleverer scheme. * Getting inspired by uint128 didn't work for recursive. Use recursive algo from the get go * Fix shl bug ... (need fuzzy testing) * divmod fixed for single nesting (?) * Almost there * Fix one part of div3n2n * Division is wooorrrrkkinnnggg 🔥 * Fix compilation for the nested version * forgot to not multiply by 8 the size * Add another failing shift test * Fix countLeadingZero for nested uint * Cleanup: remove debugecho * Move debug utils in a specific folder * Fix forward declaration * Move division it's own file	2018-04-20 11:13:47 +02:00
Mamy Ratsimbazafy	24bd2fc986	Recursive init + bitwise as test + fix shr (#9) ... * Recursive init compiles * fix bitshift. Missing rolling over * Strange shift required * debug msg leftover	2018-03-28 20:45:39 +02:00
mratsim	f1935fd673	Improve speed by 90% by inline shr/shl	2018-03-26 14:46:38 +02:00
mratsim	c65ab16512	Conversion fixes for <uint64. Also closes #4 and #5	2018-03-26 12:45:10 +02:00
Mamy Ratsimbazafy	3a1e5b1151	Make bits part of type (#6) ... * Small reorg of conversion proc * Rework with bits as type. Pass endianess test * tests_comparison compiles and succeed * Fix init with int for mpint_test compilation flag * All tests green 🔥	2018-03-26 11:46:24 +02:00
mratsim	8b8f2a55c4	Relicense under dual Apache/MIT	2018-03-02 11:48:08 +01:00
mratsim	f06c02cf2a	5% more speed to divmod	2018-02-17 17:57:26 +01:00
mratsim	ac902b2a23	20% divmod improvement by using GCC Clang builtins when possible	2018-02-17 12:02:51 +01:00