Conversation

Notices

1. Adrian Cochrane (alcinnz@floss.social)'s status on Sunday, 12-Mar-2023 03:51:23 JST Adrian Cochrane

   Within GMP there's a submodule named "Mini GMP" which initializes, normalizes, clears, conanicalizes, set fields, compare, & finalizes `mpz_t` & `mpq_t` structures. And ofcourse there's mathematical operators. These are all straightforward with possibly a couple branches.

   You can swap fields between 2 `mpq_t`s.

   Convert to or from doubles involves a loop taking an exponent of a power-of-2. Or it can convert to/from strings.

   The actual logic with most of the loops is implemented as macros.

   1/2

   • Adrian Cochrane (alcinnz@floss.social)'s status on Sunday, 12-Mar-2023 04:22:55 JST Adrian Cochrane

     in reply to

     There's another implementation file containing macros implemented similarly. As well as utilities for crashing, managing memory & managing those callbacks, memory-copying & -comparison loops, loop to compute normalized sizes. And ofcourse loops over the words in multiprecision number(s) to perform mathematical operators on them whilst propagating carries, Mini GMP implements these in C.

     Divide is more complex involving multiple fastpath routines. Which are involved in stringifying.

     2/2.5

   • Adrian Cochrane (alcinnz@floss.social)'s status on Sunday, 12-Mar-2023 04:33:21 JST Adrian Cochrane

     in reply to

     There's routines for computing greatest-common-divisor on single words or multiprecision numbers through repeated refinement. With divide-by-2 fastpaths. Similarly there's Lowest-Common-Multiple routines.

     There's exponentiation routines which may involve repeated multiplication, or divide&conquer algorithms via division.

     There's a binary-search for squareroots with a fastpath.

     There's checks for perfect squares.

     There's repeated multiplication factorials

     3/3.5

   • Adrian Cochrane (alcinnz@floss.social)'s status on Sunday, 12-Mar-2023 04:39:02 JST Adrian Cochrane

     in reply to

     There's repeated bitwise-operators computing Jacobi numbers.

     Repeated addition/subtraction/multiplication/division Lucas Modulo operation, supporting its own stringifier.

     Repeated exponentiation labelled "Miller-Rabin".

     Relatively simple prime-number testers.

     Bittesting, absolutes, bit-subtraction, bitsetting, bitclearing, & more logical operators. Hamming distance via ops on each bit. Array-scanning. Sizing per base. Stringifying abstractions.

     4/4 Fin for today! Tomorrow: MPF sublib!