Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 34 for WORD (0.01 seconds)

  1. src/cmd/asm/internal/arch/arch.go

    	case "s390x":
    		return archS390x()
    	case "wasm":
    		return archWasm()
    	}
    	return nil
    }
    
    func jumpX86(word string) bool {
    	return word[0] == 'J' || word == "CALL" || strings.HasPrefix(word, "LOOP") || word == "XBEGIN"
    }
    
    func jumpRISCV(word string) bool {
    	switch word {
    	case "BEQ", "BEQZ", "BGE", "BGEU", "BGEZ", "BGT", "BGTU", "BGTZ", "BLE", "BLEU", "BLEZ",
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Nov 13 12:17:37 GMT 2025
    - 21.7K bytes
    - Click Count (0)
  2. impl/maven-core/src/main/java/org/apache/maven/internal/MultilineMessageHelper.java

            result.add(sb.toString());
            // lines
            for (String line : lines) {
                sb.setLength(0);
                String[] words = S_FILTER.split(line);
                for (String word : words) {
                    if (sb.length() >= remainder - word.length() - (!sb.isEmpty() ? 1 : 0)) {
                        repeat(sb, ' ', remainder - sb.length());
                        result.add(BOX_CHAR + " " + sb + " " + BOX_CHAR);
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 17:27:08 GMT 2025
    - 2.8K bytes
    - Click Count (0)
  3. src/cmd/asm/internal/arch/loong64.go

    // with the core of the assembler.
    
    package arch
    
    import (
    	"cmd/internal/obj"
    	"cmd/internal/obj/loong64"
    	"errors"
    	"fmt"
    )
    
    func jumpLoong64(word string) bool {
    	switch word {
    	case "BEQ", "BFPF", "BFPT", "BLTZ", "BGEZ", "BLEZ", "BGTZ", "BLT", "BLTU", "JIRL", "BNE", "BGE", "BGEU", "JMP", "JAL", "CALL":
    		return true
    	}
    	return false
    }
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Aug 05 17:31:25 GMT 2025
    - 3.8K bytes
    - Click Count (0)
  4. 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
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Nov 12 03:59:40 GMT 2025
    - 37.3K bytes
    - Click Count (0)
  5. src/bytes/example_test.go

    	text := []byte("The quick brown fox")
    	fmt.Println("Split byte slice into fields:")
    	for word := range bytes.FieldsSeq(text) {
    		fmt.Printf("%q\n", word)
    	}
    
    	textWithSpaces := []byte("  lots   of   spaces  ")
    	fmt.Println("\nSplit byte slice with multiple spaces:")
    	for word := range bytes.FieldsSeq(textWithSpaces) {
    		fmt.Printf("%q\n", word)
    	}
    
    	// Output:
    	// Split byte slice into fields:
    	// "The"
    	// "quick"
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon May 12 16:07:54 GMT 2025
    - 16.5K bytes
    - Click Count (0)
  6. src/cmd/asm/internal/arch/arm64.go

    	"TBNZ":  true,
    	"TBZ":   true,
    
    	// ADR isn't really a jump, but it takes a PC or label reference,
    	// which needs to patched like a jump.
    	"ADR":  true,
    	"ADRP": true,
    }
    
    func jumpArm64(word string) bool {
    	return arm64Jump[word]
    }
    
    var arm64SpecialOperand map[string]arm64.SpecialOperand
    
    // ARM64SpecialOperand returns the internal representation of a special operand.
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Oct 16 00:35:29 GMT 2025
    - 6.3K bytes
    - Click Count (0)
  7. docs/de/llm-prompt.md

    * «/// check»: «/// check | Testen»
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Fri Dec 26 09:39:53 GMT 2025
    - 11.9K bytes
    - Click Count (0)
  8. 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
    	}
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed May 21 18:05:26 GMT 2025
    - 14.2K bytes
    - Click Count (0)
  9. docs/bigdata/README.md

    file: org.apache.spark.rdd.RDD[String] = s3a://testbucket/testdata MapPartitionsRDD[1] at textFile at <console>:24
    
    scala> val counts = file.flatMap(line => line.split(" ")).map(word => (word, 1)).reduceByKey(_ + _)
    counts: org.apache.spark.rdd.RDD[(String, Int)] = ShuffledRDD[4] at reduceByKey at <console>:25
    
    scala> counts.saveAsTextFile("s3a://testbucket/wordcount")
    ```
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 14.7K bytes
    - Click Count (0)
  10. doc/go_mem.html

    </p>
    
    <p>
    Reads of memory locations larger than a single machine word
    are encouraged but not required to meet the same semantics
    as word-sized memory locations,
    observing a single allowed write <i>w</i>.
    For performance reasons,
    implementations may instead treat larger operations
    as a set of individual machine-word-sized operations
    in an unspecified order.
    This means that races on multiword data structures
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Aug 05 15:41:37 GMT 2025
    - 26.6K bytes
    - Click Count (0)
Back to Top