-
-
Notifications
You must be signed in to change notification settings - Fork 596
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
backend_polymake: Work around polymake bug with zero inequalities over quadratic extensions #22723
Comments
Commit: |
Dependencies: #22683 |
Last 10 new commits:
|
This comment has been minimized.
This comment has been minimized.
Author: Matthias Koeppe |
comment:6
Your check doesn't result in any speedup when the list passes as it has to check every element and has to double check when it fails. I think you're better off just running the filter directly: ieqs = [ v for v in list if not all(self._is_zero(x) for x in v) ] The other option would be a more hybrid approach like this: for i,v in enumerate(ieqs):
if all(self._is_zero(x) for x in v):
ieqs = ieqs[:i] + [v for v in ieqs[i+1:] if all(self._is_zero(x) for x in v))
break Although I think always filtering is best because it is the simplest code-wise. |
Branch pushed to git repo; I updated commit sha1. Last 10 new commits:
|
comment:8
Thanks. I agree. I've simplified the code. |
comment:9
LGTM. Thanks. |
Reviewer: Travis Scrimshaw |
Following up on #22683:
Easy workaround for a segfault, as discussed and suggested at
https://forum.polymake.org/viewtopic.php?f=8&t=547
See also: #22710: Meta-ticket: polymake
Depends on #22683
CC: @tscrim
Component: geometry
Keywords: polymake
Author: Matthias Koeppe
Branch/Commit:
93af258
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/22723
The text was updated successfully, but these errors were encountered: