- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 25 for Account (0.14 sec)
-
src/bytes/boundary_test.go
} func TestCountNearPageBoundary(t *testing.T) { t.Parallel() b := dangerousSlice(t) for i := range b { c := Count(b[i:], []byte{1}) if c != 0 { t.Fatalf("Count(b[%d:], {1})=%d, want 0\n", i, c) } c = Count(b[:i], []byte{0}) if c != i { t.Fatalf("Count(b[:%d], {0})=%d, want %d\n", i, c, i) } }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Nov 30 20:05:58 GMT 2023 - 2.8K bytes - Viewed (0) -
src/bytes/bytes_test.go
buf[n-1] = 'x' for i := 0; i < b.N; i++ { j := Count(buf, buf[n-7:]) if j != 1 { b.Fatal("bad count", j) } } buf[n-1] = '\x00' }) } func BenchmarkCountEasy(b *testing.B) { benchBytes(b, indexSizes, func(b *testing.B, n int) { buf := bmbuf[0:n] buf[n-1] = 'x' buf[n-7] = 'x' for i := 0; i < b.N; i++ { j := Count(buf, buf[n-7:]) if j != 1 {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Jan 24 16:07:25 GMT 2024 - 56.2K bytes - Viewed (0) -
api/next/62254.txt
pkg net, method (*TCPConn) SetKeepAliveConfig(KeepAliveConfig) error #62254 pkg net, type Dialer struct, KeepAliveConfig KeepAliveConfig #62254 pkg net, type KeepAliveConfig struct #62254 pkg net, type KeepAliveConfig struct, Count int #62254 pkg net, type KeepAliveConfig struct, Enable bool #62254 pkg net, type KeepAliveConfig struct, Idle time.Duration #62254 pkg net, type KeepAliveConfig struct, Interval time.Duration #62254
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Feb 20 06:04:31 GMT 2024 - 758 bytes - Viewed (0) -
src/bufio/scan.go
ErrTooLong = errors.New("bufio.Scanner: token too long") ErrNegativeAdvance = errors.New("bufio.Scanner: SplitFunc returns negative advance count") ErrAdvanceTooFar = errors.New("bufio.Scanner: SplitFunc returns advance count beyond input") ErrBadReadCount = errors.New("bufio.Scanner: Read returned impossible count") ) const ( // MaxScanTokenSize is the maximum size used to buffer a token
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Oct 23 09:06:30 GMT 2023 - 14.2K bytes - Viewed (0) -
src/bytes/example_test.go
fmt.Println(bytes.ContainsFunc([]byte("World"), f)) // Output: // false // true } func ExampleCount() { fmt.Println(bytes.Count([]byte("cheese"), []byte("e"))) fmt.Println(bytes.Count([]byte("five"), []byte(""))) // before & after each rune // Output: // 3 // 5 } func ExampleCut() { show := func(s, sep string) {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Mar 04 15:54:40 GMT 2024 - 15K bytes - Viewed (1) -
doc/asm.html
This data contains no pointers and therefore does not need to be scanned by the garbage collector. </li> <li> <code>WRAPPER</code> = 32 <br> (For <code>TEXT</code> items.) This is a wrapper function and should not count as disabling <code>recover</code>. </li> <li> <code>NEEDCTXT</code> = 64 <br> (For <code>TEXT</code> items.) This function is a closure so it uses its incoming context register. </li> <li>
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
if p.arch.Family == sys.ARM64 { if x >= 64 { p.errorf("register shift count too large: %s", str) } count = int16((x & 63) << 10) } else { if x >= 32 { p.errorf("register shift count too large: %s", str) } count = int16((x & 31) << 7) } default: p.errorf("unexpected %s in register shift", tok.String()) } if p.arch.Family == sys.ARM64 {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K bytes - Viewed (0) -
src/bytes/reader.go
r.prevRune = -1 if r.i >= int64(len(r.s)) { return 0, nil } b := r.s[r.i:] m, err := w.Write(b) if m > len(b) { panic("bytes.Reader.WriteTo: invalid Write count") } r.i += int64(m) n = int64(m) if m != len(b) && err == nil { err = io.ErrShortWrite } return } // Reset resets the [Reader.Reader] to be reading from b.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 17:10:31 GMT 2023 - 3.9K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
break } } // Zero-argument macros are tricky. if len(macro.args) == 0 && len(args) == 1 && args[0] == nil { args = nil } else if len(args) != len(macro.args) { in.Error("wrong arg count for macro", macro.name) } argMap := make(map[string][]Token) for i, arg := range args { argMap[macro.args[i]] = arg } return argMap }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0) -
src/archive/zip/zip_test.go
var rp *repeatedByte if len(r.buf) > 0 { rp = &r.buf[len(r.buf)-1] // Fast path, if p is entirely the same byte repeated. if lastByte := rp.b; len(p) > 0 && p[0] == lastByte { if bytes.Count(p, []byte{lastByte}) == len(p) { rp.n += int64(len(p)) return len(p), nil } } } for _, b := range p { if rp == nil || rp.b != b {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Mar 27 18:23:49 GMT 2024 - 19.5K bytes - Viewed (0)