Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for refName (0.08 seconds)

  1. docs/en/docs/release-notes.md

    ### Refactors
    
    * ♻️ Refactor internal `check_file_field()`, rename to `ensure_multipart_is_installed()` to clarify its purpose. PR [#12106](https://github.com/fastapi/fastapi/pull/12106) by [@tiangolo](https://github.com/tiangolo).
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Apr 03 12:07:04 GMT 2026
    - 631K bytes
    - Click Count (0)
  2. RELEASE.md

            value, but a deterministic sequence. This change will make the
            initialize behavior align between v1 and v2.
    
    *   `tf.lite`:
    
        *   Rename fields `SignatureDef` table in schema to maximize the parity with
            TF SavedModel's Signature concept.
        *   Deprecate Makefile builds. Makefile users need to migrate their builds
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
  3. CHANGELOG/CHANGELOG-1.19.md

    - Rename pod_preemption_metrics to preemption_metrics. ([#93256](https://github.com/kubernetes/kubernetes/pull/93256), [@ahg-g](https://github.com/ahg-g)) [SIG Instrumentation and Scheduling]
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Wed Jan 05 05:42:32 GMT 2022
    - 489.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.26.0.zip

    [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that one is a modulus. // 6. Rearrange steps 4 through 6 slightly. Merge the loops in steps 4 and // 5 into the main loop (step 7's goto), and move step 6 to the start of // the loop iteration, ensuring each loop iteration...
    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

    [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the end // condition to [v = 0] rather than [u = 0]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that one is a modulus. // 6. Rearrange steps 4 through 6 slightly. Merge the loops in steps 4 and // 5 into the main loop (step 7's goto), and move step 6 to the start of // the loop iteration, ensuring each loop iteration...
    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