- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 502 for elem3 (0.2 sec)
-
scan.go
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Wed Jun 12 10:57:36 UTC 2024 - 10K bytes - Viewed (0) -
src/internal/types/testdata/examples/inference.go
// last. related2(1.2, []float64{}) related2(1.0, []int{}) related2 /* ERROR "Slice (type []int) does not satisfy interface{[]Elem}" */ (float64(1.0), []int{}) // TODO(gri) better error message } type List[P any] []P func related3[Elem any, Slice []Elem | List[Elem]]() Slice { return nil } func _() { // related3 can be instantiated explicitly related3[int, []int]() related3[byte, List[byte]]()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 02 16:49:45 UTC 2023 - 4.3K bytes - Viewed (0) -
src/cmd/compile/internal/types/size.go
case TARRAY: if t.Elem() == nil { break } CalcSize(t.Elem()) t.SetNotInHeap(t.Elem().NotInHeap()) if t.Elem().width != 0 { cap := (uint64(MaxWidth) - 1) / uint64(t.Elem().width) if uint64(t.NumElem()) > cap { base.Errorf("type %L larger than address space", t) } } w = t.NumElem() * t.Elem().width t.align = t.Elem().align
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 15K bytes - Viewed (0) -
src/cmd/compile/internal/types2/index.go
case *Array: l = t.len e = t.elem if x.mode != variable { mode = value } case *Pointer: if t, _ := under(t.base).(*Array); t != nil { l = t.len e = t.elem } case *Slice: e = t.elem case *Map: k = t.key e = t.elem } if e == nil { return false } if elem == nil { // first type length = l
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 15 16:16:58 UTC 2023 - 11.5K bytes - Viewed (0) -
src/go/types/subst.go
return subst.check.newAliasInstance(subst.pos, t.orig, targs, subst.ctxt) } case *Array: elem := subst.typOrNil(t.elem) if elem != t.elem { return &Array{len: t.len, elem: elem} } case *Slice: elem := subst.typOrNil(t.elem) if elem != t.elem { return &Slice{elem: elem} } case *Struct: if fields, copied := subst.varList(t.fields); copied {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:04:07 UTC 2024 - 11.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/stack_ops_decomposition.mlir
// CHECK: "tf.AssignVariableOp"(%[[BUFFER]], %[[UPDATE]]) // CHECK: "tf.AssignVariableOp"(%[[SIZE]] %push = "tf.StackPushV2"(%stack, %elem) {swap_memory = false} : (tensor<!tf_type.resource>, tensor<f32>) -> tensor<f32> "tf.Yield"(%elem) : (tensor<f32>) -> () }, { %elem = "tf._SomeOtherOp"() : () -> tensor<f32> // CHECK-NOT: tf.StackPushV2 // CHECK: %[[BUFFER_VAL:.*]] = "tf.ReadVariableOp"(%[[BUFFER]])
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 25.8K bytes - Viewed (0) -
src/cmd/compile/internal/walk/temp.go
// allocated temporary variable of type [len]elem. This variable is // initialized, and elem must not contain pointers. func stackBufAddr(len int64, elem *types.Type) *ir.AddrExpr { if elem.HasPointers() { base.FatalfAt(base.Pos, "%v has pointers", elem) } tmp := typecheck.TempAt(base.Pos, ir.CurFunc, types.NewArray(elem, len)) return typecheck.Expr(typecheck.NodAddr(tmp)).(*ir.AddrExpr)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 1.5K bytes - Viewed (0) -
src/go/types/index.go
case *Array: l = t.len e = t.elem if x.mode != variable { mode = value } case *Pointer: if t, _ := under(t.base).(*Array); t != nil { l = t.len e = t.elem } case *Slice: e = t.elem case *Map: k = t.key e = t.elem } if e == nil { return false } if elem == nil { // first type length = l
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:17:05 UTC 2024 - 11.2K bytes - Viewed (0) -
src/cmd/compile/internal/walk/range.go
if nn := arrayRangeClear(nrange, v1, v2, a); nn != nil { base.Pos = lno return nn } // Element type of the iteration var elem *types.Type switch t.Kind() { case types.TSLICE, types.TARRAY: elem = t.Elem() case types.TPTR: elem = t.Elem().Elem() } // order.stmt arranged for a copy of the array/slice variable if needed. ha := a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 20 14:52:33 UTC 2023 - 17.6K bytes - Viewed (0) -
src/testing/quick/quick.go
v.Elem().Set(elem) } case reflect.Slice: numElems := rand.Intn(size) sizeLeft := size - numElems v.Set(reflect.MakeSlice(concrete, numElems, numElems)) for i := 0; i < numElems; i++ { elem, ok := sizedValue(concrete.Elem(), rand, sizeLeft) if !ok { return reflect.Value{}, false } v.Index(i).Set(elem) } case reflect.Array: for i := 0; i < v.Len(); i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 17:55:47 UTC 2023 - 10.1K bytes - Viewed (0)