- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 485 for i$ (0.03 sec)
-
src/crypto/tls/handshake_client_test.go
for i := 0; i < 4; i++ { cache.Put(keys[i], &cs[i]) } for i := 0; i < 4; i++ { if s, ok := cache.Get(keys[i]); !ok || s != &cs[i] { t.Fatalf("session cache failed lookup for added key: %s", keys[i]) } } // Add 2 more entries to the cache. First 2 should be evicted. for i := 4; i < 6; i++ { cache.Put(keys[i], &cs[i]) } for i := 0; i < 2; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:10:12 UTC 2024 - 88.7K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/queueset_test.go
func fairAlloc(demands []float64, capacity float64) []float64 { count := len(demands) indices := make([]int, count) for i := 0; i < count; i++ { indices[i] = i } sort.Slice(indices, func(i, j int) bool { return demands[indices[i]] < demands[indices[j]] }) alloc := make([]float64, count) var next int var prevAlloc float64 for ; next < count; next++ {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Sep 26 12:55:23 UTC 2023 - 58.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
// removeReg tries to remove a value from regArgs, returning true // if found and removed, or false otherwise. removeReg := func(r ID) bool { for i := 0; i < len(regArgs); i++ { if regArgs[i] == r { regArgs = append(regArgs[:i], regArgs[i+1:]...) return true } } return false } // Walk forwards through the block. When we see OpArg*Reg, record
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
pkg/apis/extensions/v1beta1/zz_generated.conversion.go
for i := range *in { if err := Convert_networking_NetworkPolicyIngressRule_To_v1beta1_NetworkPolicyIngressRule(&(*in)[i], &(*out)[i], s); err != nil { return err } } } else { out.Ingress = nil } if in.Egress != nil { in, out := &in.Egress, &out.Egress *out = make([]v1beta1.NetworkPolicyEgressRule, len(*in)) for i := range *in {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 01 18:19:25 UTC 2023 - 95.7K bytes - Viewed (0) -
src/go/printer/nodes.go
// possibly a hexadecimal float if i := strings.LastIndexByte(x, 'P'); i >= 0 { x = x[:i] + "p" + x[i+1:] } case "0x": // possibly a hexadecimal float i := strings.LastIndexByte(x, 'P') if i == -1 { return lit // nothing to do } x = x[:i] + "p" + x[i+1:] case "0O": x = "0o" + x[2:] case "0o": return lit // nothing to do case "0B": x = "0b" + x[2:]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 17 18:53:17 UTC 2023 - 52.6K bytes - Viewed (0) -
tensorflow/c/c_api_function_test.cc
EXPECT_EQ(expected_results[i], *output_contents); } } void CompareInt32Tensor(const std::vector<int32_t>& expected, TF_Tensor* t) { int32_t* data = static_cast<int32_t*>(TF_TensorData(t)); size_t size = TF_TensorByteSize(t); ASSERT_EQ(expected.size() * sizeof(int32_t), size); for (int i = 0; i < expected.size(); ++i) { ASSERT_EQ(expected[i], data[i]) << "Different data at index " << i; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jul 20 22:08:54 UTC 2023 - 63.6K bytes - Viewed (0) -
src/cmd/cgo/out.go
func forFieldList(fl *ast.FieldList, fn func(int, string, ast.Expr)) { if fl == nil { return } i := 0 for _, r := range fl.List { if r.Names == nil { fn(i, "", r.Type) i++ } else { for _, n := range r.Names { fn(i, n.Name, r.Type) i++ } } } } func c(repr string, args ...interface{}) *TypeRepr { return &TypeRepr{repr, args}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 16:41:10 UTC 2024 - 59.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/lite/quantize_model_test.cc
int32_t* bias_values = reinterpret_cast<int32_t*>(bias_buffer->data.data()); for (size_t i = 0; i < out_channel_size; i++) { auto dequantized_value = bias_values[i] * bias_scales[i]; EXPECT_THAT(dequantized_value, FloatNear(bias_float_buffer[i], bias_scales[i] / 2)); } } const auto weights_buffer = model_.buffers[weights_tensor->buffer].get();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 23:15:24 UTC 2024 - 73.9K bytes - Viewed (0) -
src/runtime/mgcmark.go
b := b0 n := n0 for i := uintptr(0); i < n; { // Find bits for the next word. bits := uint32(*addb(ptrmask, i/(goarch.PtrSize*8))) if bits == 0 { i += goarch.PtrSize * 8 continue } for j := 0; j < 8 && i < n; j++ { if bits&1 != 0 { // Same work as in scanobject; see comments there. p := *(*uintptr)(unsafe.Pointer(b + i)) if p != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/go/build/build.go
quoted = true quote = rune continue case unicode.IsSpace(rune): if quoted || i > 0 { quoted = false args = append(args, string(arg[:i])) i = 0 } continue } arg[i] = rune i++ } if quoted || i > 0 { args = append(args, string(arg[:i])) } if quote != 0 { err = errors.New("unclosed quote") } else if escaped {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62.3K bytes - Viewed (0)