Aad*_*Ura 7 python graph method-resolution-order python-3.x
我正在阅读这篇文章然后我发现了这个stackoverflow问题,但在这个问题上,一些像Alex Martelli这样的程序员说它采用了深度优先的方法,所以现在我有很大的疑问.
例:
class H():
def m(self):
print("H")
class G(H):
def m(self):
print("G")
super().m()
class I(G):
def m(self):
print("I")
super().m()
class F(H):
def m(self):
print("F")
super().m()
class E(H):
def m(self):
print("E")
super().m()
class D(F):
def m(self):
print("D")
super().m()
class C(E, F, G):
def m(self):
print("C")
super().m()
class B():
def m(self):
print("B")
super().m()
class A(B, C, D):
def m(self):
print("A")
super().m()
x = A()
x.m()
Run Code Online (Sandbox Code Playgroud)
因此,如果我在MRO上构建图表基础,那么根据深度优先,它应该遵循:
和路径应该是:
A - >乙 - "ç - >电子 - >的F - "G - > d - >ħ
但如果你运行上面的代码,你会得到:
A
B
C
E
D
F
G
H
Run Code Online (Sandbox Code Playgroud)
因为它遵循这条道路:
A - >乙 - "ç - >电子 - > d - >的F - "G - >ħ
现在我对节点"D"或类"D"的深度感到困惑,首先它是在早些时候出现的,而在MRO中,它后来发生了什么?
和路径应该是:
A - >乙 - "ç - >电子 - >的F - "G - > d - >ħ
F不能在D之前出现 - 这将是一个矛盾 - 见D级.
C3线性化算法的工作方式,你必须线性化父母,然后,只要没有矛盾,你就可以线性化孩子.所以我从父母那里开始一次线性化这一个.大多数都是微不足道的,直到我们到达C然后A:
class PrettyType(type):
"""make the repr of the classes look nice when finally listed"""
def __repr__(self):
return self.__name__
# subclasses of O will also have the metaclass:
class O(metaclass=PrettyType): 'O, object'
class H(O): 'H, O, object'
# H's parent is O
class G(H): 'G, H, O, object'
# G's linearization is itself followed by its parent's linearization.
class I(G): 'I, G, H, O, object'
# I's linearization is I followed by G's
class F(H): 'F, H, O, object'
class E(H): 'E, H, O, object'
class D(F): 'D, F, H, O, object'
class C(E, F, G): 'C, E, F, G, H, O, object'
# C's linearization is C followed by a consistent linearization of
# its parents, left to right.
# First C, then E - then you might be tempted to put H after E,
# but H must come after F and G (see class F and G)
# so we try F's linearization, noting that H comes after G,
# so we try G's linearization, H then consistently comes next, then object
class B(O): 'B, O, object'
Run Code Online (Sandbox Code Playgroud)
A是:
class A(B, C, D): 'A, B, C, E, D, F, G, H, O, object'
# final complex case - ^--^ can't go from E to F
# D must come before F (see class D)
# ^--^ After D, can do F,
# then finish with C's MRO
# with no contradictions
Run Code Online (Sandbox Code Playgroud)
正如我将其解释的那样,3条准则是:
正如我所说的那样,算法是你从左到右尊重父母,但是除非你得到一个被孩子阻挡的共同父母(例如F被其孩子阻挡,D),否则首先要深入了解父母,在这种情况下,你会看到对于其他候选人(D然后,不是一个矛盾,很好,那么你可以选择F和C的MRO的其余部分.)
>>> A.mro()
[A, B, C, E, D, F, G, H, O, <class 'object'>]
Run Code Online (Sandbox Code Playgroud)
我们可以通过避免矛盾来完成线性化.
再次,