Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for Davies (0.06 sec)

  1. RELEASE.md

    Nate Harada, Neven Miculinic, Nghia Tran, Nick Lyu, Niranjan Hasabnis, Nishidha,
    Oleksii Kuchaiev, Oyesh Mann Singh, Panmari, Patrick, Paul Van Eck, Piyush
    Chaudhary, Quim Llimona, Raingo, Richard Davies, Ruben Vereecken, Sahit
    Chintalapudi, Sam Abrahams, Santiago Castro, Scott Sievert, Sean O'Keefe,
    Sebastian Schlecht, Shane, Shubhankar Deshpande, Spencer Schaber, Sunyeop Lee,
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Tue Oct 28 22:27:41 UTC 2025
    - 740.4K bytes
    - Viewed (3)
  2. CHANGELOG/CHANGELOG-1.19.md

    SIG Network has graduated the widely used [Ingress API](https://kubernetes.io/docs/concepts/services-networking/ingress/) to general availability in Kubernetes 1.19. This change recognises years of hard work by Kubernetes contributors, and paves the way for further work on future networking APIs in Kubernetes.
    
    ### seccomp graduates to General Availability
    
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (0)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [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...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  4. lib/fips140/v1.1.0-rc1.zip

    the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [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...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
Back to top