- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 268 for names_ (0.12 sec)
-
src/cmd/compile/internal/types2/named.go
func (t *Named) methodIndex(name string, foldCase bool) int { if name == "_" { return -1 } if foldCase { for i, m := range t.methods { if strings.EqualFold(m.name, name) { return i } } } else { for i, m := range t.methods { if m.name == name { return i } } } return -1 } // Underlying returns the [underlying type] of the named type t, resolving all
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 23.9K bytes - Viewed (0) -
src/go/types/named.go
func (t *Named) methodIndex(name string, foldCase bool) int { if name == "_" { return -1 } if foldCase { for i, m := range t.methods { if strings.EqualFold(m.name, name) { return i } } } else { for i, m := range t.methods { if m.name == name { return i } } } return -1 } // Underlying returns the [underlying type] of the named type t, resolving all
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 24K bytes - Viewed (0) -
src/cmd/internal/obj/util.go
} type opSet struct { lo As names []string } // Not even worth sorting var aSpace []opSet // RegisterOpcode binds a list of instruction names // to a given instruction number range. func RegisterOpcode(lo As, Anames []string) { if len(Anames) > AllowedOpCodes { panic(fmt.Sprintf("too many instructions, have %d max %d", len(Anames), AllowedOpCodes)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 17.5K bytes - Viewed (0) -
src/go/ast/filter.go
j := 0 for _, f := range list { keepField := false if len(f.Names) == 0 { // anonymous field name := fieldName(f.Type) keepField = name != nil && filter(name.Name) } else { n := len(f.Names) f.Names = filterIdentList(f.Names, filter) if len(f.Names) < n { removedFields = true } keepField = len(f.Names) > 0 } if keepField { if export {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 13.3K bytes - Viewed (0) -
internal/dsync/drwmutex.go
} // NewDRWMutex - initializes a new dsync RW mutex. func NewDRWMutex(clnt *Dsync, names ...string) *DRWMutex { restClnts, _ := clnt.GetLockers() sort.Strings(names) return &DRWMutex{ writeLocks: make([]string, len(restClnts)), readLocks: make([]string, len(restClnts)), Names: names, clnt: clnt,
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 19.7K bytes - Viewed (0) -
src/testing/fstest/testfs.go
slices.Sort(names) } var problems []string for len(want) > 0 || len(names) > 0 { switch { case len(want) > 0 && len(names) > 0 && want[0] == names[0]: want, names = want[1:], names[1:] case len(want) > 0 && (len(names) == 0 || want[0] < names[0]): problems = append(problems, "missing: "+want[0]) want = want[1:] default: problems = append(problems, "extra: "+names[0])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 16.3K bytes - Viewed (0) -
src/go/types/decl.go
// end of the innermost containing block." scopePos := d.spec.End() for i, name := range d.spec.Names { check.declare(check.scope, name, lhs[i], scopePos) } case varDecl: top := len(check.delayed) lhs0 := make([]*Var, len(d.spec.Names)) for i, name := range d.spec.Names { lhs0[i] = NewVar(name.Pos(), pkg, name.Name, nil) } // initialize all variables for i, obj := range lhs0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 31K bytes - Viewed (0) -
src/cmd/link/internal/ld/deadcode.go
} else { *flagEntrySymbol = "main" } } names = append(names, *flagEntrySymbol) } // runtime.unreachableMethod is a function that will throw if called. // We redirect unreachable methods to it. names = append(names, "runtime.unreachableMethod") if d.ctxt.BuildMode == BuildModePlugin {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 14:52:41 UTC 2024 - 19K bytes - Viewed (0) -
scan.go
} } else if names := utils.SplitNestedRelationName(column); len(names) > 1 { // has nested relation if rel, ok := sch.Relationships.Relations[names[0]]; ok { subNameCount := len(names) // nested relation fields relFields := make([]*schema.Field, 0, subNameCount-1) relFields = append(relFields, rel.Field) for _, name := range names[1 : subNameCount-1] {
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Wed Jun 12 10:57:36 UTC 2024 - 10K bytes - Viewed (0) -
JavadocStyleGuide.md
- Java keywords - package names - class names - method names - interface names - field names - argument names - code examples (see section 1.3 below) For example: ```java /** * Use the {@code Project} instance to configure the project. */ ``` ### 1.1.7 Block tags
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jun 06 15:43:07 UTC 2024 - 11.5K bytes - Viewed (0)