In https://trac.sagemath.org/ticket/23873 I was innocently trying to be mathematically correct and let the method to_noncrossing_partition of DyckWords return a set partition, instead of a nested list.
Christian warned me that there might be a performance penalty. He was right, with the patch 90% of the time is spent in constructing the set partition from the list of lists. With https://trac.sagemath.org/ticket/23877 I modify SetPartition to actually use the parameter check=False, which then skips the containment check. This saves some of the time, but not all that much. The problem is actually, that creating a "Set" is awfully slow. I am afraid (and I really hope that I am wrong) that this is because creating a parent is very time consuming. Can someone enlighten me? Martin -- 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 sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
