Search Options

Results per page
Sort
Preferred Languages
Advance

Results 191 - 200 of 576 for Int8 (0.05 sec)

  1. src/internal/fuzz/mutator.go

    	// Pick a random value to mutate.
    	// TODO: consider mutating more than one value at a time.
    	i := m.rand(len(vals))
    	switch v := vals[i].(type) {
    	case int:
    		vals[i] = int(m.mutateInt(int64(v), maxInt))
    	case int8:
    		vals[i] = int8(m.mutateInt(int64(v), math.MaxInt8))
    	case int16:
    		vals[i] = int16(m.mutateInt(int64(v), math.MaxInt16))
    	case int64:
    		vals[i] = m.mutateInt(v, maxInt)
    	case uint:
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Sep 18 20:01:34 UTC 2023
    - 6.6K bytes
    - Viewed (0)
  2. src/encoding/gob/encgen.go

    		"0",
    		`state.encodeInt(int64(x))`,
    	},
    	{
    		"int32",
    		"Int32",
    		"0",
    		`state.encodeInt(int64(x))`,
    	},
    	{
    		"int64",
    		"Int64",
    		"0",
    		`state.encodeInt(x)`,
    	},
    	{
    		"int8",
    		"Int8",
    		"0",
    		`state.encodeInt(int64(x))`,
    	},
    	{
    		"string",
    		"String",
    		`""`,
    		`state.encodeUint(uint64(len(x)))
    		state.b.WriteString(x)`,
    	},
    	{
    		"uint",
    		"Uint",
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Mar 22 16:39:09 UTC 2024
    - 3.8K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/test/float_test.go

    		t.Errorf("int64(di64) != i64")
    	}
    	if int32(di32) != i32 {
    		t.Errorf("int32(di32) != i32")
    	}
    	if int16(di16) != i16 {
    		t.Errorf("int16(di16) != i16")
    	}
    	if int8(di8) != i8 {
    		t.Errorf("int8(di8) != i8")
    	}
    	if uint64(su64) != u64 {
    		t.Errorf("uint64(su64) != u64")
    	}
    	if uint32(su32) != u32 {
    		t.Errorf("uint32(su32) != u32")
    	}
    	if uint16(su16) != u16 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 05 17:54:15 UTC 2022
    - 12.5K bytes
    - Viewed (0)
  4. src/cmd/vet/testdata/asm/asm1.s

    // license that can be found in the LICENSE file.
    
    //go:build amd64
    // +build amd64
    
    TEXT ·arg1(SB),0,$0-2
    	MOVW	x+0(FP), AX // ERROR "\[amd64\] arg1: invalid MOVW of x\+0\(FP\); int8 is 1-byte value"
    
    TEXT ·cpx(SB),0,$0-24
    	// These are ok
    	MOVSS	x_real+0(FP), X0
    	MOVSS	x_imag+4(FP), X0
    	MOVSD	y_real+8(FP), X0
    	MOVSD	y_imag+16(FP), X0
    	// Loading both parts of a complex is ok: see issue 35264.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Feb 20 03:54:48 UTC 2021
    - 883 bytes
    - Viewed (0)
  5. test/typeparam/issue51925.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package main
    
    import "fmt"
    
    type IntLike interface {
    	~int | ~int64 | ~int32 | ~int16 | ~int8
    }
    
    func Reduce[T any, U any, Uslice ~[]U](function func(T, U) T, sequence Uslice, initial T) T {
    	result := initial
    	for _, x := range sequence {
    		result = function(result, x)
    	}
    	return result
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Dec 14 17:22:18 UTC 2023
    - 963 bytes
    - Viewed (0)
  6. test/typeparam/absdiff2.go

    // structure with a single field that may be a list of possible basic types.
    
    package main
    
    import (
    	"fmt"
    	"math"
    )
    
    type Numeric interface {
    	~int | ~int8 | ~int16 | ~int32 | ~int64 |
    		~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64 | ~uintptr |
    		~float32 | ~float64 |
    		~complex64 | ~complex128
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Mar 09 21:26:42 UTC 2022
    - 3.6K bytes
    - Viewed (0)
  7. test/codegen/bitfield.go

    }
    
    func sbfx5(x int8) int64 {
    	return int64(x) >> 3 // arm64:"SBFX\t[$]3, R[0-9]+, [$]5",-"ASR"
    }
    
    func sbfx6(x int32) int64 {
    	return int64(x >> 30) // arm64:"SBFX\t[$]30, R[0-9]+, [$]2"
    }
    
    func sbfx7(x int16) int64 {
    	return int64(x >> 10) // arm64:"SBFX\t[$]10, R[0-9]+, [$]6"
    }
    
    func sbfx8(x int8) int64 {
    	return int64(x >> 5) // arm64:"SBFX\t[$]5, R[0-9]+, [$]3"
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Aug 23 06:11:32 UTC 2022
    - 9.6K bytes
    - Viewed (0)
  8. test/rename1.go

    	complex    = 4
    	complex64  = 5
    	complex128 = 6
    	cap        = 7
    	close      = 8
    	delete     = 9
    	error      = 10
    	false      = 11
    	float32    = 12
    	float64    = 13
    	imag       = 14
    	int        = 15
    	int8       = 16
    	int16      = 17
    	int32      = 18
    	int64      = 19
    	len        = 20
    	make       = 21
    	new        = 22
    	nil        = 23
    	panic      = 24
    	print      = 25
    	println    = 26
    	real       = 27
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Apr 19 14:07:00 UTC 2023
    - 1.1K bytes
    - Viewed (0)
  9. src/cmd/compile/internal/ssa/cse_test.go

    func TestCSEAuxPartitionBug(t *testing.T) {
    	c := testConfig(t)
    	arg1Aux := &tstAux{"arg1-aux"}
    	arg2Aux := &tstAux{"arg2-aux"}
    	arg3Aux := &tstAux{"arg3-aux"}
    	a := c.Temp(c.config.Types.Int8.PtrTo())
    
    	// construct lots of values with args that have aux values and place
    	// them in an order that triggers the bug
    	fun := c.Fun("entry",
    		Bloc("entry",
    			Valu("start", OpInitMem, types.TypeMem, 0, nil),
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 08 19:09:14 UTC 2023
    - 4.2K bytes
    - Viewed (0)
  10. src/cmd/compile/internal/test/switch_test.go

    }
    func benchmarkSwitchType(b *testing.B, predictable bool) {
    	a := []any{
    		int8(1),
    		int16(2),
    		int32(3),
    		int64(4),
    		uint8(5),
    		uint16(6),
    		uint32(7),
    		uint64(8),
    	}
    	n := 0
    	rng := newRNG()
    	for i := 0; i < b.N; i++ {
    		rng = rng.next(predictable)
    		switch a[rng.value()&7].(type) {
    		case int8:
    			n += 1
    		case int16:
    			n += 2
    		case int32:
    			n += 3
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Oct 06 15:42:30 UTC 2023
    - 4.2K bytes
    - Viewed (0)
Back to top