Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for euer (0.08 seconds)

  1. 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)
  2. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2105          ; disallowed_STD3_mapped ; 0063 002F 006F #1.1  CARE OF
    2106          ; disallowed_STD3_mapped ; 0063 002F 0075 #1.1  CADA UNA
    2107          ; mapped                 ; 025B          # 1.1  EULER CONSTANT
    2108          ; valid                  ;      ; NV8    # 1.1  SCRUPLE
    2109          ; mapped                 ; 00B0 0066     # 1.1  DEGREE FAHRENHEIT
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
  3. 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)
  4. 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