- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for i0 (0.02 sec)
-
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) -
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) -
src/internal/types/testdata/check/issues0.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 05 18:13:11 UTC 2024 - 11.6K bytes - Viewed (0) -
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) -
src/internal/trace/internal/oldtrace/order.go
for { i := (j - 1) / 2 // parent if i == j || !h.Less(j, i) { break } (*h)[i], (*h)[j] = (*h)[j], (*h)[i] j = i } } func heapDown(h *orderEventList, 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) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 4K bytes - Viewed (0) -
test/codegen/arithmetic.go
} // The reassociate rules "x - (z + C) -> (x - z) - C" and // "(z + C) -x -> C + (z - x)" can optimize the following cases. func constantFold1(i0, j0, i1, j1, i2, j2, i3, j3 int) (int, int, int, int) { // arm64:"SUB","ADD\t[$]2" // ppc64x:"SUB","ADD\t[$]2" r0 := (i0 + 3) - (j0 + 1) // arm64:"SUB","SUB\t[$]4" // ppc64x:"SUB","ADD\t[$]-4" r1 := (i1 - 3) - (j1 + 1) // arm64:"SUB","ADD\t[$]4"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:28:00 UTC 2024 - 15.2K bytes - Viewed (0) -
src/runtime/map_test.go
if !m[GrabBag{c128: 1.0i}] { panic("c128 not found") } m[GrabBag{s: "foo"}] = true if !m[GrabBag{s: "foo"}] { panic("string not found") } m[GrabBag{i0: "foo"}] = true if !m[GrabBag{i0: "foo"}] { panic("interface{} not found") } m[GrabBag{i1: canString(5)}] = true if !m[GrabBag{i1: canString(5)}] { panic("interface{String() string} not found") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 33.5K bytes - Viewed (0) -
src/go/types/issues_test.go
`package main import "b" type I0 interface { M0(w struct{ f string }) } var _ I0 = b.S{} `, `package b type S struct{} func (S) M0(struct{ f string }) {} `, `6:12: cannot use b[.]S{} [(]value of type b[.]S[)] as I0 value in variable declaration: b[.]S does not implement I0 [(]wrong type for method M0[)] .*have M0[(]struct{f string /[*] package b [*]/ }[)]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 28.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/issues_test.go
`package main import "b" type I0 interface { M0(w struct{ f string }) } var _ I0 = b.S{} `, `package b type S struct{} func (S) M0(struct{ f string }) {} `, `6:12: cannot use b[.]S{} [(]value of type b[.]S[)] as I0 value in variable declaration: b[.]S does not implement I0 [(]wrong type for method M0[)] .*have M0[(]struct{f string /[*] package b [*]/ }[)]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 28.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
} private SetBuilderImpl<E> insertInHashTable(E e) { requireNonNull(hashTable); int eHash = e.hashCode(); int i0 = Hashing.smear(eHash); int mask = hashTable.length - 1; for (int i = i0; i - i0 < maxRunBeforeFallback; i++) { int index = i & mask; Object tableEntry = hashTable[index]; if (tableEntry == null) { addDedupedElement(e);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 35.3K bytes - Viewed (0)