Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 722 for rounds (0.14 sec)

  1. test/fixedbugs/issue30116.out

                  slice[-9876543210:9876543210] runtime error: slice bounds out of range [:9876543210] with capacity 3
                          slice[-1:-9876543210] runtime error: slice bounds out of range [:-9876543210]
                                   slice[-1:-1] runtime error: slice bounds out of range [:-1]
                                    slice[-1:0] runtime error: slice bounds out of range [-1:]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 18 17:33:38 UTC 2019
    - 53.8K bytes
    - Viewed (0)
  2. test/fixedbugs/issue30116u.out

                                                                slice[4:0] runtime error: slice bounds out of range [4:0]
                                                                slice[4:3] runtime error: slice bounds out of range [4:3]
                                                                slice[4:4] runtime error: slice bounds out of range [:4] with capacity 3
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 18 17:33:38 UTC 2019
    - 44K bytes
    - Viewed (0)
  3. doc/go_spec.html

    (or even be just another bound type parameter).
    In a process of repeated simplification, the bound type parameters in each type
    argument are substituted with the respective type arguments for those type
    parameters until each type argument is free of bound type parameters.
    </p>
    
    <p>
    If type arguments contain cyclic references to themselves
    through bound type parameters, simplification and thus type
    inference fails.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 04 21:07:21 UTC 2024
    - 281.5K bytes
    - Viewed (0)
  4. src/image/decode_example_test.go

    	m, _, err := image.Decode(reader)
    	if err != nil {
    		log.Fatal(err)
    	}
    	bounds := m.Bounds()
    
    	// Calculate a 16-bin histogram for m's red, green, blue and alpha components.
    	//
    	// An image's bounds do not necessarily start at (0, 0), so the two loops start
    	// at bounds.Min.Y and bounds.Min.X. Looping over Y first and X second is more
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 29 03:16:17 UTC 2018
    - 7.5K bytes
    - Viewed (0)
  5. src/vendor/golang.org/x/net/lif/binary.go

    	_ = b[1] // bounds check hint to compiler; see golang.org/issue/14808
    	return uint16(b[0]) | uint16(b[1])<<8
    }
    
    func (binaryLittleEndian) PutUint16(b []byte, v uint16) {
    	_ = b[1] // early bounds check to guarantee safety of writes below
    	b[0] = byte(v)
    	b[1] = byte(v >> 8)
    }
    
    func (binaryLittleEndian) Uint32(b []byte) uint32 {
    	_ = b[3] // bounds check hint to compiler; see golang.org/issue/14808
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:33 UTC 2023
    - 3.3K bytes
    - Viewed (0)
  6. src/runtime/panic32.go

    func goPanicExtendSliceAlen(hi int, lo uint, y int) {
    	panicCheck1(getcallerpc(), "slice bounds out of range")
    	panic(boundsError{x: int64(hi)<<32 + int64(lo), signed: true, y: y, code: boundsSliceAlen})
    }
    func goPanicExtendSliceAlenU(hi uint, lo uint, y int) {
    	panicCheck1(getcallerpc(), "slice bounds out of range")
    	panic(boundsError{x: int64(hi)<<32 + int64(lo), signed: false, y: y, code: boundsSliceAlen})
    }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 28 18:17:57 UTC 2021
    - 4.8K bytes
    - Viewed (0)
  7. src/vendor/golang.org/x/net/route/binary.go

    	_ = b[1] // bounds check hint to compiler; see golang.org/issue/14808
    	return uint16(b[0]) | uint16(b[1])<<8
    }
    
    func (binaryLittleEndian) PutUint16(b []byte, v uint16) {
    	_ = b[1] // early bounds check to guarantee safety of writes below
    	b[0] = byte(v)
    	b[1] = byte(v >> 8)
    }
    
    func (binaryLittleEndian) Uint32(b []byte) uint32 {
    	_ = b[3] // bounds check hint to compiler; see golang.org/issue/14808
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:33 UTC 2023
    - 2.7K bytes
    - Viewed (0)
  8. src/cmd/cgo/gcc.go

    	}
    	args, err := quoted.Split(value)
    	if err != nil {
    		return nil, err
    	}
    	if len(args) == 0 {
    		return nil, errors.New("CC not set and no default found")
    	}
    	if _, err := exec.LookPath(args[0]); err != nil {
    		return nil, fmt.Errorf("C compiler %q not found: %v", args[0], err)
    	}
    	return args[:len(args):len(args)], nil
    }
    
    // gccMachine returns the gcc -m flag to use, either "-m32", "-m64" or "-marm".
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 20 15:50:06 UTC 2024
    - 97K bytes
    - Viewed (0)
  9. test/slice3err.go

    	_ = str[i:1]
    	_ = str[1:j]
    
    	// check out of bounds indices on array
    	_ = array[11:11] // ERROR "out of bounds"
    	_ = array[11:12] // ERROR "out of bounds"
    	_ = array[11:] // ERROR "out of bounds"
    	_ = array[:11] // ERROR "out of bounds"
    	_ = array[1:11] // ERROR "out of bounds"
    	_ = array[1:11:12] // ERROR "out of bounds"
    	_ = array[1:2:11] // ERROR "out of bounds"
    	_ = array[1:11:3] // ERROR "out of bounds|invalid slice index"
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Dec 14 21:28:48 UTC 2020
    - 5.2K bytes
    - Viewed (0)
  10. src/internal/types/testdata/check/expr3.go

    	_ = a1
    
    	_ = a[9]
    	_ = a[10 /* ERRORx `index .* out of bounds` */ ]
    	_ = a[1 /* ERROR "overflows" */ <<100]
    	_ = a[1<< /* ERROR "constant shift overflow" */ 1000] // no out-of-bounds follow-on error
    	_ = a[10:]
    	_ = a[:10]
    	_ = a[10:10]
    	_ = a[11 /* ERRORx `index .* out of bounds` */ :]
    	_ = a[: 11 /* ERRORx `index .* out of bounds` */ ]
    	_ = a[: 1 /* ERROR "overflows" */ <<100]
    	_ = a[:10:10]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 16 22:41:49 UTC 2023
    - 15.6K bytes
    - Viewed (0)
Back to top