- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 552 for elem1 (0.09 sec)
-
src/cmd/compile/internal/types2/mono.go
// parameters that it's implicitly parameterized by. for scope := obj.Parent(); scope != root; scope = scope.Parent() { for _, elem := range scope.elems { if elem, ok := elem.(*TypeName); ok && !elem.IsAlias() && cmpPos(elem.Pos(), obj.Pos()) < 0 { if tpar, ok := elem.Type().(*TypeParam); ok { if idx < 0 { idx = len(w.vertices) w.vertices = append(w.vertices, monoVertex{obj: obj}) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
src/encoding/gob/decode.go
elemIsPtr := mtyp.Elem().Kind() == reflect.Pointer keyInstr := &decInstr{keyOp, 0, nil, ovfl} elemInstr := &decInstr{elemOp, 0, nil, ovfl} keyP := reflect.New(mtyp.Key()) elemP := reflect.New(mtyp.Elem()) for i := 0; i < n; i++ { key := decodeIntoValue(state, keyOp, keyIsPtr, keyP.Elem(), keyInstr) elem := decodeIntoValue(state, elemOp, elemIsPtr, elemP.Elem(), elemInstr) value.SetMapIndex(key, elem)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 07 19:10:23 UTC 2023 - 40.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/tests/tests.go
if !found { pass.Reportf(fn.Pos(), "%s refers to unknown field or method: %s.%s", fnName, ident, mmbr) } } if len(elems) == 3 && !isExampleSuffix(elems[2]) { // Check ExampleFoo_Method_suffix and ExampleFoo_Method_Badsuffix. pass.Reportf(fn.Pos(), "%s has malformed example suffix: %s", fnName, elems[2]) } } type tokenRange struct { p, e token.Pos } func (r tokenRange) Pos() token.Pos { return r.p
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 14.4K bytes - Viewed (0) -
src/runtime/map.go
p := mapassign(t, h, key) typedmemmove(t.Elem, p, elem) } //go:linkname reflect_mapassign_faststr reflect.mapassign_faststr0 func reflect_mapassign_faststr(t *maptype, h *hmap, key string, elem unsafe.Pointer) { p := mapassign_faststr(t, h, key) typedmemmove(t.Elem, p, elem) } //go:linkname reflect_mapdelete reflect.mapdelete
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
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) -
test/typeparam/chansimp.dir/a.go
// until c is closed or the context is canceled, at which point the // returned channel is closed. func Filter[Elem any](ctx context.Context, c <-chan Elem, f func(Elem) bool) <-chan Elem { r := make(chan Elem) go func(ctx context.Context, c <-chan Elem, f func(Elem) bool, r chan<- Elem) { defer close(r) for { select { case <-ctx.Done(): return case v, ok := <-c: if !ok { return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 28 21:40:40 UTC 2021 - 5.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) -
test/typeparam/ordered.go
~float32 | ~float64 | ~string } type orderedSlice[Elem Ordered] []Elem func (s orderedSlice[Elem]) Len() int { return len(s) } func (s orderedSlice[Elem]) Less(i, j int) bool { if s[i] < s[j] { return true } isNaN := func(f Elem) bool { return f != f } if isNaN(s[i]) && !isNaN(s[j]) { return true } return false } func (s orderedSlice[Elem]) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 2.2K bytes - Viewed (0) -
test/typeparam/chans.go
// until c is closed or the context is canceled, at which point the // returned channel is closed. func _Filter[Elem any](ctx context.Context, c <-chan Elem, f func(Elem) bool) <-chan Elem { r := make(chan Elem) go func(ctx context.Context, c <-chan Elem, f func(Elem) bool, r chan<- Elem) { defer close(r) for { select { case <-ctx.Done(): return case v, ok := <-c: if !ok { return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 8.4K 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)