- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 62 for asarray (1.15 sec)
-
association.go
switch rel.Type { case schema.BelongsTo: if len(values) == 0 { updateMap := map[string]interface{}{} switch reflectValue.Kind() { case reflect.Slice, reflect.Array: for i := 0; i < reflectValue.Len(); i++ { association.Error = rel.Field.Set(association.DB.Statement.Context, reflectValue.Index(i), reflect.Zero(rel.Field.FieldType).Interface()) } case reflect.Struct:
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Wed Jun 12 10:49:45 UTC 2024 - 21.5K bytes - Viewed (0) -
src/cmd/compile/internal/walk/assign.go
// TODO(mdempsky): Disallow init statements on lvalues. init := ir.TakeInit(l) walkStmtList(init) early.Append(init...) switch ll := l.(type) { case *ir.IndexExpr: if ll.X.Type().IsArray() { save(&ll.Index) l = ll.X continue } case *ir.ParenExpr: l = ll.X continue case *ir.SelectorExpr: if ll.Op() == ir.ODOT { l = ll.X continue
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:09:06 UTC 2024 - 20.3K bytes - Viewed (0) -
src/cmd/compile/internal/staticinit/sched.go
"cmd/compile/internal/typecheck" "cmd/compile/internal/types" "cmd/internal/obj" "cmd/internal/objabi" "cmd/internal/src" ) type Entry struct { Xoffset int64 // struct, array only Expr ir.Node // bytes of run-time computed expressions } type Plan struct { E []Entry } // An Schedule is used to decompose assignment statements into
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 17:16:14 UTC 2024 - 30.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/nilcheck.go
// efficacy of the cse pass. sdom := f.Sdom() // TODO: Eliminate more nil checks. // We can recursively remove any chain of fixed offset calculations, // i.e. struct fields and array elements, even with non-constant // indices: x is non-nil iff x.a.b[i].c is. type walkState int const ( Work walkState = iota // process nil checks and traverse to dominees
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 11.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typestring.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 12.2K bytes - Viewed (0) -
src/cmd/compile/internal/types/fmt.go
switch mode { case fmtTypeID, fmtTypeIDName: if verb == 'S' { tconv2(b, t.Elem(), 'S', mode, visited) return } } tconv2(b, t.Elem(), 'v', mode, visited) case TARRAY: b.WriteByte('[') b.WriteString(strconv.FormatInt(t.NumElem(), 10)) b.WriteByte(']') tconv2(b, t.Elem(), 0, mode, visited) case TSLICE: b.WriteString("[]")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 12 15:41:17 UTC 2023 - 15.7K bytes - Viewed (0) -
src/cmd/internal/obj/link.go
// Within this subspace, the first arch-specific opcode should be // at offset A_ARCHSPECIFIC. // // Subspaces are aligned to a power of two so opcodes can be masked // with AMask and used as compact array indices. const ( ABase386 = (1 + iota) << 11 ABaseARM ABaseAMD64 ABasePPC64 ABaseARM64 ABaseMIPS ABaseLoong64 ABaseRISCV ABaseS390X ABaseWasm
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 33.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/memcombine.go
return false } a = append(a, StoreRecord{x, off}) } // Before we sort, grab the memory arg the result should have. mem := a[n-1].store.Args[2] // Also grab position of first store (last in array = first in memory order). pos := a[n-1].store.Pos // Sort stores in increasing address order. sort.Slice(a, func(i, j int) bool { return a[i].offset < a[j].offset })
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 19:45:41 UTC 2024 - 18.4K bytes - Viewed (0) -
src/cmd/compile/internal/walk/complit.go
} // recipe for var = []t{...} // 1. make a static array // var vstat [...]t // 2. assign (data statements) the constant part // vstat = constpart{} // 3. make an auto pointer to array and allocate heap to it // var vauto *[...]t = new([...]t) // 4. copy the static array to the auto array // *vauto = vstat // 5. for each dynamic part assign to the array // vauto[i] = dynamic part
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:03:54 UTC 2023 - 19.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typexpr.go
return check.definedType(e.X, def) case *syntax.ArrayType: typ := new(Array) setDefType(def, typ) if e.Len != nil { typ.len = check.arrayLength(e.Len) } else { // [...]array check.error(e, BadDotDotDotSyntax, "invalid use of [...] array (outside a composite literal)") typ.len = -1 } typ.elem = check.varType(e.Elem) if typ.len >= 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 16.6K bytes - Viewed (0)