I was just playing with posets. Let L=Posets(7). Then
len([x for x in L if x.is_lattice()])
takes about two times more time than
len([x for x in L if x.is_bounded() and x.is_lattice()])
Is this just some marginal and uninterestin case, or is algorithm badly
chosen, or is is_lattice() meant to be used in situations where posets
usually are bounded?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
"sage-devel" 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-devel.
For more options, visit https://groups.google.com/d/optout.
