访问虚函数表+ (多继承)

c++是通过建立多个虚函数表来实现多重继承的。(vs2017)

在这个例子中,当child作为A类型的指针传参数时,传入的时child的地址,当它作为B类型的指针传参数时,传入的时child地址的下一个地址。

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) ((x)<<1)
#define r(x) ((x)<<1|1)
#define lowbit(x) ((x)&(-(x)))
#define abs(x) ((x)>=0?(x):(-(x)))
#define ms(a,b) memset(a,b,sizeof(a))

using namespace std;

class A {
public:
	virtual void getA() {
		cout << "A" << endl;
	}
	virtual void get() {
		cout << "A get" << endl;
	}
};

class B {
public:
	virtual void get() {
		cout << "B get" << endl;
	}
	virtual void getB() {
		cout << "B" << endl;
	}
};

class Child : public A, public B {
public:
	virtual void get() {
		cout << "Child get" << endl;
	}
	virtual void getChild() {
		cout << "Child" << endl;
	}
};

typedef void(*FUNC)();

void outA(A *a) {
	cout << "in A" << endl;
	int *fun = (int *)(*(int*)a);
	for (int i = 0; fun[i] != 0; ++i) {
		printf("function : %d :0X%x->", i, fun[i]);
		FUNC f = (FUNC)fun[i];
		f();
	}
	cout << endl;

	//a->get();
	//a->getA();
}

void outB(B *b) {
	cout << "in B" << endl;
	
	int *fun = (int *)(*(int*)b);
	for (int i = 0; fun[i] != 0; ++i) {
		printf("function : %d :0X%x->", i, fun[i]);
		FUNC f = (FUNC)fun[i];
		f();
	}
	cout << endl;

	//b->get();
	//b->getB();
}

void outChild(Child *child) {
	cout << "in C" << endl;
	int *fun = (int *)(*(int*)child);
	for (int i = 0; fun[i] != 0; ++i) {
		printf("function : %d :0X%x->", i, fun[i]);
		FUNC f = (FUNC)fun[i];
		f();
	}
	cout << endl;

	//c->getC();
}

int main() {
	Child *child = new Child();

	cout << "in begin" << endl;
	int *fun = (int *)(*(int *)child);
	for (int i = 0; fun[i] != 0; ++i) {
		printf("function : %d :0X%x->", i, fun[i]);
		FUNC f = (FUNC)fun[i];
		f();
	}
	cout << endl;

	outA(child);
	outB(child);
	outChild(child);

	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值