-
Notifications
You must be signed in to change notification settings - Fork 180
/
matrix.go
77 lines (62 loc) · 2.04 KB
/
matrix.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
/*
* Copyright (c) 2019-2021. Abstrium SAS <team (at) pydio.com>
* This file is part of Pydio Cells.
*
* Pydio Cells is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Pydio Cells 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with Pydio Cells. If not, see <http://www.gnu.org/licenses/>.
*
* The latest code can be found at <https://pydio.com>.
*/
package mtree
import "math/big"
type Matrix [][]*big.Int
func NewMatrix(m00 *big.Int, m01 *big.Int, m10 *big.Int, m11 *big.Int) *Matrix {
return &Matrix{
{m00, m01},
{m10, m11},
}
}
func (m Matrix) GetA11() *big.Int {
return m[0][0]
}
func (m Matrix) GetA12() *big.Int {
return m[1][0]
}
func (m Matrix) GetA21() *big.Int {
return m[0][1]
}
func (m Matrix) GetA22() *big.Int {
return m[1][1]
}
func multiply(m1 *Matrix, m2 *Matrix) *Matrix {
var mul1, mul2, add1, add2, add3, add4 big.Int
return NewMatrix(
add1.Add(mul1.Mul(m1.GetA11(), m2.GetA11()), mul2.Mul(m1.GetA21(), m2.GetA12())),
add2.Add(mul1.Mul(m1.GetA11(), m2.GetA21()), mul2.Mul(m1.GetA21(), m2.GetA22())),
add3.Add(mul1.Mul(m1.GetA12(), m2.GetA11()), mul2.Mul(m1.GetA22(), m2.GetA12())),
add4.Add(mul1.Mul(m1.GetA12(), m2.GetA21()), mul2.Mul(m1.GetA22(), m2.GetA22())),
)
}
func invertMatrix(m1 *Matrix) *Matrix {
var neg1, neg2 big.Int
return NewMatrix(
neg1.Neg(m1.GetA22()),
m1.GetA21(),
m1.GetA12(),
neg2.Neg(m1.GetA11()),
)
}
func MoveSubtree(p0 *Matrix, m *big.Int, p1 *Matrix, n *big.Int, M *Matrix) *Matrix {
var sub big.Int
return multiply(multiply(multiply(p1, NewMatrix(one, fraczero, sub.Sub(m, n), one)), invertMatrix(p0)), M)
}