added python sat prange

Author: Floyd Zweydinger

decoding/matrix.py

@@ -21,7 +21,7 @@ def __getitem__(self, tup):
         assert x < self.nrows and y < self.ncols
         return self.data[x][y]
 
-    def print(self, tranpose: bool = False):
+    def print(self, transpose: bool = False):
         """ printing """
         print("nrows:", self.nrows, ", ncols:", self.ncols)
         for i in range(self.nrows):
@@ -101,7 +101,7 @@ def gauß(self, max_rank: Union[int, None] = None) -> int:
             if sel == -1:
                 return row
 
-            self.__swap_rows(sel, row)
+            self.swap_rows(sel, row)
 
             # solve remaining coordinates
             for i in range(self.nrows):
@@ -172,7 +172,7 @@ def popcnt_col(self, col: int) -> int:
             t += self.data[j][col]
         return t
 
-    def __swap_rows(self, i: int, j: int) -> None:
+    def swap_rows(self, i: int, j: int) -> None:
         """ swap the rows i and j """
         assert i < self.nrows and j < self.nrows
         if i == j: return
@@ -181,7 +181,7 @@ def __swap_rows(self, i: int, j: int) -> None:
             self.data[i][k] = self.data[j][k]
             self.data[j][k] = tmp
 
-    def __swap_cols(self, i: int, j: int) -> None:
+    def swap_cols(self, i: int, j: int) -> None:
         """ swap the cols i and j """
         assert i < self.ncols and j < self.ncols
         if i == j: return