Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 69 for Kappen (0.14 sec)

  1. src/bytes/bytes_test.go

    				b.Fatal("bad equal")
    			}
    		}
    		buf1[n-1] = '\x00'
    		buf2[n-1] = '\x00'
    	}
    }
    
    func BenchmarkEqualBothUnaligned(b *testing.B) {
    	sizes := []int{64, 4 << 10}
    	if !isRaceBuilder {
    		sizes = append(sizes, []int{4 << 20, 64 << 20}...)
    	}
    	maxSize := 2 * (sizes[len(sizes)-1] + 8)
    	if len(bmbuf) < maxSize {
    		bmbuf = make([]byte, maxSize)
    	}
    
    	for _, n := range sizes {
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Jan 24 16:07:25 GMT 2024
    - 56.2K bytes
    - Viewed (0)
  2. src/bytes/example_test.go

    	// Output: hello world
    }
    
    func ExampleBuffer_AvailableBuffer() {
    	var buf bytes.Buffer
    	for i := 0; i < 4; i++ {
    		b := buf.AvailableBuffer()
    		b = strconv.AppendInt(b, int64(i), 10)
    		b = append(b, ' ')
    		buf.Write(b)
    	}
    	os.Stdout.Write(buf.Bytes())
    	// Output: 0 1 2 3
    }
    
    func ExampleBuffer_Cap() {
    	buf1 := bytes.NewBuffer(make([]byte, 10))
    	buf2 := bytes.NewBuffer(make([]byte, 0, 10))
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Mar 04 15:54:40 GMT 2024
    - 15K bytes
    - Viewed (1)
  3. src/archive/tar/format.go

    }
    
    func (f Format) String() string {
    	var ss []string
    	for f2 := Format(1); f2 < formatMax; f2 <<= 1 {
    		if f.has(f2) {
    			ss = append(ss, formatNames[f2])
    		}
    	}
    	switch len(ss) {
    	case 0:
    		return "<unknown>"
    	case 1:
    		return ss[0]
    	default:
    		return "(" + strings.Join(ss, " | ") + ")"
    	}
    }
    
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Oct 13 18:36:46 GMT 2023
    - 11.3K bytes
    - Viewed (0)
  4. src/archive/zip/struct.go

    	//
    	// By specification, the only other encoding permitted should be CP-437,
    	// but historically many ZIP readers interpret Name and Comment as whatever
    	// the system's local character encoding happens to be.
    	//
    	// This flag should only be set if the user intends to encode a non-portable
    	// ZIP file for a specific localized region. Otherwise, the Writer
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Oct 13 18:36:46 GMT 2023
    - 12.1K bytes
    - Viewed (0)
  5. doc/asm.html

    that follow form the body of the function.
    The last instruction in a <code>TEXT</code> block must be some sort of jump, usually a <code>RET</code> (pseudo-)instruction.
    (If it's not, the linker will append a jump-to-itself instruction; there is no fallthrough in <code>TEXTs</code>.)
    After the symbol, the arguments are flags (see below)
    and the frame size, a constant (but see below):
    </p>
    
    <pre>
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Tue Nov 28 19:15:27 GMT 2023
    - 36.3K bytes
    - Viewed (0)
  6. api/go1.20.txt

    pkg math/bits (freebsd-riscv64), const UintSize = 64 #53466
    pkg math/bits (freebsd-riscv64-cgo), const UintSize = 64 #53466
    pkg os (freebsd-riscv64), const DevNull = "/dev/null" #53466
    pkg os (freebsd-riscv64), const O_APPEND = 8 #53466
    pkg os (freebsd-riscv64), const O_CREATE = 512 #53466
    pkg os (freebsd-riscv64), const O_EXCL = 2048 #53466
    pkg os (freebsd-riscv64), const O_SYNC = 128 #53466
    pkg os (freebsd-riscv64), const O_TRUNC = 1024 #53466
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Fri Feb 17 21:23:32 GMT 2023
    - 602.6K bytes
    - Viewed (0)
  7. src/bytes/bytes.go

    		c := s[i]
    		if c < utf8.RuneSelf {
    			i++
    			invalid = false
    			b = append(b, c)
    			continue
    		}
    		_, wid := utf8.DecodeRune(s[i:])
    		if wid == 1 {
    			i++
    			if !invalid {
    				invalid = true
    				b = append(b, replacement...)
    			}
    			continue
    		}
    		invalid = false
    		b = append(b, s[i:i+wid]...)
    		i += wid
    	}
    	return b
    }
    
    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)
  8. src/cmd/asm/internal/lex/input.go

    	var tokens []Token
    	for _, tok := range macro.tokens {
    		if tok.ScanToken != scanner.Ident {
    			tokens = append(tokens, tok)
    			continue
    		}
    		substitution := actuals[tok.text]
    		if substitution == nil {
    			tokens = append(tokens, tok)
    			continue
    		}
    		tokens = append(tokens, substitution...)
    	}
    	in.Push(NewSlice(in.Base(), in.Line(), tokens))
    }
    
    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)
  9. src/archive/tar/writer.go

    				spb = append(strconv.AppendInt(spb, s.Offset, 10), '\n')
    				spb = append(strconv.AppendInt(spb, s.Length, 10), '\n')
    			}
    			pad := blockPadding(int64(len(spb)))
    			spb = append(spb, zeroBlock[:pad]...)
    			hdr.Size += int64(len(spb)) // Accounts for encoded sparse map
    
    			// Add and modify appropriate PAX records.
    			dir, file := path.Split(realName)
    			hdr.Name = path.Join(dir, "GNUSparseFile.0", file)
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Oct 13 18:36:46 GMT 2023
    - 19.6K bytes
    - Viewed (0)
  10. src/cmd/asm/internal/asm/parse.go

    				}
    				break
    			}
    			if tok == '(' || tok == '[' {
    				nesting++
    			}
    			if tok == ')' || tok == ']' {
    				nesting--
    			}
    			items = append(items, lex.Make(tok, p.lex.Text()))
    		}
    		if len(items) > 0 {
    			operands = append(operands, items)
    			if colon >= 0 && len(operands) == colon+2 {
    				// AX:DX becomes DX, AX.
    				operands[colon], operands[colon+1] = operands[colon+1], operands[colon]
    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)
Back to top