Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 1 of 1 for times2ToThe32Mod (0.07 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  2. github.com/google/guava

    guava/src/com/google/common/math/LongMath.java 

             *
         * We carry out this computation in modular arithmetic. Since times2ToThe32Mod accepts any
         * unsigned long, we don't have to do a mod on every operation, only when intermediate
         * results can exceed 2^63.
         */
        long result = times2ToThe32Mod(aHi * bHi /* < 2^62 */, m); // < m < 2^63
        result += aHi * bLo; // aHi * bLo < 2^63, result < 2^64
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Nov 03 21:01:09 GMT 2025
    - 46.8K bytes
    - Click Count (0)
Back to Top