/usr/share/gocode/src/github.com/pointlander/compress/compress_test.go is in golang-github-pointlander-compress-dev 1.0.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 | // Copyright 2010 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package compress
import (
"bytes"
/*"fmt"*/
"strconv"
"testing"
)
var TESTS = [...]string{
"SIX.MIXED.PIXIES.SIFT.SIXTY.PIXIE.DUST.BOXES",
"output[j], j, k, minor[k] = s[k], j - 1, major[s[k]] + minor[k], -1",
"now is the time for the truly nice people to come to the party",
"Wild Beasts and Their Ways, Reminiscences of Europe, Asia, Africa and America — Volume 1",
"EEEIT..SXXIT.ESDIXOS..IISXMBSIYSIDXTXIUPF.P.",
"MXIOTXD.SI.SSTEDXIUIX.X.I.XSPISSFYBPEETEI.I.",
}
func TestSuffixTree(t *testing.T) {
test := func(input string) {
tree := BuildSuffixTree([]uint8(input))
edges, nodes := tree.edges, tree.nodes
for _, edge := range edges {
if edge.first_index > edge.last_index {
t.Errorf("first_index is greater than last_index")
}
end := nodes[edge.end_node]
if end != -1 {
edge.last_index++
}
/*fmt.Printf("%v %v %v '%v'\n", edge.start_node, edge.end_node, end, input[edge.first_index:edge.last_index])*/
}
if index := tree.Index(input); index != 0 {
t.Errorf("index of %v is %v; should be 0", input, index)
}
}
test("banana")
test("the frightened Mouse splashed his way through the")
}
func TestBurrowsWheeler(t *testing.T) {
test := func(input string) {
buffer := make([]byte, len(input))
copy(buffer, input)
tree := BuildSuffixTree(buffer)
bw, sentinel := tree.BurrowsWheelerCoder()
index, out_buffer := 0, make([]byte, len(buffer)+1)
for b := range bw {
out_buffer[index] = b
index++
}
s := <-sentinel
for b, c := out_buffer[s], s+1; c < len(out_buffer); c++ {
out_buffer[c], b = b, out_buffer[c]
}
/*fmt.Println(strconv.QuoteToASCII(string(out_buffer)))*/
original := burrowsWheelerDecoder(out_buffer, s)
if bytes.Compare(buffer, original) != 0 {
t.Errorf("should be '%v'; got '%v'", input, strconv.QuoteToASCII(string(original)))
}
}
for _, v := range TESTS {
test(v)
}
}
const repeated = 10000
func TestBijectiveBurrowsWheeler(t *testing.T) {
input, output := make(chan []byte), make(chan []byte, 2)
coder, decoder := BijectiveBurrowsWheelerCoder(input), BijectiveBurrowsWheelerDecoder(output)
test := func(buffer []byte) {
for c := 0; c < repeated; c++ {
input <- buffer
<-coder.Input
}
in := make([]byte, len(buffer))
for c := 0; c < repeated; c++ {
output <- in
output <- nil
for _, i := range buffer {
decoder.Output(i)
}
copy(buffer, in)
}
}
for _, v := range TESTS {
buffer := make([]byte, len(v))
copy(buffer, []byte(v))
test(buffer)
if string(buffer) != v {
t.Errorf("should be '%v'; got '%v'", v, strconv.QuoteToASCII(string(buffer)))
}
}
close(input)
close(output)
}
func TestMoveToFront(t *testing.T) {
test := func(buffer []byte) {
input, output := make(chan []byte), make(chan []byte, 1)
coder := BijectiveBurrowsWheelerCoder(input).MoveToFrontCoder()
decoder := BijectiveBurrowsWheelerDecoder(output).MoveToFrontDecoder()
input <- buffer
close(input)
output <- buffer
close(output)
for out := range coder.Input {
for _, symbol := range out {
decoder.Output(symbol)
}
}
}
for _, v := range TESTS {
buffer := make([]byte, len(v))
copy(buffer, []byte(v))
test(buffer)
if string(buffer) != v {
t.Errorf("inverse should be '%v'; got '%v'", v, strconv.QuoteToASCII(string(buffer)))
}
}
}
func TestCode16(t *testing.T) {
test := []byte("GLIB BATES\x00")
var table = [256]Symbol{'B': {11, 0, 1},
'I': {11, 1, 2},
'L': {11, 2, 4},
' ': {11, 4, 5},
'G': {11, 5, 6},
'A': {11, 6, 7},
'T': {11, 7, 8},
'E': {11, 8, 9},
'S': {11, 9, 10},
'\x00': {11, 10, 11}}
in, buffer := make(chan []Symbol), &bytes.Buffer{}
go func() {
input := make([]Symbol, len(test))
for i, s := range test {
input[i] = table[s]
}
in <- input
close(in)
}()
Model{Input: in}.Code(buffer)
if compressed := [...]byte{120, 253, 188, 155, 248}; bytes.Compare(compressed[:], buffer.Bytes()) != 0 {
t.Errorf("arithmetic coding failed")
}
uncompressed, j := make([]byte, len(test)), 0
lookup := func(code uint16) Symbol {
for i, symbol := range table {
if code >= symbol.Low && code < symbol.High {
uncompressed[j], j = byte(i), j+1
if i == 0 {
return Symbol{}
} else {
return symbol
}
}
}
return Symbol{}
}
Model{Scale: 11, Output: lookup}.Decode(buffer)
if bytes.Compare(test, uncompressed) != 0 {
t.Errorf("arithmetic decoding failed")
}
}
func TestCode32(t *testing.T) {
test := []byte("GLIB BATES\x00")
var table = [256]Symbol32{'B': {11, 0, 1},
'I': {11, 1, 2},
'L': {11, 2, 4},
' ': {11, 4, 5},
'G': {11, 5, 6},
'A': {11, 6, 7},
'T': {11, 7, 8},
'E': {11, 8, 9},
'S': {11, 9, 10},
'\x00': {11, 10, 11}}
in, buffer := make(chan []Symbol32), &bytes.Buffer{}
go func() {
input := make([]Symbol32, len(test))
for i, s := range test {
input[i] = table[s]
}
in <- input
close(in)
}()
Model32{Input: in}.Code(buffer)
if compressed := [...]byte{120, 254, 27, 129, 174}; bytes.Compare(compressed[:], buffer.Bytes()) != 0 {
t.Errorf("arithmetic coding failed")
}
uncompressed, j := make([]byte, len(test)), 0
lookup := func(code uint32) Symbol32 {
for i, symbol := range table {
if code >= symbol.Low && code < symbol.High {
uncompressed[j], j = byte(i), j+1
if i == 0 {
return Symbol32{}
} else {
return symbol
}
}
}
return Symbol32{}
}
Model32{Scale: 11, Output: lookup}.Decode(buffer)
if bytes.Compare(test, uncompressed) != 0 {
t.Errorf("arithmetic decoding failed")
}
}
|