#13250: Additional poset examples
---------------------------------+------------------------------
Reporter: csar | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.11
Component: combinatorics | Resolution:
Keywords: sd40 | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Dependencies:
Stopgaps: |
---------------------------------+------------------------------
Comment (by ncohen):
Hellooooooo !!!
> So `cls.mro()` returns the method resolution order (MRO for short),
which is the sequences of superclasses of the type (class) `cls` in some
linear order that used to in order to determine which method to call. The
MRO is used to solve what is known as the diamond problem with multiple
inheritance. All things in python will have one since all objects have one
and everything is an object. Also `cls.mro()` is equivalent (up to tuple
-> list) to calling `cls.__mro__`. In short, it does exactly as it says it
does because `posets` is a class.
Hmmmmm... Well, what I wondered about is what was such a method (with a
shortened name, while we would usually write "method_resolution_order")
was doing in Poset. I mean, not in Poset, but as it really is related to
Sage's implementation of whatever it implements more than to what the
Poset means as a mathematical object, I thought that we would have stuck
with `_mro_` instead. Hidden function, as user don't care much `O_o`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/13250#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/groups/opt_out.
