From 37190f4fe6ddbc6b59a6e91a29ec51fe2df2c6fa Mon Sep 17 00:00:00 2001 From: CopperCableIsolator Date: Thu, 19 Dec 2024 16:44:54 +0100 Subject: [PATCH] assert_rref --- .../affineEquality/sparseImplementation/listMatrix.ml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml b/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml index 6e7affc654..f5e91f092d 100644 --- a/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml +++ b/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml @@ -151,7 +151,7 @@ module ListMatrix: AbstractMatrix = let init_with_vec v = [v] - + let normalize m = let col_count = num_cols m in let dec_mat_2D (m : t) (row_idx : int) (col_idx : int) : t = @@ -268,7 +268,7 @@ module ListMatrix: AbstractMatrix = Some (insert_v_according_to_piv m normalized_v idx pivot_positions) let rref_vec m v = Timing.wrap "rref_vec" (rref_vec m) v - + (* This should yield the same result as appending m2 to m1, normalizing and removing zero rows. However, it is usually faster. *) (* Both input matrices are assumed to be in rref form *) let rref_matrix (m1 : t) (m2 : t) =