Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 104 for ct (0.02 sec)

  1. src/math/rand/rand_test.go

    		num /= 100 // 1.72 seconds instead of 172 seconds
    	}
    
    	r := New(NewSource(1))
    	for ct := 0; ct < num; ct++ {
    		f := r.Float32()
    		if f >= 1 {
    			t.Fatal("Float32() should be in range [0,1). ct:", ct, "f:", f)
    		}
    	}
    }
    
    func testReadUniformity(t *testing.T, n int, seed int64) {
    	r := New(NewSource(seed))
    	buf := make([]byte, n)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 18:42:28 UTC 2024
    - 16.9K bytes
    - Viewed (0)
  2. src/math/cmplx/asin.go

    		}
    	case math.IsInf(re, 0):
    		return complex(math.Copysign(math.Pi/2, re), math.Copysign(re, im))
    	}
    	ct := complex(-imag(x), real(x)) // i * x
    	xx := x * x
    	x1 := complex(1-real(xx), -imag(xx)) // 1 - x*x
    	x2 := Sqrt(x1)                       // x2 = sqrt(1 - x*x)
    	w := Log(ct + x2)
    	return complex(imag(w), -real(w)) // -i * w
    }
    
    // Asinh returns the inverse hyperbolic sine of x.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 01 03:16:37 UTC 2020
    - 5.9K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/ssa/shortcircuit.go

    				p := e.b
    				if p.Kind != BlockIf {
    					continue
    				}
    				if p.Controls[0] != a {
    					continue
    				}
    				if e.i == 0 {
    					if ct == nil {
    						ct = f.ConstBool(f.Config.Types.Bool, true)
    					}
    					v.SetArg(i, ct)
    				} else {
    					if cf == nil {
    						cf = f.ConstBool(f.Config.Types.Bool, false)
    					}
    					v.SetArg(i, cf)
    				}
    			}
    		}
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Oct 03 17:47:02 UTC 2022
    - 12.6K bytes
    - Viewed (0)
  4. src/crypto/internal/mlkem768/mlkem768_test.go

    		s.Read(d)
    		s.Read(z)
    		ek, dk := GenerateKeyDerand(t, d, z)
    		o.Write(ek)
    		o.Write(dk.Bytes())
    
    		s.Read(msg)
    		ct, k, err := EncapsulateDerand(ek, msg)
    		if err != nil {
    			t.Fatal(err)
    		}
    		o.Write(ct)
    		o.Write(k)
    
    		kk, err := Decapsulate(dk, ct)
    		if err != nil {
    			t.Fatal(err)
    		}
    		if !bytes.Equal(kk, k) {
    			t.Errorf("k: got %x, expected %x", kk, k)
    		}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 06 15:27:18 UTC 2024
    - 10.3K bytes
    - Viewed (0)
  5. pilot/pkg/model/telemetry_test.go

    			emptyEnvoyLogging,
    		},
    	}
    	type args struct {
    		ct   *computedTelemetries
    		tel  Telemetry
    		spec *tpb.Telemetry
    	}
    
    	tests := []struct {
    		name string
    		args args
    		want *computedTelemetries
    	}{
    		{
    			name: "empty telemetry configuration",
    			args: args{
    				ct:   &computedTelemetries{},
    				tel:  Telemetry{},
    				spec: &tpb.Telemetry{},
    			},
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Fri Jun 14 04:34:30 UTC 2024
    - 39.6K bytes
    - Viewed (0)
  6. src/image/gif/writer.go

    	} else {
    		ct, err := encodeColorTable(e.localColorTable[:], pm.Palette, paddedSize)
    		if err != nil {
    			if e.err == nil {
    				e.err = err
    			}
    			return
    		}
    		// This frame's palette is not the very same slice as the global
    		// palette, but it might be a copy, possibly with one value turned into
    		// transparency by DecodeAll.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 13 21:38:09 UTC 2024
    - 11.9K bytes
    - Viewed (0)
  7. src/encoding/json/stream_test.go

    	}{`<html>foobar</html>`}
    
    	tests := []struct {
    		CaseName
    		v          any
    		wantEscape string
    		want       string
    	}{
    		{Name("c"), c, `"\u003c\u0026\u003e"`, `"<&>"`},
    		{Name("ct"), ct, `"\"\u003c\u0026\u003e\""`, `"\"<&>\""`},
    		{Name(`"<&>"`), "<&>", `"\u003c\u0026\u003e"`, `"<&>"`},
    		{
    			Name("tagStruct"), tagStruct,
    			`{"\u003c\u003e\u0026#! ":0,"Invalid":0}`,
    			`{"<>&#! ":0,"Invalid":0}`,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Aug 25 16:00:37 UTC 2023
    - 12.9K bytes
    - Viewed (0)
  8. src/runtime/type.go

    		at := (*arraytype)(unsafe.Pointer(t))
    		av := (*arraytype)(unsafe.Pointer(v))
    		return typesEqual(at.Elem, av.Elem, seen) && at.Len == av.Len
    	case abi.Chan:
    		ct := (*chantype)(unsafe.Pointer(t))
    		cv := (*chantype)(unsafe.Pointer(v))
    		return ct.Dir == cv.Dir && typesEqual(ct.Elem, cv.Elem, seen)
    	case abi.Func:
    		ft := (*functype)(unsafe.Pointer(t))
    		fv := (*functype)(unsafe.Pointer(v))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:17:26 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  9. src/crypto/internal/hpke/hpke_test.go

    					}
    					if !bytes.Equal(computedNonce, expectedNonce) {
    						t.Errorf("unexpected nonce: got %x, want %x", computedNonce, expectedNonce)
    					}
    
    					expectedCiphertext := mustDecodeHex(t, enc["ct"])
    					ciphertext, err := context.Seal(mustDecodeHex(t, enc["aad"]), mustDecodeHex(t, enc["pt"]))
    					if err != nil {
    						t.Fatal(err)
    					}
    					if !bytes.Equal(ciphertext, expectedCiphertext) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 22:33:33 UTC 2024
    - 4.7K bytes
    - Viewed (0)
  10. pkg/proxy/nftables/proxier.go

    	{nodePortEndpointsCheckChain, filterInputChain, "ct state new"},
    	{serviceEndpointsCheckChain, filterInputChain, "ct state new"},
    	{serviceEndpointsCheckChain, filterForwardChain, "ct state new"},
    	{serviceEndpointsCheckChain, filterOutputChain, "ct state new"},
    
    	{firewallCheckChain, filterPreroutingChain, "ct state new"},
    	{firewallCheckChain, filterOutputChain, "ct state new"},
    
    	{servicesChain, natOutputChain, ""},
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat Jun 08 13:48:54 UTC 2024
    - 55.5K bytes
    - Viewed (0)
Back to top