Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for decodeFunc (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/bytes/iter.go

    // bytes of sep to include in the results (none or all).
    func splitSeq(s, sep []byte, sepSave int) iter.Seq[[]byte] {
    	return func(yield func([]byte) bool) {
    		if len(sep) == 0 {
    			for len(s) > 0 {
    				_, size := utf8.DecodeRune(s)
    				if !yield(s[:size:size]) {
    					return
    				}
    				s = s[size:]
    			}
    			return
    		}
    		for {
    			i := Index(s, sep)
    			if i < 0 {
    				break
    			}
    			frag := s[:i+sepSave]
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Sep 03 14:04:47 GMT 2025
    - 3.6K bytes
    - Click Count (0)
  2. src/bytes/bytes.go

    	return len(s) == len(t)
    
    hasUnicode:
    	s = s[i:]
    	t = t[i:]
    	for len(s) != 0 && len(t) != 0 {
    		// Extract first rune from each.
    		sr, size := utf8.DecodeRune(s)
    		s = s[size:]
    		tr, size := utf8.DecodeRune(t)
    		t = t[size:]
    
    		// If they match, keep going; if not, return false.
    
    		// Easy case.
    		if tr == sr {
    			continue
    		}
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Sep 16 16:42:15 GMT 2025
    - 35.5K bytes
    - Click Count (0)
  3. internal/s3select/jstream/decoder.go

    		d.scratch.addRune(r)
    		goto scan_esc
    	}
    
    	r2 := d.u4()
    	if r2 < 0 {
    		return "", d.mkError(ErrSyntax, "in unicode escape sequence")
    	}
    
    	// write surrogate pair
    	d.scratch.addRune(utf16.DecodeRune(r, r2))
    	c = d.next()
    	goto scan
    }
    
    // u4 reads four bytes following a \u escape
    func (d *Decoder) u4() rune {
    	// logic taken from:
    	// github.com/buger/jsonparser/blob/master/escape.go#L20
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 13.4K bytes
    - Click Count (0)
Back to Top