File: inversion_tree_test.go

package info (click to toggle)
golang-github-klauspost-reedsolomon 1.9.9-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 1,248 kB
  • sloc: asm: 17,464; makefile: 8
file content (125 lines) | stat: -rw-r--r-- 2,963 bytes parent folder | download | duplicates (7)
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
/**
 * Unit tests for inversion tree.
 *
 * Copyright 2016, Peter Collins
 */

package reedsolomon

import (
	"testing"
)

func TestNewInversionTree(t *testing.T) {
	tree := newInversionTree(3, 2)

	children := len(tree.root.children)
	if children != 5 {
		t.Fatal("Root node children list length", children, "!=", 5)
	}

	str := tree.root.matrix.String()
	expect := "[[1, 0, 0], [0, 1, 0], [0, 0, 1]]"
	if str != expect {
		t.Fatal(str, "!=", expect)
	}
}

func TestGetInvertedMatrix(t *testing.T) {
	tree := newInversionTree(3, 2)

	matrix := tree.GetInvertedMatrix([]int{})
	str := matrix.String()
	expect := "[[1, 0, 0], [0, 1, 0], [0, 0, 1]]"
	if str != expect {
		t.Fatal(str, "!=", expect)
	}

	matrix = tree.GetInvertedMatrix([]int{1})
	if matrix != nil {
		t.Fatal(matrix, "!= nil")
	}

	matrix = tree.GetInvertedMatrix([]int{1, 2})
	if matrix != nil {
		t.Fatal(matrix, "!= nil")
	}

	matrix, err := newMatrix(3, 3)
	if err != nil {
		t.Fatalf("Failed initializing new Matrix : %s", err)
	}
	err = tree.InsertInvertedMatrix([]int{1}, matrix, 5)
	if err != nil {
		t.Fatalf("Failed inserting new Matrix : %s", err)
	}

	cachedMatrix := tree.GetInvertedMatrix([]int{1})
	if cachedMatrix == nil {
		t.Fatal(cachedMatrix, "== nil")
	}
	if matrix.String() != cachedMatrix.String() {
		t.Fatal(matrix.String(), "!=", cachedMatrix.String())
	}
}

func TestInsertInvertedMatrix(t *testing.T) {
	tree := newInversionTree(3, 2)

	matrix, err := newMatrix(3, 3)
	if err != nil {
		t.Fatalf("Failed initializing new Matrix : %s", err)
	}
	err = tree.InsertInvertedMatrix([]int{1}, matrix, 5)
	if err != nil {
		t.Fatalf("Failed inserting new Matrix : %s", err)
	}

	err = tree.InsertInvertedMatrix([]int{}, matrix, 5)
	if err == nil {
		t.Fatal("Should have failed inserting the root node matrix", matrix)
	}

	matrix, err = newMatrix(3, 2)
	if err != nil {
		t.Fatalf("Failed initializing new Matrix : %s", err)
	}
	err = tree.InsertInvertedMatrix([]int{2}, matrix, 5)
	if err == nil {
		t.Fatal("Should have failed inserting a non-square matrix", matrix)
	}

	matrix, err = newMatrix(3, 3)
	if err != nil {
		t.Fatalf("Failed initializing new Matrix : %s", err)
	}
	err = tree.InsertInvertedMatrix([]int{0, 1}, matrix, 5)
	if err != nil {
		t.Fatalf("Failed inserting new Matrix : %s", err)
	}
}

func TestDoubleInsertInvertedMatrix(t *testing.T) {
	tree := newInversionTree(3, 2)

	matrix, err := newMatrix(3, 3)
	if err != nil {
		t.Fatalf("Failed initializing new Matrix : %s", err)
	}
	err = tree.InsertInvertedMatrix([]int{1}, matrix, 5)
	if err != nil {
		t.Fatalf("Failed inserting new Matrix : %s", err)
	}
	err = tree.InsertInvertedMatrix([]int{1}, matrix, 5)
	if err != nil {
		t.Fatalf("Failed inserting new Matrix : %s", err)
	}

	cachedMatrix := tree.GetInvertedMatrix([]int{1})
	if cachedMatrix == nil {
		t.Fatal(cachedMatrix, "== nil")
	}
	if matrix.String() != cachedMatrix.String() {
		t.Fatal(matrix.String(), "!=", cachedMatrix.String())
	}
}