Make FLINT polynomial factor() interruptible

[remyoudompheng]

📚 Description

This is useful for large degree polynomials.
Currently FLINT factorization of Zmod(n) polynomials for small n cannot be interrupted using Ctrl-C.

📝 Checklist

• I have made sure that the title is self-explanatory and the description concisely explains the PR.
• I have linked an issue or discussion.
• I have created tests covering the changes.
• I have updated the documentation accordingly.

⌛ Dependencies

None

[github-actions]

Documentation preview for this PR is ready! 🎉
Built with commit: 21d1151

[tscrim]

I am a little apprehensive about the test on a fast computer (well, most likely coupled with improvements to FLINT). However, it seems quite overall for now and it is documented what is being tested.

[jaysharma0909]

@tscrim Could you please tell me where can I get the code of gcd algorithms in sagemath

[tscrim]

@its-believe Start with gcd?? and/or import_statements(gcd).

Additionally, this is completely the wrong place to ask such questions.

[videlec]

I am a little apprehensive about the test on a fast computer (well, most likely coupled with improvements to FLINT). However, it seems quite overall for now and it is documented what is being tested.

The factorization of the polynomial of order ~20000 in the test will most likely not terminate in less than a minute

sage: f = R.random_element(1000) * R.random_element(1000)
sage: %time u = f.factor()
Wall time: 1.06 s
sage: f = R.random_element(2000) * R.random_element(2000)
sage: %time u = f.factor()
Wall time: 4.93 s
sage: f = R.random_element(3000) * R.random_element(3000)
sage: %time u = f.factor()
Wall time: 12.5 s