1了解python2和python3類的區(qū)別
python2在2.4之前使用的是經(jīng)典類, 2.4之后, 使用的是新式類

class Foo:
pass

class Foo(object):
pass

MRO: method resolution order 方法的查找順序

class Base:
pass

class Base1:
def chi():
pass

class Bar(Base, Base1):
pass

b = Bar() # Bar -> Base -> Base1
b.chi()


2. 經(jīng)典類的MRO 樹形結(jié)構(gòu)的深度優(yōu)先遍歷 -> 樹形結(jié)構(gòu)遍歷

3. 新式類的MRO C3算法(難點(diǎn), 重點(diǎn))
1. 拆分
2. 合并

用頭和身體比較

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55

class?A: ????pass class?B(A): ????pass class?C(A): ????pass class?D(B, C): ????pass class?E(C, A): ????pass class?F(D, E): ????pass class?M: ????pass class?N(M): ????pass class?P(E, A): ????pass class?X: ????pass class?Q(P,N,X): ????pass class?G(Q, F): ????pass class?H(G, F): ????pass # L(A) = A # L(B) = B + L(A) + A # L(C) = C + L(A) + A # L(D) = D + L(B) + L(C) + BC # L(E) = E + L(C) + L(A) + CA # L(F) = F + L(D) + L(E) + DE # L(M) = M # L(N) = N + L(M) + M # L(P) = P + L(E) + L(A) + EA # L(X) = X # L(Q) = Q + L(P) + L(N) + L(X) +PNX # L(G) = G + L(Q) + L(F) + QF # L(H) = H + L(G) + L(F) + GF # # # L(A) = A # L(B) = B + L(A) + A???????????? # BA # L(C) = C + L(A) + A???????????? # CA # L(D) = D + L(B) + L(C) + BC???? # DBCA # L(E) = E + L(C) + L(A) + CA???? # ECA # L(F) = F + L(D) + L(E) + DE???? # FDBECA # L(M) = M # L(N) = N + L(M) + M???????????? # NM # L(P) = P + L(E) + L(A) + EA???? # PECA # L(X) = X # L(Q) = Q + L(P) + L(N) + L(X) +PNX? # QPECANMX # L(G) = G + L(Q) + L(F) + QF???? # GQPFDBECANMX # L(H) = H + L(G) + L(F) + GF???? # HGQPFDBECANMX

　　

轉(zhuǎn)載于:https://www.cnblogs.com/heheda123456/p/10204827.html

總結(jié)

以上是生活随笔為你收集整理的mro c3算法的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。