Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for play (0.06 seconds)

  1. RELEASE.md

            and `tflite::Interpreter:kTensorsCapacityHeadroom` are now const
            references, rather than `constexpr` compile-time constants.
            (This is to enable better API compatibility for TFLite in Play services
            while preserving the implementation flexibility to change the values of
            these constants in the future.)
        * Python API:
          * `tf.lite.Interpreter` gives deprecation warning redirecting to its new
    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

    - Fix a regression where kubeadm bails out with a fatal error when an optional version command line argument is supplied to the "kubeadm upgrade plan" command ([#94421](https://github.com/kubernetes/kubernetes/pull/94421), [@rosti](https://github.com/rosti)) [SIG Cluster Lifecycle]
    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

    ExpShortVarTime will panic. func (out *Nat) ExpShortVarTime(x *Nat, e uint, m *Modulus) *Nat { if !m.odd { panic("bigmod: modulus for ExpShortVarTime must be odd") } // For short exponents, precomputing a table and using a window like in Exp // doesn't pay off. Instead, we do a simple conditional square-and-multiply // chain, skipping the initial run of zeroes. xR := NewNat().set(x).montgomeryRepresenta(m) out.set(xR) for i := bits.UintSize - bits.Len(e) + 1; i < bits.UintSize; i++ { out.montgomeryMul(out,...
    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

    ExpShortVarTime will panic. func (out *Nat) ExpShortVarTime(x *Nat, e uint, m *Modulus) *Nat { if !m.odd { panic("bigmod: modulus for ExpShortVarTime must be odd") } // For short exponents, precomputing a table and using a window like in Exp // doesn't pay off. Instead, we do a simple conditional square-and-multiply // chain, skipping the initial run of zeroes. xR := NewNat().set(x).montgomeryRepresenta(m) out.set(xR) for i := bits.UintSize - bits.Len(e) + 1; i < bits.UintSize; i++ { out.montgomeryMul(out,...
    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)
Back to Top