Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for Ford (0.15 sec)

  1. src/bufio/scan.go

    		if !isSpace(r) {
    			break
    		}
    	}
    	// Scan until space, marking end of word.
    	for width, i := 0, start; i < len(data); i += width {
    		var r rune
    		r, width = utf8.DecodeRune(data[i:])
    		if isSpace(r) {
    			return i + width, data[start:i], nil
    		}
    	}
    	// If we're at EOF, we have a final, non-empty, non-terminated word. Return it.
    	if atEOF && len(data) > start {
    		return len(data), data[start:], nil
    	}
    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)
  2. src/bufio/example_test.go

    	}
    	if err := scanner.Err(); err != nil {
    		fmt.Fprintln(os.Stderr, "shouldn't see an error scanning a string")
    	}
    	// Output:
    	// true
    }
    
    // Use a Scanner to implement a simple word-count utility by scanning the
    // input as a sequence of space-delimited tokens.
    func ExampleScanner_words() {
    	// An artificial input source.
    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)
  3. src/cmd/asm/internal/asm/parse.go

    	scratch := make([][]lex.Token, 0, 3)
    	for {
    		word, cond, operands, ok := p.line(scratch)
    		if !ok {
    			break
    		}
    		scratch = operands
    
    		if p.pseudo(word, operands) {
    			continue
    		}
    		i, present := p.arch.Instructions[word]
    		if present {
    			p.instruction(i, word, cond, operands)
    			continue
    		}
    		p.errorf("unrecognized instruction %q", word)
    	}
    	if p.errorCount > 0 {
    		return nil, false
    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)
  4. src/bytes/bytes.go

    // asciiSet is a 32-byte value, where each bit represents the presence of a
    // given ASCII character in the set. The 128-bits of the lower 16 bytes,
    // starting with the least-significant bit of the lowest word to the
    // most-significant bit of the highest word, map to the full range of all
    // 128 ASCII characters. The 128-bits of the upper 16 bytes will be zeroed,
    // ensuring that any non-ASCII character will be reported as not in the set.
    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. src/cmd/asm/internal/lex/input.go

    func (in *Input) Text() string {
    	return in.text
    }
    
    // hash processes a # preprocessor directive. It reports whether it completes.
    func (in *Input) hash() bool {
    	// We have a '#'; it must be followed by a known word (define, include, etc.).
    	tok := in.Stack.Next()
    	if tok != scanner.Ident {
    		in.expectText("expected identifier after '#'")
    	}
    	if !in.enabled() {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Tue Aug 29 07:48:38 GMT 2023
    - 12.6K bytes
    - Viewed (0)
  6. src/bufio/scan_test.go

    }
    
    func TestScanWordsExcessiveWhiteSpace(t *testing.T) {
    	const word = "ipsum"
    	s := strings.Repeat(" ", 4*smallMaxTokenSize) + word
    	scanner := NewScanner(strings.NewReader(s))
    	scanner.MaxTokenSize(smallMaxTokenSize)
    	scanner.Split(ScanWords)
    	if !scanner.Scan() {
    		t.Fatalf("scan failed: %v", scanner.Err())
    	}
    	if token := scanner.Text(); token != word {
    		t.Fatalf("unexpected token: %v", token)
    	}
    }
    
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Sep 22 16:22:42 GMT 2023
    - 14.3K bytes
    - Viewed (0)
Back to top