- Sort Score
- Num 10 results
- Language All
Results 1 - 4 of 4 for Chinese (0.1 seconds)
-
docs/en/docs/release-notes.md
* 🌐 Update Chinese translation for `docs/zh/docs/tutorial/index.md`. PR [#13374](https://github.com/fastapi/fastapi/pull/13374) by [@Zhongheng-Cheng](https://github.com/Zhongheng-Cheng). * 🌐 Update Chinese translation for `docs/zh/docs/deployment/manually.md`. PR [#13324](https://github.com/fastapi/fastapi/pull/13324) by [@Zhongheng-Cheng](https://github.com/Zhongheng-Cheng).
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0) -
okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt
16FE1 ; valid # 10.0 NUSHU ITERATION MARK 16FE2 ; valid ; ; NV8 # 12.0 OLD CHINESE HOOK MARK 16FE3 ; valid # 12.0 OLD CHINESE ITERATION MARK 16FE4 ; valid # 13.0 KHITAN SMALL SCRIPT FILLER
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sat Feb 10 11:25:47 GMT 2024 - 854.1K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
already been checked with checkPublicKey. pub PublicKey d *bigmod.Nat // The following values are not set for deprecated multi-prime keys. // // Since they are always set for keys in FIPS mode, for SP 800-56B Rev. 2 // purposes we always use the Chinese Remainder Theorem (CRT) format. p, q *bigmod.Modulus // p × q = n // dP and dQ are used as exponents, so we store them as big-endian byte // slices to be passed to [bigmod.Nat.Exp]. dP []byte // d mod (p - 1) dQ []byte // d mod (q - 1) qInv *bigmod.Nat...
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) -
lib/fips140/v1.0.0-c2097c7c.zip
already been checked with checkPublicKey. pub PublicKey d *bigmod.Nat // The following values are not set for deprecated multi-prime keys. // // Since they are always set for keys in FIPS mode, for SP 800-56B Rev. 2 // purposes we always use the Chinese Remainder Theorem (CRT) format. p, q *bigmod.Modulus // p × q = n // dP and dQ are used as exponents, so we store them as big-endian byte // slices to be passed to [bigmod.Nat.Exp]. dP []byte // d mod (p - 1) dQ []byte // d mod (q - 1) qInv *bigmod.Nat...
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)