- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 2,691 for spice (0.28 sec)
-
src/fmt/fmt_test.go
} func TestSlicePrinter(t *testing.T) { slice := []int{} s := Sprint(slice) if s != "[]" { t.Errorf("empty slice printed as %q not %q", s, "[]") } slice = []int{1, 2, 3} s = Sprint(slice) if s != "[1 2 3]" { t.Errorf("slice: got %q expected %q", s, "[1 2 3]") } s = Sprint(&slice) if s != "&[1 2 3]" { t.Errorf("&slice: got %q expected %q", s, "&[1 2 3]") } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:31:55 UTC 2024 - 58.6K bytes - Viewed (0) -
src/os/user/listgroups_unix.go
return groups, err } } // Look for username in the list of users. If user is found, // append the GID to the groups slice. // There's no spec for /etc/passwd or /etc/group, but we try to follow // the same rules as the glibc parser, which allows comments and blank // space at the beginning of a line. line = bytes.TrimSpace(line) if len(line) == 0 || line[0] == '#' ||
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 07 23:34:21 UTC 2023 - 2.9K bytes - Viewed (0) -
src/math/big/floatmarsh.go
if x == nil { return nil, nil } // determine max. space (bytes) required for encoding sz := 1 + 1 + 4 // version + mode|acc|form|neg (3+2+2+1bit) + prec n := 0 // number of mantissa words if x.form == finite { // add space for mantissa and exponent n = int((x.prec + (_W - 1)) / _W) // required mantissa length in words for given precision // actual mantissa slice could be shorter (trailing 0's) or longer (unused bits):
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 3.6K bytes - Viewed (0) -
src/image/internal/imageutil/gen.go
// successful. If it returns false, no dst pixels were changed. // // This function assumes that r is entirely within dst's bounds and the // translation of r from dst coordinate space to src coordinate space is // entirely within src's bounds. func DrawYCbCr(dst *image.RGBA, r image.Rectangle, src *image.YCbCr, sp image.Point) (ok bool) { // This function exists in the image/internal/imageutil package because it
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 4.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/pgen.go
fmt.Fprintf(os.Stderr, "%s: %d bytes of stack space saved via stack slot merging (%d nonpointer %d pointer)\n", ir.FuncName(fn), savedNP+savedP, savedNP, savedP) if base.Debug.MergeLocalsTrace > 1 { fmt.Fprintf(os.Stderr, "=-= merge locals state for %v:\n%v", fn, mls) } } leaders = make(map[*ir.Name]int64) } // Use sort.SliceStable instead of sort.Slice so stack layout (and thus
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 13.1K bytes - Viewed (0) -
src/runtime/mpagealloc_64bit.go
entries := 1 << (heapAddrBits - shift) // Reserve b bytes of memory anywhere in the address space. b := alignUp(uintptr(entries)*pallocSumBytes, physPageSize) r := sysReserve(nil, b) if r == nil { throw("failed to reserve page summary memory") } // Put this reservation into a slice. sl := notInHeapSlice{(*notInHeap)(r), 0, entries} p.summary[l] = *(*[]pallocSum)(unsafe.Pointer(&sl)) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0) -
src/reflect/type.go
slice := (*sliceType)(unsafe.Pointer(tt)) if slice.Elem == typ { ti, _ := lookupCache.LoadOrStore(ckey, toRType(tt)) return ti.(Type) } } // Make a slice type. var islice any = ([]unsafe.Pointer)(nil) prototype := *(**sliceType)(unsafe.Pointer(&islice)) slice := *prototype slice.TFlag = 0 slice.Str = resolveReflectName(newName(s, "", false, false))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 85.5K bytes - Viewed (0) -
src/index/suffixarray/suffixarray.go
} else { // re-use existing buffers x.data = x.data[0:n] x.sa = x.sa.slice(0, n) } // read data if _, err := io.ReadFull(r, x.data); err != nil { return err } // read index sa := x.sa for sa.len() > 0 { n, err := readSlice(r, buf, sa) if err != nil { return err } sa = sa.slice(n, sa.len()) } return nil } // Write writes the index x to w.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 9.5K bytes - Viewed (0) -
src/text/template/template.go
if t.associate(nt, tree) || nt.Tree == nil { nt.Tree = tree } return nt, nil } // Templates returns a slice of defined templates associated with t. func (t *Template) Templates() []*Template { if t.common == nil { return nil } // Return a slice so we don't expose the map. t.muTmpl.RLock() defer t.muTmpl.RUnlock() m := make([]*Template, 0, len(t.tmpl)) for _, v := range t.tmpl {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:57:51 UTC 2024 - 7.2K bytes - Viewed (0) -
src/slices/slices.go
func ContainsFunc[S ~[]E, E any](s S, f func(E) bool) bool { return IndexFunc(s, f) >= 0 } // Insert inserts the values v... into s at index i, // returning the modified slice. // The elements at s[i:] are shifted up to make room. // In the returned slice r, r[i] == v[0], // and r[i+len(v)] == value originally at r[i]. // Insert panics if i is out of range. // This function is O(len(s) + len(v)).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0)