Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for binary (0.08 seconds)

  1. RELEASE.md

    *   Enable JIT-compiled i64-indexed kernels on GPU for large tensors with more than 2**32 elements.
        *   Unary GPU kernels: Abs, Atanh, Acos, Acosh, Asin, Asinh, Atan, Cos, Cosh, Sin, Sinh, Tan, Tanh.
        *   Binary GPU kernels: AddV2, Sub, Div, DivNoNan, Mul, MulNoNan, FloorDiv, Equal, NotEqual, Greater, GreaterEqual, LessEqual, Less.
    
    * `tf.lite`
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
  2. CHANGELOG/CHANGELOG-1.19.md

      - hack/lib/util.sh: some bash cleanups
        
        - switched one spot to use kube::logging
        - make kube::util::find-binary return an error when it doesn't find
          anything so that hack scripts fail fast instead of with '' binary not
          found errors.
        - this required deleting some genfeddoc stuff. the binary no longer
          exists in k/k repo since we removed federation/, and I don't see it
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Wed Jan 05 05:42:32 GMT 2022
    - 489.7K bytes
    - Click Count (0)
  3. lib/fips140/v1.26.0.zip

    8720 bytes of initialized data. // https://csrc.nist.gov/publications/fips/fips197/fips-197.pdf // AES is based on the mathematical behavior of binary polynomials // (polynomials over GF(2)) modulo the irreducible polynomial x⁸ + x⁴ + x³ + x + 1. // Addition of these binary polynomials corresponds to binary xor. // Reducing mod poly corresponds to binary xor with poly every // time a 0x100 bit appears. const poly = 1<<8 | 1<<4 | 1<<3 | 1<<1 | 1<<0 // x⁸ + x⁴ + x³ + x + 1 // Powers of x mod poly in...
    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)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    8720 bytes of initialized data. // https://csrc.nist.gov/publications/fips/fips197/fips-197.pdf // AES is based on the mathematical behavior of binary polynomials // (polynomials over GF(2)) modulo the irreducible polynomial x⁸ + x⁴ + x³ + x + 1. // Addition of these binary polynomials corresponds to binary xor. // Reducing mod poly corresponds to binary xor with poly every // time a 0x100 bit appears. const poly = 1<<8 | 1<<4 | 1<<3 | 1<<1 | 1<<0 // x⁸ + x⁴ + x³ + x + 1 // Powers of x mod poly in...
    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)
  5. docs/en/docs/release-notes.md

        * New docs: [Server-Sent Events (SSE)](https://fastapi.tiangolo.com/tutorial/server-sent-events/).
    
    ## 0.134.0 (2026-02-27)
    
    ### Features
    
    * ✨ Add support for streaming JSON Lines and binary data with `yield`. PR [#15022](https://github.com/fastapi/fastapi/pull/15022) by [@tiangolo](https://github.com/tiangolo).
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Apr 03 12:07:04 GMT 2026
    - 631K bytes
    - Click Count (0)
  6. api/go1.14.txt

    pkg debug/dwarf, const TagSkeletonUnit Tag
    pkg debug/dwarf, method (*Data) AddSection(string, []uint8) error
    pkg debug/dwarf, method (*LineReader) Files() []*LineFile
    pkg debug/dwarf, method (*Reader) ByteOrder() binary.ByteOrder
    pkg encoding/asn1, const TagBMPString = 30
    pkg encoding/asn1, const TagBMPString ideal-int
    pkg encoding/json, method (*Decoder) InputOffset() int64
    pkg go/build, type Context struct, Dir string
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 17 20:31:46 GMT 2023
    - 508.9K bytes
    - Click Count (0)
Back to Top