Speed up powering a matrix by a large exponent when its minimal polynomial is small - #6495
Open
fingolfin wants to merge 3 commits into
Open
Speed up powering a matrix by a large exponent when its minimal polynomial is small#6495fingolfin wants to merge 3 commits into
fingolfin wants to merge 3 commits into
Codecov / codecov/project
succeeded
Aug 17, 2026 in 1s
78.97% (-0.07%) compared to eeef4dc
View this Pull Request on Codecov
78.97% (-0.07%) compared to eeef4dc
Details
Codecov Report
❌ Patch coverage is 97.69231% with 3 lines in your changes missing coverage. Please review.
✅ Project coverage is 78.97%. Comparing base (eeef4dc) to head (6eddee3).
| Files with missing lines | Patch % | Lines |
|---|---|---|
| lib/matrix.gi | 97.69% | 3 Missing |
Additional details and impacted files
@@ Coverage Diff @@
## master #6495 +/- ##
==========================================
- Coverage 79.03% 78.97% -0.07%
==========================================
Files 685 685
Lines 293805 294269 +464
Branches 8664 8646 -18
==========================================
+ Hits 232220 232403 +183
- Misses 59786 60063 +277
- Partials 1799 1803 +4 ☔ View full report in Codecov by Harness.
📢 Have feedback on the report? Share it here.
🚀 New features to boost your workflow:
- ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.
- 📦 JS Bundle Analysis: Save yourself from yourself by tracking and limiting bundle sizes in JS merges.
Loading