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
Bug in IncidenceStructure.dual_design #16032
Comments
Branch: u/ncohen/16032 |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Commit: |
comment:3
What is the bug in question? |
comment:4
there is a bug in the optional test: the line 422 in
actually, it's weird that the patch is:
without it, the test
fails. |
comment:5
Yoooooooo !
Nononono, I meant this "algorithm=gap" to be an argument of the function I tests, i.e. And I rename this
The standard of the bugs I fix is MUCH higher than the bugs that are not fixed in combinat, really. If THIS is a bug their code should not even be allowed to run
Well, as I said above the "algorithm=gap" was intended for the Aaaaaaaaaaaaaand I added this Nathann |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:7
OK! |
Reviewer: Dima Pasechnik |
comment:8
You don't mind my removing this "if", do you ? Nathann |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:
|
comment:10
shouldn't these matrices be created sparse? |
comment:11
Ahahaha. Yes of course. Do I change that ? This code is awful, I am already happy to see those two "for" reverted in order to avoid a useless test. Mathematicians should not write code, all they care about is whether the code can be read like a mathematical proof, and efficiency can go to hell. Nathann |
comment:12
Replying to @nathanncohen:
yes please...
they can be taught to write good code, IMHO :) |
comment:13
Yooooooo !
Done !
Probably. But most of your efforts will be wasted, and in the meantime you have to re-do the work when they turn their back. Nathann |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Changed branch from u/ncohen/16032 to |
* develop: (155 commits) Updated Sage version to 6.2.beta6 32-bit fix typo fixing fix int/long doctest trac sagemath#16032: These matrices should be sparse trac 16032: This can be simplified... :-P Correct typo in sage/symbolic/ring.pyx. Put comment in the code and add more examples. trac sagemath#16032: reviewer's remarks FiniteStateMachine.__add__ is the same as __or__ trac sagemath#16032: Bug in IncidenceStructure.dual_design final edits more changes -- please check if I got your algorithm right, Travis Review changes from Ben. further optimizations Fixed KR doctest and documentation of q_dimension. Fixes for q-dims for general highest weight crystals. more optimizations Partial work for general HW crystals. Review changes and (minor) optimizations. ...
As the title says.
With some other improvements.
The original code seems to have been written by a mathematician.
Nathann
CC: @dimpase
Component: combinatorics
Author: Nathann Cohen
Branch/Commit:
f6da4b7
Reviewer: Dima Pasechnik
Issue created by migration from https://trac.sagemath.org/ticket/16032
The text was updated successfully, but these errors were encountered: