Hey everyone,
I just had an idea, and maybe this is more wishful thinking, but I feel
like we should be able to pass a poset/lambda function(s)/class which
contains comparison methods into a parent and have that be able to override
the default ordering (similar to what C++ does in the STL). Something like
this:
sage: g = DiGraph([(0,1),(0,2)])
sage: p = Poset(g)
sage: G = IntegerRingMod(3, ordering=p)
sage: G(0) < G(1)
True
sage: G(0) < G(2)
True
sage: G(1) < G(2)
False
Or for partitions under dominance order (instead of how we currently are
doing them in 13605):
sage: P = Partitions(3, cmp_lt=Partition_class.dominates) # after 13605
this would just be Partition.dominates
sage: P([2,2,1]) < P([3,1,1])
True
Thoughts?
Best,
Travis
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sage-combinat-devel/-/cxHdEtxOcrAJ.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sage-combinat-devel?hl=en.
