Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for None (0.3 seconds)

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

    ```Python
    from typing import Union
    from fastapi import Cookie, FastAPI, Header, Path, Query
    
    app = FastAPI()
    
    
    @app.get("/items/{item_id}")
    def main(
        item_id: int = Path(gt=0),
        query: Union[str, None] = Query(default=None, max_length=10),
        session: Union[str, None] = Cookie(default=None, min_length=3),
    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)
  2. RELEASE.md

            of built-in training loops such as `tf.keras` `compile` and `fit`, we
            expect reduction value to be `SUM` or `NONE`. Using `AUTO` in that case
            will raise an error.
        *   `NONE`: Weighted losses with one dimension reduced (axis=-1, or axis
            specified by loss function). When this reduction type used with built-in
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    using the MGF1 function // specified in PKCS #1 v2.1. func mgf1XOR(out []byte, hash fips140.Hash, seed []byte) { var counter [4]byte var digest []byte done := 0 for done < len(out) { hash.Reset() hash.Write(seed) hash.Write(counter[0:4]) digest = hash.Sum(digest[:0]) for i := 0; i < len(digest) && done < len(out); i++ { out[done] ^= digest[i] done++ } incCounter(&counter) } } func emsaPSSEncode(mHash []byte, emBits int, salt []byte, hash fips140.Hash) ([]byte, error) { // See RFC 8017, Section 9.1.1....
    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)
  4. lib/fips140/v1.1.0-rc1.zip

    generated using the MGF1 function // specified in PKCS #1 v2.1. func mgf1XOR(out []byte, hash hash.Hash, seed []byte) { var counter [4]byte var digest []byte done := 0 for done < len(out) { hash.Reset() hash.Write(seed) hash.Write(counter[0:4]) digest = hash.Sum(digest[:0]) for i := 0; i < len(digest) && done < len(out); i++ { out[done] ^= digest[i] done++ } incCounter(&counter) } } func emsaPSSEncode(mHash []byte, emBits int, salt []byte, hash hash.Hash) ([]byte, error) { // See RFC 8017, Section 9.1.1....
    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