- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 69 for lineFor (0.14 sec)
-
src/net/http/mapping_test.go
"articles", } if len(children) != 32 { panic("bad len") } for _, n := range []int{2, 4, 8, 16, 32} { list := children[:n] b.Run(fmt.Sprintf("n=%d", n), func(b *testing.B) { b.Run("rep=linear", func(b *testing.B) { var entries []entry[string, any] for _, c := range list { entries = append(entries, entry[string, any]{c, nil}) } b.ResetTimer() for i := 0; i < b.N; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 12 17:47:07 UTC 2023 - 2.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/lostcancel/lostcancel.go
// single pass over the AST, but seldom is there more than one.) for v, stmt := range cancelvars { if ret := lostCancelPath(pass, g, v, stmt, sig); ret != nil { lineno := pass.Fset.Position(stmt.Pos()).Line pass.ReportRangef(stmt, "the %s function is not used on all paths (possible context leak)", v.Name()) pos, end := ret.Pos(), ret.End()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9K bytes - Viewed (0) -
src/cmd/internal/pgo/pprof.go
seenStartLine = seenStartLine || n.Info.StartLine != 0 canonicalName := n.Info.Name // Create the key to the nodeMapKey. namedEdge := NamedCallEdge{ CallerName: canonicalName, CallSiteOffset: n.Info.Lineno - n.Info.StartLine, } for _, e := range n.Out { totalWeight += e.WeightValue() namedEdge.CalleeName = e.Dest.Info.Name // Create new entry or increment existing entry.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 20:20:01 UTC 2024 - 4K bytes - Viewed (0) -
src/regexp/backtrack.go
// a bit vector with (length of input) * (length of prog) bits, // to make sure it never explores the same (character position, instruction) // state multiple times. This limits the search to run in time linear in // the length of the test. // // backtrack is a fast replacement for the NFA code on small // regexps when onepass cannot be used. package regexp import ( "regexp/syntax" "sync" )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 17:25:39 UTC 2023 - 8.8K bytes - Viewed (0) -
src/cmd/internal/pkgpattern/pkgpattern.go
// This is a bit complicated but the obvious alternative, // namely a hand-written search like in most shell glob matchers, // is too easy to make accidentally exponential. // Using package regexp guarantees linear-time matching. const vendorChar = "\x00" if vendorExclude && strings.Contains(pattern, vendorChar) { return func(name string) bool { return false } } re := regexp.QuoteMeta(pattern) wild := `.*`
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 27 16:43:40 UTC 2022 - 4.8K bytes - Viewed (0) -
test/maplinear.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 3.6K bytes - Viewed (0) -
src/cmd/internal/objfile/goobj.go
// Should never be called. We implement Liner below, callers // should use that instead. return 0, nil, nil, fmt.Errorf("pcln not available in go object file") } // Find returns the file name, line, and function data for the given pc. // Returns "",0,nil if unknown. // This function implements the Liner interface in preference to pcln() above.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 15 15:39:57 UTC 2023 - 7.8K bytes - Viewed (0) -
docs/bucket/replication/setup_2site_existing_replication.sh
#!/usr/bin/env bash echo "Running $0" set -x trap 'catch $LINENO' ERR # shellcheck disable=SC2120 catch() { if [ $# -ne 0 ]; then echo "error on line $1" for site in sitea siteb; do echo "$site server logs =========" cat "/tmp/${site}_1.log" echo "===========================" cat "/tmp/${site}_2.log" done fi echo "Cleaning up instances of MinIO" pkill minio pkill -9 minio
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat May 18 18:19:01 UTC 2024 - 5.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/layout.go
// in which those blocks will appear in the assembly output. func layout(f *Func) { f.Blocks = layoutOrder(f) } // Register allocation may use a different order which has constraints // imposed by the linear-scan algorithm. func layoutRegallocOrder(f *Func) []*Block { // remnant of an experiment; perhaps there will be another. return layoutOrder(f) } func layoutOrder(f *Func) []*Block {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 5K bytes - Viewed (0) -
src/unicode/utf16/utf16_test.go
// from https://en.wikipedia.org/wiki/UTF-16 {'\u007A', false}, // LATIN SMALL LETTER Z {'\u6C34', false}, // CJK UNIFIED IDEOGRAPH-6C34 (water) {'\uFEFF', false}, // Byte Order Mark {'\U00010000', false}, // LINEAR B SYLLABLE B008 A (first non-BMP code point) {'\U0001D11E', false}, // MUSICAL SYMBOL G CLEF {'\U0010FFFD', false}, // PRIVATE USE CHARACTER-10FFFD (last Unicode code point) {rune(0xd7ff), false}, // surr1-1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 19:08:48 UTC 2024 - 6.5K bytes - Viewed (0)