/
matrix_test.go
133 lines (116 loc) · 5.46 KB
/
matrix_test.go
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
/*
conflux - Distributed database synchronization library
Based on the algorithm described in
"Set Reconciliation with Nearly Optimal Communication Complexity",
Yaron Minsky, Ari Trachtenberg, and Richard Zippel, 2004.
Copyright (c) 2012-2015 Casey Marshall <cmars@cmarstech.com>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package conflux
import (
"math/big"
gc "gopkg.in/check.v1"
)
type MatrixSuite struct{}
var _ = gc.Suite(&MatrixSuite{})
const TEST_MATRIX_SIZE = 5
func (s *MatrixSuite) TestMatrixPutGet(c *gc.C) {
p := big.NewInt(int64(65537))
m := NewMatrix(TEST_MATRIX_SIZE, TEST_MATRIX_SIZE, Zi(p, 23))
m.Set(2, 2, Zi(p, 24))
n := 0
for i := 0; i < TEST_MATRIX_SIZE; i++ {
for j := 0; j < TEST_MATRIX_SIZE; j++ {
n++
if i == 2 && j == 2 {
c.Assert(int64(24), gc.Equals, m.Get(i, j).Int64())
} else {
c.Assert(int64(23), gc.Equals, m.Get(i, j).Int64())
}
}
}
c.Assert(25, gc.Equals, n)
}
func (s *MatrixSuite) TestSwapRows(c *gc.C) {
p := big.NewInt(int64(13))
m := NewMatrix(3, 3, Zi(p, 0))
for i := 0; i < len(m.cells); i++ {
m.cells[i] = Zi(p, i)
}
m.swapRows(0, 1)
c.Assert(int64(0), gc.Equals, m.Get(0, 1).Int64())
c.Assert(int64(3), gc.Equals, m.Get(0, 0).Int64())
}
func (s *MatrixSuite) TestScalarMult(c *gc.C) {
p := big.NewInt(int64(13))
m := NewMatrix(3, 3, Zi(p, 0))
for col := 0; col < m.columns; col++ {
m.Set(col, 0, Zi(p, col))
}
m.scmultRow(0, 0, Zi(p, 2))
c.Assert(int64(0), gc.Equals, m.Get(0, 0).Int64())
c.Assert(int64(2), gc.Equals, m.Get(1, 0).Int64())
c.Assert(int64(4), gc.Equals, m.Get(2, 0).Int64())
}
func assertEqualMatrix(c *gc.C, m0 *Matrix, m1 *Matrix) {
c.Assert(m0.rows, gc.Equals, m1.rows)
c.Assert(m0.columns, gc.Equals, m1.columns)
for i, cell := range m0.cells {
c.Assert(cell.String(), gc.Equals, m1.cells[i].String())
}
}
func (s *MatrixSuite) TestRowSub(c *gc.C) {
//rowsub scol=2 src=2 dst=1 scmult=414193719442635090920821340202167292308
p := P_SKS
m0 := NewMatrix(4, 3, Zi(p, 0))
m1 := NewMatrix(4, 3, Zi(p, 0))
m0.cells = []*Zp{Zs(p, "1"), Zs(p, "363071340156750294202717135989109785507"), Zs(p, "0"), Zs(p, "0"),
Zs(p, "0"), Zs(p, "1"), Zs(p, "414193719442635090920821340202167292308"), Zs(p, "76079263692028389064896590184642256185"),
Zs(p, "0"), Zs(p, "0"), Zs(p, "1"), Zs(p, "392754565503219928741794743746565516193")}
m1.cells = []*Zp{Zs(p, "1"), Zs(p, "363071340156750294202717135989109785507"), Zs(p, "0"), Zs(p, "0"),
Zs(p, "0"), Zs(p, "1"), Zs(p, "0"), Zs(p, "111558354046471781906126890183463223733"),
Zs(p, "0"), Zs(p, "0"), Zs(p, "1"), Zs(p, "392754565503219928741794743746565516193")}
m0.rowsub(2, 2, 1, Zs(p, "414193719442635090920821340202167292308"))
assertEqualMatrix(c, m0, m1)
}
func (s *MatrixSuite) TestScmult(c *gc.C) {
//scmult_row scol=1 j=1 sc=224783190696206154659406780575841590745
p := P_SKS
m0 := NewMatrix(4, 3, Zi(p, 0))
m1 := NewMatrix(4, 3, Zi(p, 0))
m0.cells = []*Zp{
Zs(p, "1"), Zs(p, "363071340156750294202717135989109785507"), Zs(p, "0"), Zs(p, "0"),
Zs(p, "1"), Zs(p, "474133953638754081170510568140374743646"), Zs(p, "56378935912848241334616952212204693693"), Zs(p, "56378935912848241334616952212204693694"),
Zs(p, "1"), Zs(p, "263058945883592178217015800993817029663"), Zs(p, "263058945883592178217015800993817029663"), Zs(p, "267453943668010144288111719358762407675")}
m1.cells = []*Zp{
Zs(p, "1"), Zs(p, "363071340156750294202717135989109785507"), Zs(p, "0"), Zs(p, "0"),
Zs(p, "1"), Zs(p, "1"), Zs(p, "530512889551602322505127520352579437338"), Zs(p, "224783190696206154659406780575841590744"),
Zs(p, "1"), Zs(p, "263058945883592178217015800993817029663"), Zs(p, "263058945883592178217015800993817029663"), Zs(p, "267453943668010144288111719358762407675")}
m0.scmultRow(1, 1, Zs(p, "224783190696206154659406780575841590745"))
assertEqualMatrix(c, m0, m1)
}
func (s *MatrixSuite) TestProcessRowForward(c *gc.C) {
p := P_SKS
m0 := NewMatrix(4, 3, Zi(p, 0))
m1 := NewMatrix(4, 3, Zi(p, 0))
// matrixes captured from printfs in SKS unit tests
m0.cells = []*Zp{
Zs(p, "1"), Zs(p, "363071340156750294202717135989109785507"), Zs(p, "0"), Zs(p, "0"),
Zs(p, "1"), Zs(p, "474133953638754081170510568140374743646"), Zs(p, "56378935912848241334616952212204693693"), Zs(p, "56378935912848241334616952212204693694"),
Zs(p, "1"), Zs(p, "263058945883592178217015800993817029663"), Zs(p, "263058945883592178217015800993817029663"), Zs(p, "267453943668010144288111719358762407675")}
m1.cells = []*Zp{
Zs(p, "1"), Zs(p, "363071340156750294202717135989109785507"), Zs(p, "0"), Zs(p, "0"),
Zs(p, "0"), Zs(p, "111062613482003786967793432151264958139"), Zs(p, "56378935912848241334616952212204693693"), Zs(p, "56378935912848241334616952212204693694"),
Zs(p, "0"), Zs(p, "430500495278444206519426185357286681495"), Zs(p, "263058945883592178217015800993817029663"), Zs(p, "267453943668010144288111719358762407675")}
m0.processRowForward(0)
assertEqualMatrix(c, m0, m1)
}