C3算法

时间 2019-12-13

标签 c3 算法栏目 C&C++ 繁體版

原文原文链接

面向对象的多继承python

先找左，再找右算法

class A(object):
    pass


class B(object):
    def f1(self):
        print('B')


class C(A,B):
    pass

obj = C()

obj.f1()

经典类对象

新式类blog

经典类和新式类的查找成员的顺序不同。继承

经典类，一条道走到黑（深度优先）。class

新式类，C3算法实现object

class A(object):
    pass

class B(A):
    pass

class C(B):
    pass

class D(object):
    pass

class E(D,C):
    pass

class F(object):
    pass

class G(F):
    pass

class H(C,G):
    pass

class Foo(E,H):
    pass


# print(E.__mro__)
# print(H.__mro__)
"""
L(Foo + L(E)  + L(H) )



L(E) = E,D,C,B,A,object
L(H) = H,C,B,A,G,F,object

Foo = (object) + (G,F,object)
Foo,E,D,H,C,B,A,G,F,object
"""
print(Foo.__mro__)