#18760: Posets: Slightly faster is_lattice()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.8
Component: combinatorics | Resolution:
Keywords: posets | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/posets__slightly_faster_is_lattice__|
48bd0ff4c629af3002fb5f1dc7d926963ef2a057
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
After `P8=Posets(8).list()` time for
{{{
len([L for L in P8 if L.is_lattice()])
}}}
drop from 1,36 seconds to 0,63 seconds (factor more than two, which should
not happen, but I guess it is random noise). And after
{{{
P=Posets.BooleanLattice(10)
P1=Poset(P)
}}}
time for
{{{
P1.is_lattice()
}}}
drops from 5,91 to 3,84 seconds.
--
Ticket URL: <http://trac.sagemath.org/ticket/18760#comment:7>
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.
