- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Breiding (3.6 sec)
-
src/cmd/go/internal/modload/init.go
func ReadWorkFile(path string) (*modfile.WorkFile, error) { path = base.ShortPath(path) // use short path in any errors workData, err := fsys.ReadFile(path) if err != nil { return nil, fmt.Errorf("reading go.work: %w", err) } f, err := modfile.ParseWork(path, workData, nil) if err != nil { return nil, fmt.Errorf("errors parsing go.work:\n%w", err) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 18:36:30 UTC 2024 - 69.8K bytes - Viewed (0) -
src/cmd/go/internal/test/test.go
if cache.DebugTest { if err != nil { fmt.Fprintf(os.Stderr, "testcache: %s: reading testlog: %v\n", a.Package.ImportPath, err) } else { fmt.Fprintf(os.Stderr, "testcache: %s: reading testlog: malformed\n", a.Package.ImportPath) } } return } testInputsID, err := computeTestInputsID(a, testlog) if err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 14:34:32 UTC 2024 - 71.9K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
// Scan DWARF info for top-level TagVariable entries with AttrName __cgo__i. types := make([]dwarf.Type, len(names)) r := d.Reader() for { e, err := r.Next() if err != nil { fatalf("reading DWARF entry: %s", err) } if e == nil { break } switch e.Tag { case dwarf.TagVariable: name, _ := e.Val(dwarf.AttrName).(string) // As of https://reviews.llvm.org/D123534, clang
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0) -
src/bytes/bytes_test.go
} } return true } func sliceOfString(s [][]byte) []string { result := make([]string, len(s)) for i, v := range s { result[i] = string(v) } return result } // For ease of reading, the test cases use strings that are converted to byte // slices before invoking the functions. var abcd = "abcd" var faces = "☺☻☹" var commas = "1,2,3,4" var dots = "1....2....3....4" type BinOpTest struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 12:58:37 UTC 2024 - 56.5K bytes - Viewed (0) -
src/cmd/go/internal/modload/buildlist.go
// other module depends on the main module, and that other module also // uses a pruned module graph, it will expect to find all of our // transitive dependencies by reading just our go.mod file, not the go.mod // files of everything we depend on. // // (This is the “import invariant” that makes graph pruning possible.) case rootsImported && pkg.flags.has(pkgFromRoot):
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 16:04:44 UTC 2024 - 53.8K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/parser.go
p.errh = errh p.mode = mode p.pragh = pragh p.scanner.init( r, // Error and directive handler for scanner. // Because the (line, col) positions passed to the // handler is always at or after the current reading // position, it is safe to use the most recent position // base to compute the corresponding Pos value. func(line, col uint, msg string) { if msg[0] != '/' { p.errorAt(p.posAt(line, col), msg) return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 62.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
return r } // uaddOvf reports whether unsigned a+b would overflow. func uaddOvf(a, b int64) bool { return uint64(a)+uint64(b) < uint64(a) } // loadLSymOffset simulates reading a word at an offset into a // read-only symbol's runtime memory. If it would read a pointer to // another symbol, that symbol is returned. Otherwise, it returns nil. func loadLSymOffset(lsym *obj.LSym, offset int64) *obj.LSym {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0)