Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for 107 (0.07 seconds)

  1. api/go1.14.txt

    pkg debug/dwarf, const AttrCallValue = 126
    pkg debug/dwarf, const AttrCallValue Attr
    pkg debug/dwarf, const AttrConstExpr = 108
    pkg debug/dwarf, const AttrConstExpr Attr
    pkg debug/dwarf, const AttrDataBitOffset = 107
    pkg debug/dwarf, const AttrDataBitOffset Attr
    pkg debug/dwarf, const AttrDecimalScale = 92
    pkg debug/dwarf, const AttrDecimalScale Attr
    pkg debug/dwarf, const AttrDecimalSign = 94
    pkg debug/dwarf, const AttrDecimalSign Attr
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 17 20:31:46 GMT 2023
    - 508.9K bytes
    - Click Count (0)
  2. api/go1.20.txt

    Dmitri Goutnik <******@****.***> 1676652256 -0500
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 17 21:23:32 GMT 2023
    - 602.6K bytes
    - Click Count (0)
  3. docs/en/docs/release-notes.md

    ## 0.10.1 (2019-03-25)
    
    * Add docs and tests for [encode/databases](https://github.com/encode/databases). New docs at: [Async SQL (Relational) Databases](https://fastapi.tiangolo.com/advanced/async-sql-databases/). PR [#107](https://github.com/tiangolo/fastapi/pull/107).
    
    ## 0.10.0 (2019-03-24)
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Apr 03 12:07:04 GMT 2026
    - 631K bytes
    - Click Count (0)
  4. lib/fips140/v1.26.0.zip

    in a uint64. // // r0 = a0×b0 + 19×(a1×b4 + a2×b3 + a3×b2 + a4×b1) // r0 < 2⁵²×2⁵² + 19×(2⁵²×2⁵² + 2⁵²×2⁵² + 2⁵²×2⁵² + 2⁵²×2⁵²) // r0 < (1 + 19 × 4) × 2⁵² × 2⁵² // r0 < 2⁷ × 2⁵² × 2⁵² // r0 < 2¹¹¹ // // Moreover, the top coefficient (r4) is at most 107 bits, so c4 is at most // 56 bits, and c4 * 19 is at most 61 bits, which again fits in a uint64 and // allows us to easily apply the reduction identity. // // r4 = a0×b4 + a1×b3 + a2×b2 + a3×b1 + a4×b0 // r4 < 5 × 2⁵² × 2⁵² // r4 < 2¹⁰⁷ // c0 := shiftRightBy51(r0)...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  5. lib/fips140/v1.0.0-c2097c7c.zip

    in a uint64. // // r0 = a0×b0 + 19×(a1×b4 + a2×b3 + a3×b2 + a4×b1) // r0 < 2⁵²×2⁵² + 19×(2⁵²×2⁵² + 2⁵²×2⁵² + 2⁵²×2⁵² + 2⁵²×2⁵²) // r0 < (1 + 19 × 4) × 2⁵² × 2⁵² // r0 < 2⁷ × 2⁵² × 2⁵² // r0 < 2¹¹¹ // // Moreover, the top coefficient (r4) is at most 107 bits, so c4 is at most // 56 bits, and c4 * 19 is at most 61 bits, which again fits in a uint64 and // allows us to easily apply the reduction identity. // // r4 = a0×b4 + a1×b3 + a2×b2 + a3×b1 + a4×b0 // r4 < 5 × 2⁵² × 2⁵² // r4 < 2¹⁰⁷ // c0 := shiftRightBy51(r0)...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
Back to Top