Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 15 for smart (0.19 sec)

  1. src/cmd/cgo/doc.go

    _cgo_import.go, which looks like:
    
    	//go:cgo_dynamic_linker "/lib64/ld-linux-x86-64.so.2"
    	//go:cgo_import_dynamic puts puts#GLIBC_2.2.5 "libc.so.6"
    	//go:cgo_import_dynamic __libc_start_main __libc_start_main#GLIBC_2.2.5 "libc.so.6"
    	//go:cgo_import_dynamic stdout stdout#GLIBC_2.2.5 "libc.so.6"
    	//go:cgo_import_dynamic fflush fflush#GLIBC_2.2.5 "libc.so.6"
    	//go:cgo_import_dynamic _ _ "libpthread.so.0"
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Sun Mar 31 09:02:45 GMT 2024
    - 42.1K bytes
    - Viewed (0)
  2. src/archive/zip/reader_test.go

    		t.Errorf("%v: OpenRaw error=%v", f.Name, err)
    		return
    	}
    	start, err := f.DataOffset()
    	if err != nil {
    		t.Errorf("%v: DataOffset error=%v", f.Name, err)
    		return
    	}
    	got, err := io.ReadAll(rw)
    	if err != nil {
    		t.Errorf("%v: OpenRaw ReadAll error=%v", f.Name, err)
    		return
    	}
    	end := uint64(start) + f.CompressedSize64
    	want := raw[start:end]
    	if !bytes.Equal(got, want) {
    		t.Logf("got %q", got)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Mar 27 18:23:49 GMT 2024
    - 55.3K bytes
    - Viewed (0)
  3. src/bytes/buffer_test.go

    	b := []byte{0, 1, 2, 3, 4}
    	tmp := make([]byte, 5)
    	for i := 0; i <= 5; i++ {
    		for j := i; j <= 5; j++ {
    			for k := 0; k <= 6; k++ {
    				// 0 <= i <= j <= 5; 0 <= k <= 6
    				// Check that if we start with a buffer
    				// of length j at offset i and ask for
    				// Next(k), we get the right bytes.
    				buf := NewBuffer(b[0:j])
    				n, _ := buf.Read(tmp[0:i])
    				if n != i {
    					t.Fatalf("Read %d returned %d", i, n)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Apr 26 13:31:36 GMT 2024
    - 18.6K bytes
    - Viewed (0)
  4. doc/go1.17_spec.html

    </p>
    
    <ol>
    <li>
    <i>Line comments</i> start with the character sequence <code>//</code>
    and stop at the end of the line.
    </li>
    <li>
    <i>General comments</i> start with the character sequence <code>/*</code>
    and stop with the first subsequent character sequence <code>*/</code>.
    </li>
    </ol>
    
    <p>
    A comment cannot start inside a <a href="#Rune_literals">rune</a> or
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Thu Apr 11 20:22:45 GMT 2024
    - 211.6K bytes
    - Viewed (0)
  5. doc/asm.html

    (The prototype will also let <code>go</code> <code>vet</code> check the argument references.)
    At the start of the function, the arguments are assumed
    to be initialized but the results are assumed uninitialized.
    If the results will hold live pointers during a call instruction,
    the function should start by zeroing the results and then
    executing the pseudo-instruction <code>GO_RESULTS_INITIALIZED</code>.
    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)
  6. src/bytes/bytes.go

    	// more efficient, possibly due to cache effects.
    	start := -1 // valid span start if >= 0
    	for i := 0; i < len(s); {
    		size := 1
    		r := rune(s[i])
    		if r >= utf8.RuneSelf {
    			r, size = utf8.DecodeRune(s[i:])
    		}
    		if f(r) {
    			if start >= 0 {
    				spans = append(spans, span{start, i})
    				start = -1
    			}
    		} else {
    			if start < 0 {
    				start = i
    			}
    		}
    		i += size
    	}
    
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Feb 19 19:51:15 GMT 2024
    - 33.8K bytes
    - Viewed (0)
  7. src/bytes/bytes_test.go

    func TestIndexByteBig(t *testing.T) {
    	var n = 1024
    	if testing.Short() {
    		n = 128
    	}
    	b := make([]byte, n)
    	for i := 0; i < n; i++ {
    		// different start alignments
    		b1 := b[i:]
    		for j := 0; j < len(b1); j++ {
    			b1[j] = 'x'
    			pos := IndexByte(b1, 'x')
    			if pos != j {
    				t.Errorf("IndexByte(%q, 'x') = %v", b1, pos)
    			}
    			b1[j] = 0
    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)
  8. src/archive/zip/zip_test.go

    		add := len(p)
    		if add > space {
    			add = space
    		}
    		ss.buf = append(ss.buf, p[:add]...)
    		p = p[add:]
    	}
    	for len(p) > 0 {
    		n := copy(ss.buf[ss.start:], p)
    		p = p[n:]
    		ss.start += n
    		if ss.start == ss.keep {
    			ss.start = 0
    		}
    	}
    	return
    }
    
    // generatesZip64 reports whether f wrote a zip64 file.
    // f is also responsible for closing w.
    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)
  9. doc/README.md

    	[#12345](/issue/12345)             # GitHub issues
    	[CL 6789](/cl/6789)                # Gerrit changelists
    
    ## For the release team
    
    At the start of a release development cycle, the contents of `next` should be deleted
    and replaced with those of `initial`. From the repo root:
    
        > cd doc
        > rm -r next/*
        > cp -r initial/* next
    
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Fri Apr 26 21:24:36 GMT 2024
    - 1.9K bytes
    - Viewed (0)
  10. src/cmd/asm/internal/asm/parse.go

    	for _, op := range operands {
    		p.start(op)
    		if name, abi, ok := p.funcAddress(); ok {
    			fmt.Fprintf(w, "ref %s %s\n", name, abi)
    		}
    	}
    }
    
    func (p *Parser) start(operand []lex.Token) {
    	p.input = operand
    	p.inputPos = 0
    }
    
    // address parses the operand into a link address structure.
    func (p *Parser) address(operand []lex.Token) obj.Addr {
    	p.start(operand)
    	addr := obj.Addr{}
    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)
Back to top