Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 25 for Rune (0.02 sec)

  1. src/bytes/bytes.go

    	return IndexAny(b, chars) >= 0
    }
    
    // ContainsRune reports whether the rune is contained in the UTF-8-encoded byte slice b.
    func ContainsRune(b []byte, r rune) bool {
    	return IndexRune(b, r) >= 0
    }
    
    // ContainsFunc reports whether any of the UTF-8-encoded code points r within b satisfy f(r).
    func ContainsFunc(b []byte, f func(rune) bool) bool {
    	return IndexFunc(b, f) >= 0
    }
    
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  2. src/bytes/bytes_test.go

    	}
    }
    
    func bmIndexRuneUnicode(rt *unicode.RangeTable, needle rune) func(b *testing.B, n int) {
    	var rs []rune
    	for _, r16 := range rt.R16 {
    		for r := rune(r16.Lo); r <= rune(r16.Hi); r += rune(r16.Stride) {
    			if r != needle {
    				rs = append(rs, r)
    			}
    		}
    	}
    	for _, r32 := range rt.R32 {
    		for r := rune(r32.Lo); r <= rune(r32.Hi); r += rune(r32.Stride) {
    			if r != needle {
    				rs = append(rs, r)
    			}
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jul 28 18:13:58 UTC 2025
    - 62.9K bytes
    - Viewed (0)
  3. src/bytes/iter.go

    // but without constructing a new slice containing the subslices.
    func FieldsSeq(s []byte) iter.Seq[[]byte] {
    	return func(yield func([]byte) bool) {
    		start := -1
    		for i := 0; i < len(s); {
    			size := 1
    			r := rune(s[i])
    			isSpace := asciiSpace[s[i]] != 0
    			if r >= utf8.RuneSelf {
    				r, size = utf8.DecodeRune(s[i:])
    				isSpace = unicode.IsSpace(r)
    			}
    			if isSpace {
    				if start >= 0 {
    					if !yield(s[start:i:i]) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 3.6K bytes
    - Viewed (0)
  4. src/bytes/buffer.go

    // converted to int they correspond to the rune size that was read.
    type readOp int8
    
    // Don't use iota for these, as the values need to correspond with the
    // names and comments, which is easier to see when being explicit.
    const (
    	opRead      readOp = -1 // Any other read operation.
    	opInvalid   readOp = 0  // Non-read operation.
    	opReadRune1 readOp = 1  // Read rune of size 1.
    	opReadRune2 readOp = 2  // Read rune of size 2.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 17:38:56 UTC 2025
    - 16K bytes
    - Viewed (0)
  5. src/bufio/scan.go

    	if width > 1 {
    		// It's a valid encoding. Width cannot be one for a correctly encoded
    		// non-ASCII rune.
    		return width, data[0:width], nil
    	}
    
    	// We know it's an error: we have width==1 and implicitly r==utf8.RuneError.
    	// Is the error because there wasn't a full rune to be decoded?
    	// FullRune distinguishes correctly between erroneous and incomplete encodings.
    	if !atEOF && !utf8.FullRune(data) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed May 21 18:05:26 UTC 2025
    - 14.2K bytes
    - Viewed (0)
  6. src/bytes/example_test.go

    	fmt.Println(bytes.LastIndexFunc([]byte("go gopher!"), unicode.IsNumber))
    	// Output:
    	// 8
    	// 9
    	// -1
    }
    
    func ExampleMap() {
    	rot13 := func(r rune) rune {
    		switch {
    		case r >= 'A' && r <= 'Z':
    			return 'A' + (r-'A'+13)%26
    		case r >= 'a' && r <= 'z':
    			return 'a' + (r-'a'+13)%26
    		}
    		return r
    	}
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 12 16:07:54 UTC 2025
    - 16.5K bytes
    - Viewed (0)
  7. cmd/api-headers_test.go

    import (
    	"testing"
    )
    
    func TestNewRequestID(t *testing.T) {
    	// Ensure that it returns an alphanumeric result of length 16.
    	id := mustGetRequestID(UTCNow())
    
    	if len(id) != 16 {
    		t.Fail()
    	}
    
    	var e rune
    	for _, char := range id {
    		e = char
    
    		// Ensure that it is alphanumeric, in this case, between 0-9 and A-Z.
    		isAlnum := ('0' <= e && e <= '9') || ('A' <= e && e <= 'Z')
    		if !isAlnum {
    			t.Fail()
    		}
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Mar 30 00:56:02 UTC 2025
    - 1.2K bytes
    - Viewed (0)
  8. src/bufio/bufio.go

    	b.lastRuneSize = -1
    	return nil
    }
    
    // ReadRune reads a single UTF-8 encoded Unicode character and returns the
    // rune and its size in bytes. If the encoded rune is invalid, it consumes one byte
    // and returns unicode.ReplacementChar (U+FFFD) with a size of 1.
    func (b *Reader) ReadRune() (r rune, size int, err error) {
    	for b.r+utf8.UTFMax > b.w && !utf8.FullRune(b.buf[b.r:b.w]) && b.err == nil && b.w-b.r < len(b.buf) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 22K bytes
    - Viewed (0)
  9. src/bytes/buffer_test.go

    	}
    }
    
    func TestRuneIO(t *testing.T) {
    	const NRune = 1000
    	// Built a test slice while we write the data
    	b := make([]byte, utf8.UTFMax*NRune)
    	var buf Buffer
    	n := 0
    	for r := rune(0); r < NRune; r++ {
    		size := utf8.EncodeRune(b[n:], r)
    		nbytes, err := buf.WriteRune(r)
    		if err != nil {
    			t.Fatalf("WriteRune(%U) error: %s", r, err)
    		}
    		if nbytes != size {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 16:13:04 UTC 2025
    - 18.6K bytes
    - Viewed (0)
  10. cmd/generic-handlers.go

    			i++
    		}
    
    		// Trim whitespace of segment
    		segmentStart, segmentEnd := start, i
    		for segmentStart < segmentEnd && unicode.IsSpace(rune(path[segmentStart])) {
    			segmentStart++
    		}
    		for segmentEnd > segmentStart && unicode.IsSpace(rune(path[segmentEnd-1])) {
    			segmentEnd--
    		}
    
    		// Check for ".." or "."
    		switch {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 20.7K bytes
    - Viewed (1)
Back to top