HomeSort by relevance Sort by last modified time
    Searched refs:zig (Results 1 - 16 of 16) sorted by null

  /prebuilts/go/darwin-x86/src/image/jpeg/
writer_test.go 19 // zigzag maps from the natural ordering to the zig-zag ordering. For example,
20 // zigzag[0*8 + 3] is the zig-zag sequence number of the element in the fourth
45 // natural (not zig-zag) order, as specified in section K.1.
74 for zig := 0; zig < blockSize; zig++ {
75 got := unscaledQuant[i][zig]
76 want := unscaledQuantInNaturalOrder[i][unzig[zig]]
78 t.Errorf("i=%d, zig=%d: got %d, want %d", i, zig, got, want
    [all...]
scan.go 118 // component), coefficients 1-5, and coefficients 6-63, in zig-zag
162 // b is the decoded coefficients, in natural (not zig-zag) order.
228 zig := zigStart
229 if zig == 0 {
230 zig++
247 if zig <= zigEnd && d.eobRun > 0 {
252 for ; zig <= zigEnd; zig++ {
260 zig += int32(val0)
261 if zig > zigEnd
    [all...]
writer.go 59 // unscaledQuant are the unscaled quantization tables in zig-zag order. Each
62 // zig-zag order.
227 // quant is the scaled quantization tables, in zig-zag order.
361 // natural (not zig-zag) order.
369 for zig := 1; zig < blockSize; zig++ {
370 ac := div(b[unzig[zig]], 8*int32(e.quant[q][zig]))
494 // The blocks are in natural (not zig-zag) order
    [all...]
reader.go 78 // unzig maps from the zig-zag ordering to the natural ordering. For example,
79 // unzig[3] is the column and row of the fourth element in zig-zag order. The
140 quant [maxTq + 1]block // Quantization tables, in zig-zag order.
  /prebuilts/go/linux-x86/src/image/jpeg/
writer_test.go 19 // zigzag maps from the natural ordering to the zig-zag ordering. For example,
20 // zigzag[0*8 + 3] is the zig-zag sequence number of the element in the fourth
45 // natural (not zig-zag) order, as specified in section K.1.
74 for zig := 0; zig < blockSize; zig++ {
75 got := unscaledQuant[i][zig]
76 want := unscaledQuantInNaturalOrder[i][unzig[zig]]
78 t.Errorf("i=%d, zig=%d: got %d, want %d", i, zig, got, want
    [all...]
scan.go 118 // component), coefficients 1-5, and coefficients 6-63, in zig-zag
162 // b is the decoded coefficients, in natural (not zig-zag) order.
228 zig := zigStart
229 if zig == 0 {
230 zig++
247 if zig <= zigEnd && d.eobRun > 0 {
252 for ; zig <= zigEnd; zig++ {
260 zig += int32(val0)
261 if zig > zigEnd
    [all...]
writer.go 59 // unscaledQuant are the unscaled quantization tables in zig-zag order. Each
62 // zig-zag order.
227 // quant is the scaled quantization tables, in zig-zag order.
361 // natural (not zig-zag) order.
369 for zig := 1; zig < blockSize; zig++ {
370 ac := div(b[unzig[zig]], 8*int32(e.quant[q][zig]))
494 // The blocks are in natural (not zig-zag) order
    [all...]
reader.go 78 // unzig maps from the zig-zag ordering to the natural ordering. For example,
79 // unzig[3] is the column and row of the fourth element in zig-zag order. The
140 quant [maxTq + 1]block // Quantization tables, in zig-zag order.
  /prebuilts/go/darwin-x86/src/encoding/binary/
varint.go 13 // - signed integers are mapped to unsigned integers using "zig-zag"
  /prebuilts/go/linux-x86/src/encoding/binary/
varint.go 13 // - signed integers are mapped to unsigned integers using "zig-zag"
  /external/libgdx/gdx/jni/gdx2d/
stb_image.h 1739 unsigned int zig; local
1813 unsigned int zig; local
    [all...]
  /external/chromium-trace/catapult/third_party/gsutil/third_party/protorpc/protorpc/
messages.py 566 SINT32: 32-bit signed integer. Uses "zig-zag" encoding.
567 SINT64: 64-bit signed integer. Uses "zig-zag" encoding.
    [all...]
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/internal/obj/
pcln.go 96 // transmitted in zig-zag form, where a complement bit is placed in bit 0,
  /prebuilts/go/darwin-x86/src/cmd/internal/obj/
pcln.go 93 // transmitted in zig-zag form, where a complement bit is placed in bit 0,
  /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/internal/obj/
pcln.go 96 // transmitted in zig-zag form, where a complement bit is placed in bit 0,
  /prebuilts/go/linux-x86/src/cmd/internal/obj/
pcln.go 93 // transmitted in zig-zag form, where a complement bit is placed in bit 0,

Completed in 341 milliseconds