Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for pour (0.05 seconds)

  1. RELEASE.md

    For details on best practices with 2.0, see
    [the Effective 2.0 guide](https://www.tensorflow.org/beta/guide/effective_tf2)
    
    For information on upgrading your existing TensorFlow 1.x models, please refer
    to our
    [Upgrade](https://medium.com/tensorflow/upgrading-your-code-to-tensorflow-2-0-f72c3a4d83b5)
    and [Migration](https://www.tensorflow.org/beta/guide/migration_guide) guides.
    We have also released a collection of
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  2. src/cmd/asm/internal/asm/testdata/amd64enc.s

    	POR (BX), X2                            // 660feb13
    	POR (R11), X2                           // 66410feb13
    	POR X2, X2                              // 660febd2
    	POR X11, X2                             // 66410febd3
    	POR (BX), X11                           // 66440feb1b
    	POR (R11), X11                          // 66450feb1b
    	POR X2, X11                             // 66440febda
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Oct 08 21:38:44 GMT 2021
    - 581.9K bytes
    - Click Count (1)
  3. docs/en/docs/release-notes.md

    For the things that need changes in your Pydantic models, the Pydantic team built [`bump-pydantic`](https://github.com/pydantic/bump-pydantic).
    
    A command line tool that will **process your code** and update most of the things **automatically** for you. Make sure you have your code in git first, and review each of the changes to make sure everything is correct before committing the changes.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Dec 27 19:06:15 GMT 2025
    - 586.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    New{{.P}}Point(), New{{.P}}Point(), New{{.P}}Point(), New{{.P}}Point()} table[0].Set(q) for i := 1; i < 15; i += 2 { table[i].Double(table[i/2]) table[i+1].Add(table[i], q) } // Instead of doing the classic double-and-add chain, we do it with a // four-bit window: we double four times, and then add [0-15]P. t := New{{.P}}Point() p.Set(New{{.P}}Point()) for i, byte := range scalar { // No need to double on the first iteration, as p is the identity at // this point, and [N]∞ = ∞. if i != 0 { p.Double(p) p.Double(p)...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  5. lib/fips140/v1.1.0-rc1.zip

    reason) } } } func BenchmarkCAST(b *testing.B) { // IG 10.3.A says "ML-DSA digital signature generation CASTs should cover // all applicable rejection sampling loop paths". For ML-DSA-44, there are // four paths. For ML-DSA-65 and ML-DSA-87, only three. This benchmark helps // us figure out which is faster: four rejections of ML-DSA-44, or three of // ML-DSA-65. (It's the former, but only barely.) b.Run("ML-DSA-44", func(b *testing.B) { // Same as TestACVPRejectionKAT/Test/Path/ML-DSA-44/1. seed := fro...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top