- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 504 for nelem (0.05 sec)
-
src/runtime/type.go
return typesEqual(mt.Key, mv.Key, seen) && typesEqual(mt.Elem, mv.Elem, seen) case abi.Pointer: pt := (*ptrtype)(unsafe.Pointer(t)) pv := (*ptrtype)(unsafe.Pointer(v)) return typesEqual(pt.Elem, pv.Elem, seen) case abi.Slice: st := (*slicetype)(unsafe.Pointer(t)) sv := (*slicetype)(unsafe.Pointer(v)) return typesEqual(st.Elem, sv.Elem, seen) case abi.Struct: st := (*structtype)(unsafe.Pointer(t))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 12.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/decompose.go
if t.NumElem() != 1 { v.Fatalf("SSAable array must have no more than 1 element") } elem := v.Block.NewValue0(v.Pos, OpPhi, t.Elem()) for _, a := range v.Args { elem.AddArg(a.Block.NewValue1I(v.Pos, OpArraySelect, t.Elem(), 0, a)) } v.reset(OpArrayMake1) v.AddArg(elem) // Recursively decompose elem phi. decomposeUserPhi(elem) } // MaxStruct is the maximum number of fields a struct
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 23 21:22:15 UTC 2022 - 13.4K bytes - Viewed (0) -
test/typeparam/issue48042.go
x = g[T] return x.(func()func()(*T))()() } func (l *Foo[T]) g() func() (*T) { return func() (*T) { t := new(T) reflect.ValueOf(t).Elem().SetInt(100) return t } } func g[T any]() func() (*T) { return func() (*T) { t := new(T) reflect.ValueOf(t).Elem().SetInt(100) return t } } func main() { foo := Foo[int]{} // Make sure the function conversion is correct
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 1.3K bytes - Viewed (0) -
src/text/template/exec.go
mark := s.mark() oneIteration := func(index, elem reflect.Value) { if len(r.Pipe.Decl) > 0 { if r.Pipe.IsAssign { // With two variables, index comes first. // With one, we use the element. if len(r.Pipe.Decl) > 1 { s.setVar(r.Pipe.Decl[0].Ident[0], index) } else { s.setVar(r.Pipe.Decl[0].Ident[0], elem) } } else { // Set top var (lexically the second if there
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 21:22:24 UTC 2024 - 32K bytes - Viewed (0) -
src/runtime/mcentral.go
havespan: if !traceDone { trace := traceAcquire() if trace.ok() { trace.GCSweepDone() traceRelease(trace) } } n := int(s.nelems) - int(s.allocCount) if n == 0 || s.freeindex == s.nelems || s.allocCount == s.nelems { throw("span has no free objects") } freeByteBase := s.freeindex &^ (64 - 1) whichByte := freeByteBase / 8 // Init alloc bits cache.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.1K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/html/stacks.js
// setHrefParam updates the specified parameter in the href of an <a> // element to make it operate on the specified src. function setHrefParam(id, param, src) { const elem = document.getElementById(id); if (!elem) return; let url = new URL(elem.href); url.hash = ''; // Copy params from this page's URL. const params = url.searchParams; for (const p of new URLSearchParams(window.location.search)) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 18.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/tensor_array_ops_decomposition.mlir
%const = "tf.Const"() {value = dense<1> : tensor<i32>} : () -> tensor<i32> %elem = "tf._SomeOp"() : () -> tensor<3xf32> %grad:2 = "tf.TensorArrayGradV3"(%ta#0, %ta#1) {source = "a"} : (tensor<!tf_type.resource>, tensor<f32>) -> (tensor<!tf_type.resource>, tensor<f32>) %gwrite = "tf.TensorArrayWriteV3"(%grad#0, %const, %elem, %grad#1) : (tensor<!tf_type.resource>, tensor<i32>, tensor<3xf32>, tensor<f32>) -> tensor<f32> func.return
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 49K bytes - Viewed (0) -
src/runtime/cgocheck.go
at := (*arraytype)(unsafe.Pointer(typ)) for i := uintptr(0); i < at.Len; i++ { if off < at.Elem.Size_ { cgoCheckUsingType(at.Elem, src, off, size) } src = add(src, at.Elem.Size_) skipped := off if skipped > at.Elem.Size_ { skipped = at.Elem.Size_ } checked := at.Elem.Size_ - skipped off -= skipped if size <= checked { return } size -= checked }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 04:07:57 UTC 2024 - 7.6K bytes - Viewed (0) -
src/reflect/tostring_test.go
if val.Bool() { return "true" } else { return "false" } case Pointer: v := val str = typ.String() + "(" if v.IsNil() { str += "0" } else { str += "&" + valueToString(v.Elem()) } str += ")" return str case Array, Slice: v := val str += typ.String() str += "{" for i := 0; i < v.Len(); i++ { if i > 0 { str += ", " }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 26 14:24:17 UTC 2021 - 2.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/analysisinternal/analysis.go
default: return ast.NewIdent(t.Name()) } case *types.Pointer: x := TypeExpr(f, pkg, t.Elem()) if x == nil { return nil } return &ast.UnaryExpr{ Op: token.MUL, X: x, } case *types.Array: elt := TypeExpr(f, pkg, t.Elem()) if elt == nil { return nil } return &ast.ArrayType{ Len: &ast.BasicLit{ Kind: token.INT,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 11.7K bytes - Viewed (0)