Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for compact (0.3 seconds)

  1. CHANGELOG/CHANGELOG-1.19.md

    - github.com/evanphx/json-patch: [v4.2.0+incompatible → e83c0a1](https://github.com/evanphx/json-patch/compare/v4.2.0...e83c0a1)
    - github.com/fsnotify/fsnotify: [v1.4.7 → v1.4.9](https://github.com/fsnotify/fsnotify/compare/v1.4.7...v1.4.9)
    - github.com/go-kit/kit: [v0.8.0 → v0.9.0](https://github.com/go-kit/kit/compare/v0.8.0...v0.9.0)
    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

        `compat.v2` module. It contains a copy of the 1.15 main module (without
        `contrib`) in the `compat.v1` module. TensorFlow 1.15 is able to emulate 2.0
        behavior using the `enable_v2_behavior()` function. This enables writing
        forward compatible code: by explicitly importing either
        `tensorflow.compat.v1` or `tensorflow.compat.v2`, you can ensure that your
    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. lib/fips140/v1.26.0.zip

    { testMul(t, 2048/8) }) } func testMul(t *testing.T, n int) { a, b, m := make([]byte, n), make([]byte, n), make([]byte, n) cryptorand.Read(a) cryptorand.Read(b) cryptorand.Read(m) // Pick the highest as the modulus. if bytes.Compare(a, m) > 0 { a, m = m, a } if bytes.Compare(b, m) > 0 { b, m = m, b } M, err := NewModulus(m) if err != nil { t.Fatal(err) } A, err := NewNat().SetBytes(a, M) if err != nil { t.Fatal(err) } B, err := NewNat().SetBytes(b, M) if err != nil { t.Fatal(err) } A.Mul(B, M) ABytes...
    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

    { testMul(t, 2048/8) }) } func testMul(t *testing.T, n int) { a, b, m := make([]byte, n), make([]byte, n), make([]byte, n) cryptorand.Read(a) cryptorand.Read(b) cryptorand.Read(m) // Pick the highest as the modulus. if bytes.Compare(a, m) > 0 { a, m = m, a } if bytes.Compare(b, m) > 0 { b, m = m, b } M, err := NewModulus(m) if err != nil { t.Fatal(err) } A, err := NewNat().SetBytes(a, M) if err != nil { t.Fatal(err) } B, err := NewNat().SetBytes(b, M) if err != nil { t.Fatal(err) } A.Mul(B, M) ABytes...
    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

    ## 0.123.1 (2025-12-02)
    
    ### Fixes
    
    * 🐛 Avoid accessing non-existing "$ref" key for Pydantic v2 compat remapping. PR [#14361](https://github.com/fastapi/fastapi/pull/14361) by [@svlandeg](https://github.com/svlandeg).
    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. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2F4F          ; mapped                 ; 6BCB          # 3.0  KANGXI RADICAL DO NOT
    2F50          ; mapped                 ; 6BD4          # 3.0  KANGXI RADICAL COMPARE
    2F51          ; mapped                 ; 6BDB          # 3.0  KANGXI RADICAL FUR
    2F52          ; mapped                 ; 6C0F          # 3.0  KANGXI RADICAL CLAN
    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)
  7. api/go1.20.txt

    pkg time, const DateTime = "2006-01-02 15:04:05" #52746
    pkg time, const DateTime ideal-string #52746
    pkg time, const TimeOnly = "15:04:05" #52746
    pkg time, const TimeOnly ideal-string #52746
    pkg time, method (Time) Compare(Time) int #50770
    pkg unicode/utf16, func AppendRune([]uint16, int32) []uint16 #51896
    # freebsd riscv64 port
    pkg log/syslog (freebsd-riscv64), const LOG_ALERT = 1 #53466
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 17 21:23:32 GMT 2023
    - 602.6K bytes
    - Click Count (0)
Back to Top