- Sort Score
- Num 10 results
- Language All
Results 11 - 16 of 16 for Bild (0.09 seconds)
-
CHANGELOG/CHANGELOG-1.14.md
- kubectl supports copying files with wild card ([#72641](https://github.com/kubernetes/kubernetes/pull/72641), [@dixudx](https://github.com/dixudx))
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Mon Jun 14 22:06:39 GMT 2021 - 271.5K bytes - Click Count (0) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
<_comment>PRONOM fmt-473</_comment> <_comment>First byte and 53rd byte are the same -- the length of the name.</_comment> <_comment>Based on TIKA-2469, we've added a heuristic/wild guess that the first 10 chars</_comment> <_comment>after the length byte should be \x00 or a non-control character.</_comment> <magic priority="80">
Created: Sat Dec 20 11:21:39 GMT 2025 - Last Modified: Thu Oct 16 07:46:32 GMT 2025 - 320.2K bytes - Click Count (5) -
src/cmd/asm/internal/asm/testdata/amd64enc.s
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Oct 08 21:38:44 GMT 2021 - 581.9K bytes - Click Count (1) -
CHANGELOG/CHANGELOG-1.16.md
* => IPv6 BackendPool name == <clusterName>-IPv6 * This result into: * - clusters moving from IPv4 to duakstack will require no changes * - clusters moving from IPv6 (while not seen in the wild, we can not rule out their existence) to dualstack will require deleting backend pools (the reconciler will take care of creating correct backendpools)
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Oct 23 20:13:20 GMT 2024 - 345.2K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
|p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q), p); err != nil { // q > p pQ, err := bigmod.NewNat().SetBytes(p.Nat().Bytes(p), q) if err != nil { return errors.New("crypto/rsa:...
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) -
lib/fips140/v1.1.0-rc1.zip
|p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q), p); err != nil { // q > p pQ, err := bigmod.NewNat().SetBytes(p.Nat().Bytes(p), q) if err != nil { return errors.New("crypto/rsa:...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)