Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 228 for uint (0.04 sec)

  1. api/go1.23.txt

    pkg maps, func Values[$0 interface{ ~map[$1]$2 }, $1 comparable, $2 interface{}]($0) iter.Seq[$2] #61900
    pkg math/rand/v2, func Uint() uint #61716
    pkg math/rand/v2, method (*ChaCha8) Read([]uint8) (int, error) #67059
    pkg math/rand/v2, method (*Rand) Uint() uint #61716
    pkg net, method (*DNSError) Unwrap() error #63116
    pkg net, method (*TCPConn) SetKeepAliveConfig(KeepAliveConfig) error #62254
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Jun 25 17:08:08 UTC 2024
    - 10.1K bytes
    - Viewed (0)
  2. api/go1.22.txt

    pkg encoding/base32, method (*Encoding) AppendDecode([]uint8, []uint8) ([]uint8, error) #53693
    pkg encoding/base32, method (*Encoding) AppendEncode([]uint8, []uint8) []uint8 #53693
    pkg encoding/base64, method (*Encoding) AppendDecode([]uint8, []uint8) ([]uint8, error) #53693
    pkg encoding/base64, method (*Encoding) AppendEncode([]uint8, []uint8) []uint8 #53693
    pkg encoding/hex, func AppendDecode([]uint8, []uint8) ([]uint8, error) #53693
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 24 20:54:27 UTC 2024
    - 7.7K bytes
    - Viewed (0)
  3. src/builtin/builtin.go

    // not nil. Values of string type are immutable.
    type string string
    
    // int is a signed integer type that is at least 32 bits in size. It is a
    // distinct type, however, and not an alias for, say, int32.
    type int int
    
    // uint is an unsigned integer type that is at least 32 bits in size. It is a
    // distinct type, however, and not an alias for, say, uint32.
    type uint uint
    
    // uintptr is an integer type that is large enough to hold the bit pattern of
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Dec 30 23:59:23 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  4. lib/fips140/v1.0.0.zip

    var t0, t1, t2, t3 uint32 for r := 0; r < c.rounds-1; r++ { t0 = xk[k+0] ^ te0[uint8(s0>>24)] ^ te1[uint8(s1>>16)] ^ te2[uint8(s2>>8)] ^ te3[uint8(s3)] t1 = xk[k+1] ^ te0[uint8(s1>>24)] ^ te1[uint8(s2>>16)] ^ te2[uint8(s3>>8)] ^ te3[uint8(s0)] t2 = xk[k+2] ^ te0[uint8(s2>>24)] ^ te1[uint8(s3>>16)] ^ te2[uint8(s0>>8)] ^ te3[uint8(s1)] t3 = xk[k+3] ^ te0[uint8(s3>>24)] ^ te1[uint8(s0>>16)] ^ te2[uint8(s1>>8)] ^ te3[uint8(s2)] k += 4 s0, s1, s2, s3 = t0, t1, t2, t3 } // Last round uses s-box directly...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
  5. src/cmd/asm/internal/lex/input.go

    	tok = in.Stack.Next()
    	if tok != '\n' {
    		in.Error("unexpected token at end of #line: ", tok)
    	}
    	pos := src.MakePos(in.Base(), uint(in.Line())+1, 1) // +1 because #line nnn means line nnn starts on next line
    	in.Stack.SetBase(src.NewLinePragmaBase(pos, file, objabi.AbsFile(objabi.WorkingDir(), file, *flags.TrimPath), uint(line), 1))
    }
    
    // #undef processing
    func (in *Input) undef() {
    	name := in.macroName()
    	if in.macros[name] == nil {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Sep 06 13:17:27 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  6. src/bytes/bytes.go

    // overflows.
    func Repeat(b []byte, count int) []byte {
    	if count == 0 {
    		return []byte{}
    	}
    
    	// Since we cannot return an error on overflow,
    	// we should panic if the repeat will generate an overflow.
    	// See golang.org/issue/16237.
    	if count < 0 {
    		panic("bytes: negative Repeat count")
    	}
    	hi, lo := bits.Mul(uint(len(b)), uint(count))
    	if hi > 0 || lo > uint(maxInt) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  7. src/archive/tar/strconv.go

    // that the first byte can only be either 0x80 or 0xff. Thus, the first byte is
    // equivalent to the sign bit in two's complement form.
    func fitsInBase256(n int, x int64) bool {
    	binBits := uint(n-1) * 8
    	return n >= 9 || (x >= -1<<binBits && x < 1<<binBits)
    }
    
    // parseNumeric parses the input as being encoded in either base-256 or octal.
    // This function may return negative numbers.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Sep 08 17:08:20 UTC 2025
    - 9.1K bytes
    - Viewed (0)
  8. src/bufio/scan.go

    	maxTokenSize int       // Maximum size of a token; modified by tests.
    	token        []byte    // Last token returned by split.
    	buf          []byte    // Buffer used as argument to split.
    	start        int       // First non-processed byte in buf.
    	end          int       // End of data in buf.
    	err          error     // Sticky error.
    	empties      int       // Count of successive empty tokens.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed May 21 18:05:26 UTC 2025
    - 14.2K bytes
    - Viewed (0)
  9. src/bytes/buffer.go

    func (b *Buffer) tryGrowByReslice(n int) (int, bool) {
    	if l := len(b.buf); n <= cap(b.buf)-l {
    		b.buf = b.buf[:l+n]
    		return l, true
    	}
    	return 0, false
    }
    
    // grow grows the buffer to guarantee space for n more bytes.
    // It returns the index where bytes should be written.
    // If the buffer can't grow it will panic with ErrTooLarge.
    func (b *Buffer) grow(n int) int {
    	m := b.Len()
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 17:38:56 UTC 2025
    - 16K bytes
    - Viewed (0)
  10. src/bytes/buffer_test.go

    	defer func() {
    		if err := recover(); err != ErrTooLarge {
    			t.Errorf("after too-large Grow, recover() = %v; want %v", err, ErrTooLarge)
    		}
    	}()
    
    	buf := NewBuffer(make([]byte, 1))
    	const maxInt = int(^uint(0) >> 1)
    	buf.Grow(maxInt)
    }
    
    // Was a bug: used to give EOF reading empty slice at EOF.
    func TestReadEmptyAtEOF(t *testing.T) {
    	b := new(Buffer)
    	slice := make([]byte, 0)
    	n, err := b.Read(slice)
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 16:13:04 UTC 2025
    - 18.6K bytes
    - Viewed (0)
Back to top