- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for nextFast (0.15 sec)
-
src/runtime/mbitmap.go
} // nextFast is the fast path of next. nextFast is written to be inlineable and, // as the name implies, fast. // // Callers that are performance-critical should iterate using the following // pattern: // // for { // var addr uintptr // if tp, addr = tp.nextFast(); addr == 0 { // if tp, addr = tp.next(limit); addr == 0 { // break // }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
internal/http/listener_test.go
} nextTest: for i, testCase := range testCases { listener, errs := newHTTPListener(context.Background(), testCase.serverAddrs, TCPOptions{}, ) for _, err := range errs { if err != nil { if strings.Contains(err.Error(), "The requested address is not valid in its context") { // Ignore if IP is unbindable. continue nextTest }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 17:41:02 UTC 2024 - 11.8K bytes - Viewed (0) -
schema/naming.go
buf strings.Builder lastCase, nextCase, nextNumber bool // upper case == true curCase = value[0] <= 'Z' && value[0] >= 'A' ) for i, v := range value[:len(value)-1] { nextCase = value[i+1] <= 'Z' && value[i+1] >= 'A' nextNumber = value[i+1] >= '0' && value[i+1] <= '9' if curCase { if lastCase && (nextCase || nextNumber) { buf.WriteRune(v + 32) } else {
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Wed Jun 12 03:46:59 UTC 2024 - 5.3K bytes - Viewed (0) -
src/internal/dag/parse.go
func (p *rulesParser) syntaxError(msg string) { panic(syntaxError(fmt.Sprintf("parsing graph: line %d: syntax error: %s near %s", p.lineno, msg, p.lastWord))) } // nextList parses and returns a comma-separated list of names. func (p *rulesParser) nextList() (list []string, token string) { for { tok := p.nextToken() switch tok { case "": if len(list) == 0 { return nil, "" } fallthrough
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0) -
src/net/net_windows_test.go
dups := make(map[string][]string) for name, addr := range want { if _, ok := dups[addr]; !ok { dups[addr] = make([]string, 0) } dups[addr] = append(dups[addr], name) } nextWant: for name, wantAddr := range want { if haveAddr, ok := have[name]; ok { if haveAddr != wantAddr { t.Errorf("unexpected MAC address for %q - %v, want %v", name, haveAddr, wantAddr) } continue
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/cmd/dist/test.go
// When finished, it emits header for nextTest, which is going to run after the // pending commands are done (and runPending returns). // A test should call runPending if it wants to make sure that it is not // running in parallel with earlier tests, or if it has some other reason // for needing the earlier tests to be done. func (t *tester) runPending(nextTest *distTest) { worklist := t.worklist t.worklist = nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 16:01:35 UTC 2024 - 50K bytes - Viewed (0) -
src/net/http/fs_test.go
t.Errorf("range=%q Content-Length = %d; want %d", rt.r, g, w) continue } mr := multipart.NewReader(bytes.NewReader(body), params["boundary"]) for ri, rng := range rt.ranges { part, err := mr.NextPart() if err != nil { t.Errorf("range=%q, reading part index %d: %v", rt.r, ri, err) continue Cases } wantContentRange = fmt.Sprintf("bytes %d-%d/%d", rng.start, rng.end-1, testFileLen)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 23:39:44 UTC 2024 - 49.9K bytes - Viewed (0) -
cmd/bucket-handlers.go
maxMemoryBytes := 2 * int64(10<<20) maxMemoryBytes -= int64(len(name)) maxMemoryBytes -= mapEntryOverhead if maxMemoryBytes < 0 { // We can't actually take this path, since nextPart would already have // rejected the MIME headers for being too large. Check anyway. apiErr := errorCodes.ToAPIErr(ErrMalformedPOSTRequest)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 14 13:28:35 UTC 2024 - 61.2K bytes - Viewed (0)