Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for Goldin (0.29 sec)

  1. src/bytes/buffer.go

    var ErrTooLarge = errors.New("bytes.Buffer: too large")
    var errNegativeRead = errors.New("bytes.Buffer: reader returned negative count from Read")
    
    const maxInt = int(^uint(0) >> 1)
    
    // Bytes returns a slice of length b.Len() holding the unread portion of the buffer.
    // The slice is valid for use only until the next buffer modification (that is,
    // only until the next call to a method like [Buffer.Read], [Buffer.Write], [Buffer.Reset], or [Buffer.Truncate]).
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Oct 13 17:10:31 GMT 2023
    - 15.7K bytes
    - Viewed (0)
  2. src/bufio/scan.go

    // by a subsequent call to Scan. It does no allocation.
    func (s *Scanner) Bytes() []byte {
    	return s.token
    }
    
    // Text returns the most recent token generated by a call to [Scanner.Scan]
    // as a newly allocated string holding its bytes.
    func (s *Scanner) Text() string {
    	return string(s.token)
    }
    
    // ErrFinalToken is a special sentinel error value. It is intended to be
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Oct 23 09:06:30 GMT 2023
    - 14.2K bytes
    - Viewed (0)
  3. src/builtin/builtin.go

    // new elements. If it does not, a new underlying array will be allocated.
    // Append returns the updated slice. It is therefore necessary to store the
    // result of append, often in the variable holding the slice itself:
    //
    //	slice = append(slice, elem1, elem2)
    //	slice = append(slice, anotherSlice...)
    //
    // As a special case, it is legal to append a string to a byte slice, like this:
    //
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Thu Apr 11 20:22:45 GMT 2024
    - 12.7K bytes
    - Viewed (0)
  4. src/bytes/bytes.go

    // for a k-rune slice.
    func ReplaceAll(s, old, new []byte) []byte {
    	return Replace(s, old, new, -1)
    }
    
    // EqualFold reports whether s and t, interpreted as UTF-8 strings,
    // are equal under simple Unicode case-folding, which is a more general
    // form of case-insensitivity.
    func EqualFold(s, t []byte) bool {
    	// ASCII fast path
    	i := 0
    	for ; i < len(s) && i < len(t); i++ {
    		sr := s[i]
    		tr := t[i]
    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)
  5. doc/go_mem.html

    in any order.
    Similarly, a write of an array, struct, or complex number
    may be implemented as a write of each individual sub-value,
    in any order.
    </p>
    
    <p>
    A read <i>r</i> of a memory location <i>x</i>
    holding a value
    that is not larger than a machine word must observe
    some write <i>w</i> such that <i>r</i> does not happen before <i>w</i>
    and there is no write <i>w'</i> such that <i>w</i> happens before <i>w'</i>
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Mon Mar 04 15:54:42 GMT 2024
    - 26.6K bytes
    - Viewed (0)
  6. src/cmd/asm/internal/asm/endtoend_test.go

    	"cmd/asm/internal/lex"
    	"cmd/internal/obj"
    )
    
    // An end-to-end test for the assembler: Do we print what we parse?
    // Output is generated by, in effect, turning on -S and comparing the
    // result against a golden file.
    
    func testEndToEnd(t *testing.T, goarch, file string) {
    	input := filepath.Join("testdata", file+".s")
    	architecture, ctxt := setArch(goarch)
    	architecture.Init(ctxt)
    	lexer := lex.NewLexer(input)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Thu Dec 07 18:42:59 GMT 2023
    - 11.6K bytes
    - Viewed (0)
Back to top