@@ -214,7 +214,7 @@ def matrix_rational_echelon_form_multimodular(Matrix self, height_guess=None, pr
214214 ....: randint(1, 2^entry_size) if integer_coefficient else ZZ(randint(1, 2^entry_size))/randint(1, 2^entry_size)
215215 ....: for col in range(num_col)] for row in range(num_row)])
216216 ....: data=[]
217- ....: for algorithm in ("flint_fflu ", "flint_multimodular ", "padic", "multimodular"):
217+ ....: for algorithm in ("flint:fflu ", "flint:multimodular ", "padic", "multimodular"):
218218 ....: # classical is too slow
219219 ....: B = copy.copy(A)
220220 ....: t = walltime()
@@ -228,14 +228,14 @@ def matrix_rational_echelon_form_multimodular(Matrix self, height_guess=None, pr
228228 ....: data.append((round(walltime(t), 4), algorithm))
229229 ....: return sorted(data)
230230 sage: benchmark(20, 20, 10000) # long time
231- [...'flint_multimodular '...'multimodular'...'flint_fflu '...]
231+ [...'flint:multimodular '...'multimodular'...'flint:fflu '...]
232232 sage: benchmark(39, 40, 200) # long time
233- [...'flint_multimodular '...'flint_fflu '...'multimodular'...]
233+ [...'flint:multimodular '...'flint:fflu '...'multimodular'...]
234234
235235 In older versions of flint
236236 before this `issue <https://github.com/flintlib/flint/issues/2129>`_
237237 is fixed, ``algorithm='flint'`` (automatic choice) may be slower than
238- ``algorithm='flint_multimodular '``.
238+ ``algorithm='flint:multimodular '``.
239239
240240 In this case, there are more columns than rows, which means the resulting
241241 matrix has height much higher than the input matrix. We check that the function
0 commit comments