Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 8 of 8 for Bind (0.07 seconds)

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

  1. CHANGELOG/CHANGELOG-1.19.md

    ### (No, really, you MUST read this before you upgrade)
    
     - Azure blob disk feature(`kind`: `Shared`, `Dedicated`) has been deprecated, you should use `kind`: `Managed` in `kubernetes.io/azure-disk` storage class. ([#92905](https://github.com/kubernetes/kubernetes/pull/92905), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider and Storage]
     
    ## Changes by Kind
    
    ### Deprecation
    
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Wed Jan 05 05:42:32 GMT 2022
    - 489.7K bytes
    - Click Count (0)
  2. api/go1.14.txt

    pkg syscall (freebsd-arm64), func Access(string, uint32) error
    pkg syscall (freebsd-arm64), func Adjtime(*Timeval, *Timeval) error
    pkg syscall (freebsd-arm64), func Bind(int, Sockaddr) error
    pkg syscall (freebsd-arm64), func BpfBuflen //deprecated
    pkg syscall (freebsd-arm64), func BpfBuflen(int) (int, error)
    pkg syscall (freebsd-arm64), func BpfDatalink //deprecated
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Feb 17 20:31:46 GMT 2023
    - 508.9K bytes
    - Click Count (0)
  3. api/go1.20.txt

    pkg syscall (freebsd-riscv64), func Access(string, uint32) error #53466
    pkg syscall (freebsd-riscv64), func Adjtime(*Timeval, *Timeval) error #53466
    pkg syscall (freebsd-riscv64), func Bind(int, Sockaddr) error #53466
    pkg syscall (freebsd-riscv64), func BpfBuflen //deprecated #53466
    pkg syscall (freebsd-riscv64), func BpfBuflen(int) (int, error) #53466
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Feb 17 21:23:32 GMT 2023
    - 602.6K bytes
    - Click Count (0)
  4. fess-crawler/src/test/resources/extractor/eml/sample4.eml

    zahlreiche Handwerker und Gewerbetreibende niedergelassen, denen über die Schulter geschaut bzw. mitgemacht
    werden kann.
    Für unsere Gruppe sind vier Workshops reserviert: Jeder Studierender muss sich bei der Anmeldung für die Fahrt für
    einen verbindlich eintragen. Die Kosten dafür und das Mittagessen sind in den Fahrtkosten enthalten.
    www.museumsdorf-glashuette.de
    Bitte auch 2. Seite lesen !
    Programmablauf:
    Created: Sat Dec 20 11:21:39 GMT 2025
    - Last Modified: Sun Jan 07 09:15:11 GMT 2018
    - 681K bytes
    - Click Count (0)
  5. docs/en/docs/release-notes.md

    * 📝 Add External Link: ML serving and monitoring with FastAPI and Evidently. PR [#9701](https://github.com/tiangolo/fastapi/pull/9701) by [@mnrozhkov](https://github.com/mnrozhkov).
    * 📝 Reword in docs, from "have in mind" to "keep in mind". PR [#10376](https://github.com/tiangolo/fastapi/pull/10376) by [@malicious](https://github.com/malicious).
    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)
  6. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2FB4          ; mapped                 ; 9801          # 3.0  KANGXI RADICAL LEAF
    2FB5          ; mapped                 ; 98A8          # 3.0  KANGXI RADICAL WIND
    2FB6          ; mapped                 ; 98DB          # 3.0  KANGXI RADICAL FLY
    2FB7          ; mapped                 ; 98DF          # 3.0  KANGXI RADICAL EAT
    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. lib/fips140/v1.0.0-c2097c7c.zip

    additions). basepointNafTable := basepointNafTable() var aTable nafLookupTable5 aTable.FromP3(A) // Because the basepoint is fixed, we can use a wider NAF // corresponding to a bigger table. aNaf := a.nonAdjacentForm(5) bNaf := b.nonAdjacentForm(8) // Find the first nonzero coefficient. i := 255 for j := i; j >= 0; j-- { if aNaf[j] != 0 || bNaf[j] != 0 { break } } multA := &projCached{} multB := &affineCached{} tmp1 := &projP1xP1{} tmp2 := &projP2{} tmp2.Zero() // Move from high to low bits, doubling...
    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. lib/fips140/v1.1.0-rc1.zip

    additions). basepointNafTable := basepointNafTable() var aTable nafLookupTable5 aTable.FromP3(A) // Because the basepoint is fixed, we can use a wider NAF // corresponding to a bigger table. aNaf := a.nonAdjacentForm(5) bNaf := b.nonAdjacentForm(8) // Find the first nonzero coefficient. i := 255 for j := i; j >= 0; j-- { if aNaf[j] != 0 || bNaf[j] != 0 { break } } multA := &projCached{} multB := &affineCached{} tmp1 := &projP1xP1{} tmp2 := &projP2{} tmp2.Zero() // Move from high to low bits, doubling...
    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