Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for eier (0.06 seconds)

  1. CHANGELOG/CHANGELOG-1.19.md

    - It is now possible to use the service annotation `cloud.google.com/network-tier: Standard` to configure the Network Tier of the GCE Loadbalancer ([#88532](https://github.com/kubernetes/kubernetes/pull/88532), [@zioproto](https://github.com/zioproto)) [SIG Cloud Provider, Network and Testing]
    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)
  2. RELEASE.md

            layers in order to work, where the Keras symbolic shape inference proves
            insufficient.
        *   Code that tries manually walking a `tf.keras.Model` layer by layer and
            assumes layers only ever have one positional argument. This assumption
            doesn't hold true before TF 2.4 either, but is more likely to cause
            issues now.
        *   Code that manually enters `keras.backend.get_graph()` before building a
    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)
  3. docs/en/docs/release-notes.md

    * ✨ Add new Deta banner badge with new sponsorship tier 🙇. PR [#3194](https://github.com/tiangolo/fastapi/pull/3194) 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)
  4. lib/fips140/v1.26.0.zip

    bits b[0] &= 0b1111_1111 >> excess // Don't let the value be too small: set the most significant two bits. // Setting the top two bits, rather than just the top bit, means that // when two of these values are multiplied together, the result isn't // ever one bit short. if excess < 7 { b[0] |= 0b1100_0000 >> excess } else { b[0] |= 0b0000_0001 b[1] |= 0b1000_0000 } // Make the value odd since an even number certainly isn't prime. b[len(b)-1] |= 1 // We don't need to check for p >= √2 × 2^(bits-1) (steps...
    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)
  5. lib/fips140/v1.0.0-c2097c7c.zip

    bits; excess != 0 { b[0] >>= excess } // Don't let the value be too small: set the most significant two bits. // Setting the top two bits, rather than just the top bit, means that // when two of these values are multiplied together, the result isn't // ever one bit short. if excess := len(b)*8 - bits; excess < 7 { b[0] |= 0b1100_0000 >> excess } else { b[0] |= 0b0000_0001 b[1] |= 0b1000_0000 } // Make the value odd since an even number certainly isn't prime. b[len(b)-1] |= 1 // We don't need to check...
    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