#17216: Poset / LatticePoset: [meet|join]matrix algorithm
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers: Nathann Cohen
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/poset___latticeposet___meet_join_matrix_algorithm|
a649be931b249028ff1e5961fc948c2daf50c695
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
About speedup: For example after `P7=Posets(7).list()` it took 630 ms to
run `sum([P.is_lattice() for P in P7])`, after this patch 280 ms. Same can
be seen in several test runs.
Suggestion of code formatting is good.
When is `is_lattice()` on category tried to run? I don't quite understand
--- what happens if both `finite_posets.py` on categories and `posets.py`
on combinats define same function?
--
Ticket URL: <http://trac.sagemath.org/ticket/17216#comment:13>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
