Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 301 - 305 of 305 for mrow (0.07 seconds)

  1. api/go1.20.txt

    pkg path/filepath, func IsLocal(string) bool #56219
    pkg path/filepath, var SkipAll error #47209
    pkg reflect, method (Value) Comparable() bool #46746
    pkg reflect, method (Value) Equal(Value) bool #46746
    pkg reflect, method (Value) Grow(int) #48000
    pkg reflect, method (Value) SetZero() #52376
    pkg regexp/syntax, const ErrLarge ErrorCode #56041
    pkg regexp/syntax, const ErrLarge = "expression too large" #56041
    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)
  2. RELEASE.md

        *   TPUs can now be re-initialized multiple times, using
            `tf.tpu.experimental.initialize_tpu_system`.
        *   Add `RaggedTensor.merge_dims()`.
        *   Added new `uniform_row_length` row-partitioning tensor to
            `RaggedTensor`.
        *   Add `shape` arg to `RaggedTensor.to_tensor`; Improve speed of
            `RaggedTensor.to_tensor`.
    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

    don't // need constant-time lookups or constant-time digit // computations. // // So we use a non-adjacent form of some width w instead of // radix 16. This is like a binary representation (one digit // for each binary place) but we allow the digits to grow in // magnitude up to 2^{w-1} so that the nonzero digits are as // sparse as possible. Intuitively, this "condenses" the // "mass" of the scalar onto sparse coefficients (meaning // fewer additions). basepointNafTable := basepointNafTable() var aTable...
    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

    don't // need constant-time lookups or constant-time digit // computations. // // So we use a non-adjacent form of some width w instead of // radix 16. This is like a binary representation (one digit // for each binary place) but we allow the digits to grow in // magnitude up to 2^{w-1} so that the nonzero digits are as // sparse as possible. Intuitively, this "condenses" the // "mass" of the scalar onto sparse coefficients (meaning // fewer additions). basepointNafTable := basepointNafTable() var aTable...
    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. api/go1.1.txt

    pkg bufio, var ErrTooLong error
    pkg bytes, const MinRead = 512
    pkg bytes, func TrimPrefix([]uint8, []uint8) []uint8
    pkg bytes, func TrimSuffix([]uint8, []uint8) []uint8
    pkg bytes, method (*Buffer) Grow(int)
    pkg bytes, method (*Reader) WriteTo(io.Writer) (int64, error)
    pkg compress/flate, const BestCompression = 9
    pkg compress/flate, const BestSpeed = 1
    pkg compress/flate, const DefaultCompression = -1
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Mar 31 20:37:15 GMT 2022
    - 2.6M bytes
    - Click Count (0)
Back to Top