Hey everyone, From a quick look-over of the code, it seems like we can always run a topological sort on the elements list passed into FinitePoset without any significant pentality (and should solve the equality issue), or better yet, push that into the linear_extension() method. There doesn't appear to be any linear extension code that is based on the ordering of the elements being passed into FinitePoset. I haven't looked too deeply into it but I could likely do so over the weekend and maybe come up with a working branch. If it's not so simple, I'd be happy to work on this at Days64 too.
Also Nathann, just for the record, I'm very tempted to not work on this based upon your comments because I don't want to make it seem like I'm rewarding your behavior. However, I will do so because I want Jori to continue to develop for posets and I want to improve the overall quality of Sage. I'm sorry if I'm being a complete ass here. I want you to be a part of the Sage community because you are a good programmer, but the continuous attacks you are doing really irritates me. Best, Travis -- 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 http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
