Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 50 for Printf (0.15 sec)

  1. src/bytes/example_test.go

    	b.Write([]byte("64 bytes or fewer"))
    	fmt.Printf("%q", bb[:b.Len()])
    	// Output: "64 bytes or fewer"
    }
    
    func ExampleBuffer_Len() {
    	var b bytes.Buffer
    	b.Grow(64)
    	b.Write([]byte("abcde"))
    	fmt.Printf("%d", b.Len())
    	// Output: 5
    }
    
    func ExampleBuffer_Next() {
    	var b bytes.Buffer
    	b.Grow(64)
    	b.Write([]byte("abcde"))
    	fmt.Printf("%s\n", b.Next(2))
    	fmt.Printf("%s\n", b.Next(2))
    	fmt.Printf("%s", b.Next(2))
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Mar 04 15:54:40 GMT 2024
    - 15K bytes
    - Viewed (1)
  2. misc/ios/detect.go

    		pcert, err := x509.ParseCertificate(cert)
    		check(err)
    		fmt.Printf("export GOIOS_DEV_ID=\"%s\"\n", pcert.Subject.CommonName)
    
    		appID, err := plistExtract(fname, "Entitlements:application-identifier")
    		check(err)
    		fmt.Printf("export GOIOS_APP_ID=%s\n", appID)
    
    		teamID, err := plistExtract(fname, "Entitlements:com.apple.developer.team-identifier")
    		check(err)
    		fmt.Printf("export GOIOS_TEAM_ID=%s\n", teamID)
    	}
    }
    
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Thu Oct 19 23:33:30 GMT 2023
    - 3.2K bytes
    - Viewed (0)
  3. misc/linkcheck/linkcheck.go

    	}
    	if *verbose {
    		log.Printf("Len of %s: %d", url, len(slurp))
    	}
    	body := string(slurp)
    	for _, ref := range localLinks(body) {
    		if *verbose {
    			log.Printf("  links to %s", ref)
    		}
    		dest := *root + ref
    		linkSources[dest] = append(linkSources[dest], url)
    		crawl(dest, url)
    	}
    	for _, id := range pageIDs(body) {
    		if *verbose {
    			log.Printf(" url %s has #%s", url, id)
    		}
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Oct 06 15:53:04 GMT 2021
    - 3.9K bytes
    - Viewed (0)
  4. src/cmd/asm/main.go

    			break
    		}
    	}
    	if ok && !*flags.SymABIs {
    		ctxt.NumberSyms()
    		obj.WriteObjFile(ctxt, buf)
    	}
    	if !ok || diag {
    		if failedFile != "" {
    			log.Printf("assembly of %s failed", failedFile)
    		} else {
    			log.Print("assembly failed")
    		}
    		buf.Close()
    		os.Remove(*flags.OutputFile)
    		os.Exit(1)
    	}
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Aug 29 07:48:38 GMT 2023
    - 2.7K bytes
    - Viewed (0)
  5. src/bufio/example_test.go

    		}
    		return
    	}
    	// Set the split function for the scanning operation.
    	scanner.Split(split)
    	// Validate the input
    	for scanner.Scan() {
    		fmt.Printf("%s\n", scanner.Text())
    	}
    
    	if err := scanner.Err(); err != nil {
    		fmt.Printf("Invalid input: %s", err)
    	}
    	// Output:
    	// 1234
    	// 5678
    	// Invalid input: strconv.ParseInt: parsing "1234567901234567890": value out of range
    }
    
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Oct 23 09:06:30 GMT 2023
    - 4.9K bytes
    - Viewed (0)
  6. src/cmd/api/boring_test.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    //go:build boringcrypto
    
    package main
    
    import (
    	"fmt"
    	"os"
    )
    
    func init() {
    	fmt.Printf("SKIP with boringcrypto enabled\n")
    	os.Exit(0)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Aug 16 16:02:26 GMT 2023
    - 300 bytes
    - Viewed (0)
  7. src/cmd/buildid/buildid.go

    	flag.Parse()
    	if flag.NArg() != 1 {
    		usage()
    	}
    
    	file := flag.Arg(0)
    	id, err := buildid.ReadFile(file)
    	if err != nil {
    		log.Fatal(err)
    	}
    	if !*wflag {
    		fmt.Printf("%s\n", id)
    		return
    	}
    
    	// Keep in sync with src/cmd/go/internal/work/buildid.go:updateBuildID
    
    	f, err := os.Open(file)
    	if err != nil {
    		log.Fatal(err)
    	}
    	matches, hash, err := buildid.FindAndHash(f, id, 0)
    	f.Close()
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Jun 06 14:30:53 GMT 2022
    - 1.5K bytes
    - Viewed (0)
  8. src/cmd/asm/internal/asm/parse.go

    			default:
    				a.Type = obj.TYPE_MEM
    			}
    			// fmt.Printf("CONST %d %s\n", a.Offset, obj.Dconv(&emptyProg, 0, a))
    			p.expectOperandEnd()
    			return
    		}
    		// fmt.Printf("offset %d \n", a.Offset)
    	}
    
    	// Register indirection: (reg) or (index*scale). We are on the opening paren.
    	p.registerIndirect(a, prefix)
    	// fmt.Printf("DONE %s\n", p.arch.Dconv(&emptyProg, 0, a))
    
    	p.expectOperandEnd()
    	return
    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)
  9. misc/cgo/gmp/pi.go

    	k := int64(0)
    	for {
    		d := int64(-1)
    		for d < 0 {
    			k++
    			nextTerm(k)
    			d = extractDigit()
    		}
    		eliminateDigit(d)
    		fmt.Printf("%c", d+'0')
    
    		if i++; i%50 == 0 {
    			fmt.Printf("\n")
    			if i >= 1000 {
    				break
    			}
    		}
    	}
    
    	fmt.Printf("\n%d calls; bit sizes: %d %d %d\n", runtime.NumCgoCall(), numer.Len(), accum.Len(), denom.Len())
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Apr 10 22:32:35 GMT 2023
    - 1.3K bytes
    - Viewed (0)
  10. src/cmd/api/main_test.go

    			if !ok {
    				log.Printf("%s:%d: missing proposal approval\n", filename, i+1)
    				exitCode = 1
    			} else {
    				_, err := strconv.Atoi(approval)
    				if err != nil {
    					log.Printf("%s:%d: malformed proposal approval #%s\n", filename, i+1, approval)
    					exitCode = 1
    				}
    			}
    			line = strings.TrimSpace(feature)
    		} else {
    			if strings.Contains(line, " #") {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Apr 09 20:48:51 GMT 2024
    - 31.4K bytes
    - Viewed (0)
Back to top