Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 31 for i0 (0.11 sec)

  1. src/internal/types/testdata/check/expr0.go

    	// int
    	i0 = 1
    	i1 int = i0
    	i2 = +1
    	i3 = +i0
    	i4 int = +1
    	i5 int = +i4
    	i6 = -1
    	i7 = -i0
    	i8 int = -1
    	i9 int = -i4
    	i10 = !i0 /* ERROR "not defined" */
    	i11 = ^1
    	i12 = ^i0
    	i13 int = ^1
    	i14 int = ^i4
    	i15 = *i0 /* ERROR "cannot indirect" */
    	i16 = &i0
    	i17 = *i16
    	i18 = <-i16 /* ERROR "cannot receive" */
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Oct 31 16:11:16 UTC 2023
    - 4.4K bytes
    - Viewed (0)
  2. src/image/draw/draw.go

    				colorIndex := uint8(dst0.Palette.Index(src0.C))
    				i0 := dst0.PixOffset(r.Min.X, r.Min.Y)
    				i1 := i0 + r.Dx()
    				for i := i0; i < i1; i++ {
    					dst0.Pix[i] = colorIndex
    				}
    				firstRow := dst0.Pix[i0:i1]
    				for y := r.Min.Y + 1; y < r.Max.Y; y++ {
    					i0 += dst0.Stride
    					i1 += dst0.Stride
    					copy(dst0.Pix[i0:i1], firstRow)
    				}
    				return
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 11 17:08:05 UTC 2024
    - 33.9K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/test/abiutils_test.go

    	// func(x int32) int32
    	i32 := types.Types[types.TINT32]
    	ft := mkFuncType(nil, []*types.Type{i32}, []*types.Type{i32})
    
    	// expected results
    	exp := makeExpectedDump(`
            IN 0: R{ I0 } spilloffset: 0 typ: int32
            OUT 0: R{ I0 } spilloffset: -1 typ: int32
            offsetToSpillArea: 0 spillAreaSize: 8
    `)
    
    	abitest(t, ft, exp)
    }
    
    func TestABIUtilsBasic2(t *testing.T) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Oct 04 15:11:40 UTC 2023
    - 14.2K bytes
    - Viewed (0)
  4. src/crypto/sha512/sha512block_arm64.s

    	VADD	i3.D2, i1.D2, i4.D2 \
    	SHA512H2	i0.D2, i1, i3
    
    #define SHA512ROUND_NO_UPDATE(i0, i1, i2, i3, i4, rc0, rc1, in0) \
    	VLD1.P	16(R4), [rc1.D2] \
    	SHA512TRANS(i0, i1, i2, i3, i4, rc0, in0) \
    	SHA512H	V7.D2, V6, i3 \
    	VADD	i3.D2, i1.D2, i4.D2 \
    	SHA512H2	i0.D2, i1, i3
    
    #define SHA512ROUND_LAST(i0, i1, i2, i3, i4, rc0, in0) \
    	SHA512TRANS(i0, i1, i2, i3, i4, rc0, in0) \
    	SHA512H	V7.D2, V6, i3 \
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:29:44 UTC 2024
    - 5K bytes
    - Viewed (0)
  5. src/internal/types/testdata/check/issues0.go

    	// a few more - less exhaustive now
    
    	f := func(I1, I2){}
    	f(i0 /* ERROR "missing method foo" */ , i1 /* ERROR "wrong type for method foo" */ )
    
    	_ = [...]I1{i0 /* ERRORx `cannot use i0 .* as I1 value in array or slice literal: I0 does not implement I1 \(missing method foo\)` */ }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 05 18:13:11 UTC 2024
    - 11.6K bytes
    - Viewed (0)
  6. platforms/documentation/docs/src/docs/userguide/img/publishing-process.graffle

    HelveticaNeue;\f1\fnil\fcharset0 Menlo-Regular;\f2\fnil\fcharset0 Menlo-Italic; } {\colortbl;\red255\green255\blue255;} {\*\expandedcolortbl;;} \deftab720 \pard\pardeftab720\qc\partightenfactor0 \f0\fs24 \cf0 Task \f1 publish \f2\i MyLib \f1\i0 PublicationTo \f2\i MyRepo \f1\i0 Repository}WrapNOBounds{{336.3999964594841, 32.099998712539673}, {144, 67.83999964594841}}ClassShapedGraphicFo{\rtf1\ansi\ansicpg1252\cocoartf1561\cocoasubrtf400 {\fonttbl\f0\fswiss\fcharset0 Helvetica;} {\colortbl;\red255\green255\blue255;}...
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Nov 27 17:53:42 UTC 2023
    - 21.1K bytes
    - Viewed (0)
  7. src/image/ycbcr.go

    		mul3NonNeg(2, cw, ch),
    	)
    	if totalLength < 0 {
    		panic("image: NewYCbCr Rectangle has huge or negative dimensions")
    	}
    
    	i0 := w*h + 0*cw*ch
    	i1 := w*h + 1*cw*ch
    	i2 := w*h + 2*cw*ch
    	b := make([]byte, i2)
    	return &YCbCr{
    		Y:              b[:i0:i0],
    		Cb:             b[i0:i1:i1],
    		Cr:             b[i1:i2:i2],
    		SubsampleRatio: subsampleRatio,
    		YStride:        w,
    		CStride:        cw,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 12:02:45 UTC 2023
    - 8.7K bytes
    - Viewed (0)
  8. src/internal/trace/batchcursor.go

    			// Heap invariant already applies.
    			break
    		}
    		heap[i], heap[m] = heap[m], heap[i]
    		i = m
    	}
    	return i
    }
    
    func min3(b []*batchCursor, i0, i1, i2 int) int {
    	minIdx := i0
    	minT := maxTime
    	if i0 < len(b) {
    		minT = b[i0].ev.time
    	}
    	if i1 < len(b) {
    		if t := b[i1].ev.time; t < minT {
    			minT = t
    			minIdx = i1
    		}
    	}
    	if i2 < len(b) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 4.1K bytes
    - Viewed (0)
  9. src/time/zoneinfo_windows.go

    	dst.isDST = true
    
    	// Arrange so that d0 is first transition date, d1 second,
    	// i0 is index of zone after first transition, i1 second.
    	d0 := &i.StandardDate
    	d1 := &i.DaylightDate
    	i0 := 0
    	i1 := 1
    	if d0.Month > d1.Month {
    		d0, d1 = d1, d0
    		i0, i1 = i1, i0
    	}
    
    	// 2 tx per year, 100 years on each side of this year
    	l.tx = make([]zoneTrans, 400)
    
    	t := Now().UTC()
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Sep 14 07:20:34 UTC 2023
    - 6.6K bytes
    - Viewed (0)
  10. src/container/heap/heap.go

    		j = i
    	}
    }
    
    func down(h Interface, i0, n int) bool {
    	i := i0
    	for {
    		j1 := 2*i + 1
    		if j1 >= n || j1 < 0 { // j1 < 0 after int overflow
    			break
    		}
    		j := j1 // left child
    		if j2 := j1 + 1; j2 < n && h.Less(j2, j1) {
    			j = j2 // = 2*i + 2  // right child
    		}
    		if !h.Less(j, i) {
    			break
    		}
    		h.Swap(i, j)
    		i = j
    	}
    	return i > i0
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 12 14:39:10 UTC 2023
    - 3.3K bytes
    - Viewed (0)
Back to top