We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
This patch will speed up computation of join matrix in lattices. On 1024-element Boolean lattice
H = Posets.BooleanLattice(10).hasse_diagram() H.relabel(lambda x: x+1) # To clear possible caches. P = Poset(H)
Before/after the patch:
1 loops, best of 1: 2.86 s per loop 1 loops, best of 1: 1.23 s per loop
Time to count join-semilattices from all 9-element bounded posets drops from 710 ms to 278 ms.
CC: @tscrim
Component: combinatorics
Author: Jori Mäntysalo
Branch/Commit: 672cee2
672cee2
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/21882
The text was updated successfully, but these errors were encountered:
Branch: u/jmantysalo/faster-join
Sorry, something went wrong.
Basically same change as in #21109.
New commits:
Faster join().
Commit: 672cee2
LGTM.
Changed branch from u/jmantysalo/faster-join to 672cee2
6df171b
No branches or pull requests
This patch will speed up computation of join matrix in lattices. On 1024-element Boolean lattice
Before/after the patch:
Time to count join-semilattices from all 9-element bounded posets drops from 710 ms to 278 ms.
CC: @tscrim
Component: combinatorics
Author: Jori Mäntysalo
Branch/Commit:
672cee2
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/21882
The text was updated successfully, but these errors were encountered: