Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 221 - 227 of 227 for nowrap (0.25 seconds)

  2. github.com/tensorflow/tensorflow

    RELEASE.md 

          * If you use the very rarely-used function `tf.keras.mixed_precision.experimental.get_layer_policy`:
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  3. github.com/tiangolo/fastapi

    docs/en/docs/release-notes.md 

    * ♻️ Refactor internals, update `is_coroutine` check to reuse internal supported variants (unwrap, check class). PR [#14434](https://github.com/fastapi/fastapi/pull/14434) by [@tiangolo](https://github.com/tiangolo).

### Translations
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Dec 27 19:06:15 GMT 2025
    - 586.7K bytes
    - Click Count (0)
  4. github.com/kubernetes/kubernetes

    CHANGELOG/CHANGELOG-1.25.md 

    - Informer/reflector callers can now catch and unwrap specific API errors by type. ([#110076](https://github.com/kubernetes/kubernetes/pull/110076), [@karlkfi](https://github.com/karlkfi))
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Mon May 06 09:23:20 GMT 2024
    - 419.1K bytes
    - Click Count (0)
  5. github.com/golang/go

    doc/go_spec.html 

    computed modulo 2<sup><i>n</i></sup>, where <i>n</i> is the bit width of
the unsigned integer's type.
Loosely speaking, these unsigned integer operations
discard high bits upon overflow, and programs may rely on "wrap around".
</p>

<p>
For signed integers, the operations <code>+</code>,
<code>-</code>, <code>*</code>, <code>/</code>, and <code>&lt;&lt;</code> may legally
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 02 23:07:19 GMT 2025
    - 286.5K bytes
    - Click Count (1)
  6. github.com/square/okhttp

    okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt 

    2F12          ; mapped                 ; 529B          # 3.0  KANGXI RADICAL POWER
2F13          ; mapped                 ; 52F9          # 3.0  KANGXI RADICAL WRAP
2F14          ; mapped                 ; 5315          # 3.0  KANGXI RADICAL SPOON
2F15          ; mapped                 ; 531A          # 3.0  KANGXI RADICAL RIGHT OPEN BOX
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
  7. github.com/golang/go

    lib/fips140/v1.0.0-c2097c7c.zip 

    16^i) // so x*Q = sum( Q*x_i*16^i ) // = Q*x_0 + 16*(Q*x_1 + 16*( ... + Q*x_63) ... ) // <------compute inside out--------- // // We use the lookup table to get the x_i*Q values // and do four doublings to compute 16*Q digits := x.signedRadix16() // Unwrap first loop iteration to save computing 16*identity multiple := &projCached{} tmp1 := &projP1xP1{} tmp2 := &projP2{} table.SelectInto(multiple, digits[63]) v.Set(NewIdentityPoint()) tmp1.Add(v, multiple) // tmp1 = x_63*Q in P1xP1 coords for i := 62;...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  8. github.com/golang/go

    lib/fips140/v1.1.0-rc1.zip 

    16^i) // so x*Q = sum( Q*x_i*16^i ) // = Q*x_0 + 16*(Q*x_1 + 16*( ... + Q*x_63) ... ) // <------compute inside out--------- // // We use the lookup table to get the x_i*Q values // and do four doublings to compute 16*Q digits := x.signedRadix16() // Unwrap first loop iteration to save computing 16*identity multiple := &projCached{} tmp1 := &projP1xP1{} tmp2 := &projP2{} table.SelectInto(multiple, digits[63]) v.Set(NewIdentityPoint()) tmp1.Add(v, multiple) // tmp1 = x_63*Q in P1xP1 coords for i := 62;...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top