New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Speedup for OA_from_quasi_difference_matrix #16720
Comments
Branch: u/ncohen/16720 |
This comment has been minimized.
This comment has been minimized.
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:4
Hello, I do not understand that
Vincent |
comment:5
Yoooooooo !
Ahem Thaaaaaaaaat's because the rows of the matrix were listed as 111222333 before and now it is 123123123. You don't care about that in an OA or a difference matrix, so it does not matter and it is easier to get this speedup. The function which I had to modify above called this routine, and only needed to remember the first half of the matrix. Formerly. But now that the rows are listed differently, well getting that "half" of the matrix is a bit different I know it is not "semantically correct". Please don't make me rewrite the function for that Nathann |
comment:7
This is clearer. Nathann |
Reviewer: Vincent Delecroix |
comment:8
Ok, good! Vincent |
comment:9
THaaaaaaaaaaaaaaaaaaaaaaanks !! |
Changed branch from u/ncohen/16720 to |
Turns out that the use of a brain is underrated. I should really buy one someday.
This is what happens when you think before writing a loop:
This is what happens when you do not
CC: @videlec
Component: combinatorial designs
Author: Nathann Cohen
Branch/Commit:
41676cf
Reviewer: Vincent Delecroix
Issue created by migration from https://trac.sagemath.org/ticket/16720
The text was updated successfully, but these errors were encountered: