- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 505 for elem2 (0.3 sec)
-
src/internal/fuzz/queue.go
for i := 0; i < oldLen; i++ { newElems[i] = q.elems[(q.head+i)%oldCap] } q.elems = newElems q.head = 0 } func (q *queue) enqueue(e any) { if q.len+1 > q.cap() { q.grow() } i := (q.head + q.len) % q.cap() q.elems[i] = e q.len++ } func (q *queue) dequeue() (any, bool) { if q.len == 0 { return nil, false } e := q.elems[q.head] q.elems[q.head] = nil q.head = (q.head + 1) % q.cap()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Nov 05 21:02:45 UTC 2022 - 1.5K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/html/common.js
paramSetter(params); elem.href = url.toString(); } function handleTopClick(e) { // Walk back until we find TR and then get the Name column (index 5) let elem = e.target; while (elem != null && elem.nodeName != 'TR') { elem = elem.parentElement; } if (elem == null || elem.children.length < 6) return; e.preventDefault();
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 20K bytes - Viewed (0) -
src/go/types/array.go
package types // An Array represents an array type. type Array struct { len int64 elem Type } // NewArray returns a new array type for the given element type and length. // A negative length indicates an unknown length. func NewArray(elem Type, len int64) *Array { return &Array{len: len, elem: elem} } // Len returns the length of array a. // A negative result indicates an unknown length.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 927 bytes - Viewed (0) -
src/strings/strings.go
func Join(elems []string, sep string) string { switch len(elems) { case 0: return "" case 1: return elems[0] } var n int if len(sep) > 0 { if len(sep) >= maxInt/(len(elems)-1) { panic("strings: Join output length overflow") } n += len(sep) * (len(elems) - 1) } for _, elem := range elems { if len(elem) > maxInt-n {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:48:16 UTC 2024 - 31.2K bytes - Viewed (0) -
src/runtime/debug/mod.go
newline = "\n" tab = "\t" ) readModuleLine := func(elem []string) (Module, error) { if len(elem) != 2 && len(elem) != 3 { return Module{}, fmt.Errorf("expected 2 or 3 columns; got %d", len(elem)) } version := elem[1] sum := "" if len(elem) == 3 { sum = elem[2] } return Module{ Path: elem[0], Version: version, Sum: sum, }, nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 25 15:06:51 UTC 2023 - 7.6K bytes - Viewed (0) -
schema/utils.go
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Sat Aug 19 13:35:14 UTC 2023 - 5.5K bytes - Viewed (0) -
src/runtime/select.go
} else if cas.elem != nil { asanwrite(cas.elem, c.elemtype.Size_) } } selunlock(scases, lockorder) goto retc bufrecv: // can receive from buffer if raceenabled { if cas.elem != nil { raceWriteObjectPC(c.elemtype, cas.elem, casePC(casi), chanrecvpc) } racenotify(c, c.recvx, nil) } if msanenabled && cas.elem != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 13 21:36:04 UTC 2024 - 15K bytes - Viewed (0) -
operator/pkg/util/reflect.go
return kindOf(v) == reflect.Ptr && reflect.TypeOf(v).Elem().Kind() == reflect.Slice } // IsSliceInterfacePtr reports whether v is a slice ptr type. func IsSliceInterfacePtr(v any) bool { // Must use ValueOf because Elem().Elem() type resolves dynamically. vv := reflect.ValueOf(v) return vv.Kind() == reflect.Ptr && vv.Elem().Kind() == reflect.Interface && vv.Elem().Elem().Kind() == reflect.Slice }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Jul 25 19:30:47 UTC 2022 - 8.6K bytes - Viewed (0) -
test/fixedbugs/issue53702.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package main type Elem struct{} func (*Elem) Wait(callback func()) {} type Base struct { elem [8]*Elem } var g_val = 1 func (s *Base) Do() *int { resp := &g_val for _, e := range s.elem { e.Wait(func() { *resp = 0 }) } return resp } type Sub struct { *Base }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Aug 14 00:14:04 UTC 2022 - 551 bytes - Viewed (0) -
src/cmd/compile/internal/types2/scope.go
func (s *Scope) InsertLazy(name string, resolve func() Object) bool { if s.elems[name] != nil { return false } s.insert(name, &lazyObject{parent: s, resolve: resolve}) return true } func (s *Scope) insert(name string, obj Object) { if s.elems == nil { s.elems = make(map[string]Object) } s.elems[name] = obj } // Squash merges s with its parent scope p by adding all
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 20:08:23 UTC 2024 - 9.8K bytes - Viewed (0)