- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 72 for AStride (0.19 sec)
-
src/image/ycbcr.go
// For 4:2:0, CStride == YStride/2 && len(Cb) == len(Cr) == len(Y)/4. // For 4:4:0, CStride == YStride/1 && len(Cb) == len(Cr) == len(Y)/2. // For 4:1:1, CStride == YStride/4 && len(Cb) == len(Cr) == len(Y)/4. // For 4:1:0, CStride == YStride/4 && len(Cb) == len(Cr) == len(Y)/8. type YCbCr struct { Y, Cb, Cr []uint8 YStride int CStride int SubsampleRatio YCbCrSubsampleRatio
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 8.7K bytes - Viewed (0) -
src/image/jpeg/scan.go
b[unzig[zig]] *= qt[zig] } idct(b) dst, stride := []byte(nil), 0 if d.nComp == 1 { dst, stride = d.img1.Pix[8*(by*d.img1.Stride+bx):], d.img1.Stride } else { switch compIndex { case 0: dst, stride = d.img3.Y[8*(by*d.img3.YStride+bx):], d.img3.YStride case 1: dst, stride = d.img3.Cb[8*(by*d.img3.CStride+bx):], d.img3.CStride case 2: dst, stride = d.img3.Cr[8*(by*d.img3.CStride+bx):], d.img3.CStride
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 15.7K bytes - Viewed (0) -
src/image/internal/imageutil/gen.go
"444": ` ci := (sy-src.Rect.Min.Y)*src.CStride + (sp.X - src.Rect.Min.X) for x := x0; x != x1; x, yi, ci = x+4, yi+1, ci+1 { `, "422": ` ciBase := (sy-src.Rect.Min.Y)*src.CStride - src.Rect.Min.X/2 for x, sx := x0, sp.X; x != x1; x, sx, yi = x+4, sx+1, yi+1 { ci := ciBase + sx/2 `, "420": ` ciBase := (sy/2-src.Rect.Min.Y/2)*src.CStride - src.Rect.Min.X/2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 4.3K bytes - Viewed (0) -
src/image/jpeg/reader_test.go
m1 := m1.(*image.YCbCr) if err := check(m0.Bounds(), m0.Y, m1.Y, m0.YStride, m1.YStride); err != nil { t.Errorf("%s (Y): %v", tc, err) continue } if err := check(m0.Bounds(), m0.Cb, m1.Cb, m0.CStride, m1.CStride); err != nil { t.Errorf("%s (Cb): %v", tc, err) continue } if err := check(m0.Bounds(), m0.Cr, m1.Cr, m0.CStride, m1.CStride); err != nil { t.Errorf("%s (Cr): %v", tc, err) continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 24.4K bytes - Viewed (0) -
src/image/draw/draw_test.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 20 18:07:05 UTC 2023 - 26K bytes - Viewed (0) -
src/image/jpeg/reader.go
translations := [4]struct { src []byte stride int }{ {d.img3.Y, d.img3.YStride}, {d.img3.Cb, d.img3.CStride}, {d.img3.Cr, d.img3.CStride}, {d.blackPix, d.blackStride}, } for t, translation := range translations { subsample := d.comp[t].h != d.comp[0].h || d.comp[t].v != d.comp[0].v for iBase, y := 0, bounds.Min.Y; y < bounds.Max.Y; iBase, y = iBase+img.Stride, y+1 { sy := y - bounds.Min.Y
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 22.5K bytes - Viewed (0) -
src/image/draw/bench_test.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 20 18:07:05 UTC 2023 - 6.6K bytes - Viewed (0) -
src/image/image.go
type RGBA struct { // Pix holds the image's pixels, in R, G, B, A order. The pixel at // (x, y) starts at Pix[(y-Rect.Min.Y)*Stride + (x-Rect.Min.X)*4]. Pix []uint8 // Stride is the Pix stride (in bytes) between vertically adjacent pixels. Stride int // Rect is the image's bounds. Rect Rectangle } func (p *RGBA) ColorModel() color.Model { return color.RGBAModel }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 34.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/transforms/composite_avg_pool_patterns.td
/*padding*/(GetAvgPoolOpPadAttr $old_val), /*stride_h*/(GetI32At<0> (GetAsVectorAttr<"stride"> $attrs)), /*stride_w*/(GetI32At<1> (GetAsVectorAttr<"stride"> $attrs)), /*fused_activation_function*/TFL_AF_None, (returnType (GetNhwcReturnTypeFromNchw $old_val))),
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 23:16:05 UTC 2024 - 7.8K bytes - Viewed (0) -
src/unicode/letter.go
} if r <= range_.Hi { return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 } } return false } // binary search over ranges lo := 0 hi := len(ranges) for lo < hi { m := int(uint(lo+hi) >> 1) range_ := &ranges[m] if range_.Lo <= r && r <= range_.Hi { return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 } if r < range_.Lo { hi = m
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0)