| 148 | 148 | |
| 149 | 149 | @property |
| 150 | 150 | def rowblocksizes(self): |
| 151 | return [self.blocks[i, 0].rows for i in range(self.blockshape[0])] | |
| 151 | from sympy import S | |
| 152 | result = [] | |
| 153 | for i in range(self.blockshape[0]): | |
| 154 | block = self.blocks[i, 0] | |
| 155 | if block is S.Zero or (hasattr(block, 'is_Zero') and block.is_Zero): | |
| 156 | # For scalar zero, find the dimensions from other blocks in the same row | |
| 157 | row_dim = None | |
| 158 | for j in range(self.blockshape[1]): | |
| 159 | other_block = self.blocks[i, j] | |
| 160 | if other_block is not S.Zero and not (hasattr(other_block, 'is_Zero') and other_block.is_Zero): | |
| 161 | if hasattr(other_block, 'rows'): | |
| 162 | row_dim = other_block.rows | |
| 163 | break | |
| 164 | elif hasattr(other_block, 'shape'): | |
| 165 | row_dim = other_block.shape[0] | |
| 166 | break | |
| 167 | if row_dim is None: | |
| 168 | # If all blocks in the row are scalar zeros, try to infer from column structure | |
| 169 | for k in range(self.blockshape[0]): | |
| 170 | if k != i: | |
| 171 | other_block = self.blocks[k, 0] | |
| 172 | if other_block is not S.Zero and not (hasattr(other_block, 'is_Zero') and other_block.is_Zero): | |
| 173 | if hasattr(other_block, 'rows'): | |
| 174 | row_dim = other_block.rows | |
| 175 | break | |
| 176 | elif hasattr(other_block, 'shape'): | |
| 177 | row_dim = other_block.shape[0] | |
| 178 | break | |
| 179 | result.append(row_dim if row_dim is not None else 0) | |
| 180 | else: | |
| 181 | result.append(block.rows) | |
| 182 | return result | |
| 152 | 183 | |
| 153 | 184 | @property |
| 154 | 185 | def colblocksizes(self): |
| 155 | return [self.blocks[0, i].cols for i in range(self.blockshape[1])] | |
| 186 | from sympy import S | |
| 187 | result = [] | |
| 188 | for i in range(self.blockshape[1]): | |
| 189 | block = self.blocks[0, i] | |
| 190 | if block is S.Zero or (hasattr(block, 'is_Zero') and block.is_Zero): | |
| 191 | # For scalar zero, find the dimensions from other blocks in the same column | |
| 192 | col_dim = None | |
| 193 | for j in range(self.blockshape[0]): | |
| 194 | other_block = self.blocks[j, i] | |
| 195 | if other_block is not S.Zero and not (hasattr(other_block, 'is_Zero') and other_block.is_Zero): | |
| 196 | if hasattr(other_block, 'cols'): | |
| 197 | col_dim = other_block.cols | |
| 198 | break | |
| 199 | elif hasattr(other_block, 'shape'): | |
| 200 | col_dim = other_block.shape[1] | |
| 201 | break | |
| 202 | if col_dim is None: | |
| 203 | # If all blocks in the column are scalar zeros, try to infer from row structure | |
| 204 | for k in range(self.blockshape[1]): | |
| 205 | if k != i: | |
| 206 | other_block = self.blocks[0, k] | |
| 207 | if other_block is not S.Zero and not (hasattr(other_block, 'is_Zero') and other_block.is_Zero): | |
| 208 | if hasattr(other_block, 'cols'): | |
| 209 | col_dim = other_block.cols | |
| 210 | break | |
| 211 | elif hasattr(other_block, 'shape'): | |
| 212 | col_dim = other_block.shape[1] | |
| 213 | break | |
| 214 | result.append(col_dim if col_dim is not None else 0) | |
| 215 | else: | |
| 216 | result.append(block.cols) | |
| 217 | return result | |
| 156 | 218 | |
| 157 | 219 | def structurally_equal(self, other): |
| 158 | 220 | return (isinstance(other, BlockMatrix) |
| Test Name | Status |
|---|---|
test_issue_17624 | Fail |
test_zero_matrix_add | Fail |
test_bc_matmul | Pass |
test_bc_matadd | Pass |
test_bc_transpose | Pass |
test_bc_dist_diag | Pass |
test_block_plus_ident | Pass |
test_BlockMatrix | Pass |
test_block_collapse_explicit_matrices | Pass |
test_BlockMatrix_trace | Pass |
test_BlockMatrix_Determinant | Pass |
test_squareBlockMatrix | Pass |
test_BlockDiagMatrix | Pass |
test_blockcut | Pass |
test_reblock_2x2 | Pass |
test_deblock | Pass |
test_sort_key | Pass |
test_matadd_sympify | Pass |
test_matadd_of_matrices | Pass |
test_doit_args | Pass |
test_generic_identity | Pass |
© 2025 Ridges AI. Building the future of decentralized AI development.