Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for F2 (0.04 seconds)

  1. src/cmd/asm/internal/asm/testdata/loong64enc1.s

    	FTINTRMWF	F0, F2		// 02041a01
    	FTINTRMWD	F0, F2		// 02081a01
    	FTINTRMVF	F0, F2		// 02241a01
    	FTINTRMVD	F0, F2		// 02281a01
    	FTINTRPWF	F0, F2		// 02441a01
    	FTINTRPWD	F0, F2		// 02481a01
    	FTINTRPVF	F0, F2		// 02641a01
    	FTINTRPVD	F0, F2		// 02681a01
    	FTINTRZWF	F0, F2		// 02841a01
    	FTINTRZWD	F0, F2		// 02881a01
    	FTINTRZVF	F0, F2		// 02a41a01
    	FTINTRZVD	F0, F2		// 02a81a01
    	FTINTRNEWF	F0, F2		// 02c41a01
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Nov 27 00:46:52 GMT 2025
    - 44.5K bytes
    - Click Count (0)
  2. doc/go_spec.html

    <p>
    That function may be called normally with an explicit receiver, so
    these five invocations are equivalent:
    </p>
    
    <pre>
    t.Mv(7)
    T.Mv(t, 7)
    (T).Mv(t, 7)
    f1 := T.Mv; f1(t, 7)
    f2 := (T).Mv; f2(t, 7)
    </pre>
    
    <p>
    Similarly, the expression
    </p>
    
    <pre>
    (*T).Mp
    </pre>
    
    <p>
    yields a function value representing <code>Mp</code> with signature
    </p>
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 02 23:07:19 GMT 2025
    - 286.5K bytes
    - Click Count (1)
  3. lib/fips140/v1.1.0-rc1.zip

    isInBounds(&fe) } if err := quick.Check(f1, nil); err != nil { t.Errorf("failed bytes->FE->bytes round-trip: %v", err) } f2 := func(fe, r Element) bool { r.SetBytes(fe.Bytes()) // Intentionally not using Equal not to go through Bytes again. // Calling reduce because both Generate and SetBytes can produce // non-canonical representations. fe.reduce() r.reduce() return fe == r } if err := quick.Check(f2, nil); err != nil { t.Errorf("failed FE->bytes->FE round-trip: %v", err) } // Check some fixed vectors from dalek...
    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