From d42bf5fc0b8298306d177842766eed482219a414 Mon Sep 17 00:00:00 2001 From: Charlotte Brandt Date: Tue, 17 Dec 2024 17:34:14 +0100 Subject: [PATCH] replace the last findi_val_opt --- .../affineEquality/sparseImplementation/listMatrix.ml | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml b/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml index fd073c4721..1751d364f9 100644 --- a/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml +++ b/src/cdomains/affineEquality/sparseImplementation/listMatrix.ml @@ -263,12 +263,12 @@ module ListMatrix: AbstractMatrix = (* Both input matrices must be in rref form! *) let is_covered_by m1 m2 = let rec is_linearly_independent_rref v m = - let pivot_opt = V.findi_val_opt ((<>:) A.zero) v in + let pivot_opt = V.find_first_non_zero v in match pivot_opt with | None -> false (* When we found no pivot, the vector is already A.zero. *) | Some (pivot_id, pivot) -> let m' = List.drop_while (fun v2 -> - match V.findi_val_opt ((<>:) A.zero) v2 with + match V.find_first_non_zero v2 with | None -> true (* In this case, m2 only has zero rows after that *) | Some (idx', _) -> idx' < pivot_id ) m in @@ -283,7 +283,7 @@ module ListMatrix: AbstractMatrix = match m1 with | [] -> true | v1::vs1 -> - let first_non_zero = V.findi_val_opt ((<>:) A.zero) v1 in + let first_non_zero = V.find_first_non_zero v1 in match first_non_zero with | None -> true (* vs1 must also be zero-vectors because of rref *) | Some (idx, _) ->