-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmatrices.py
78 lines (45 loc) · 1.63 KB
/
matrices.py
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
from itertools import product
class Matrix:
def __init__(self, arr):
if not arr:
raise IndexError
if not all(isinstance(k, list) for k in arr):
if all(isinstance(k, int) or isinstance(k, float) for k in arr):
arr = [arr]
else:
raise IndexError
self.arr = arr
self.length = len(arr)
self.adim = len(arr[0])
def __add__(self, other):
if self.length != other.length or self.adim != other.adim:
raise IndexError
sum_matrix = [
[self.arr[i][j] + other.arr[i][j] for j in range(self.adim)]
for i in range(self.length)
]
return Matrix(sum_matrix)
def __mul__(self, other):
if isinstance(other, int) or isinstance(other, float):
return Matrix([[other * item for item in row] for row in self.arr])
if self.adim != other.length:
raise IndexError
prod = [[0] * other.adim for _ in range(self.length)]
one = range(self.length)
two = range(other.adim)
three = range(self.adim)
for i,j,k in product(one,two,three):
prod[i][j] += self.arr[i][k] * other.arr[k][j]
return Matrix(prod)
def __repr__(self):
return f"Matrix({self.arr})"
def __str__(self):
return str(self.arr).replace(',', '')
def __neg__(self):
neg_matrix = [
[-self.arr[i][j] for j in range(self.adim)]
for i in range(self.length)
]
return Matrix(neg_matrix)
def __sub__(self,other):
return self + -other