前面我们介绍了异质链表, 现在, 我们继续来深究其应用, 我们可以把Integer, Point, Rectange的对象看成是包装好的消息, 下面我们来看看如何将消息塞入消息队列, 并从消息队列中取出。 顺便说一下, 消息队列在实际开发中是非常常见的, 我们经常需要把任务推入消息队列、从消息队列中取出。 是该上代码了(为了简便起见, 我没有考虑堆内存的释放):
#include <iostream>
using namespace std;
// 对象的id值
typedef enum
{
ErrorId = -1,
IntegerId = 1,
PointId = 2,
RectangeId = 3,
}ObjectID;
// 基类
struct Basic
{
ObjectID id;
virtual Basic *copy() = 0; // 纯虚函数
};
// 整数类
struct Integer : public Basic
{
int a;
Basic *copy()
{
Integer *p = new Integer;
p->a = ((Integer*)this)->a;
p->id = ((Integer*)this)->id;
return p;
}
};
// 点类
struct Point : public Basic
{
int x;
int y;
Basic *copy()
{
Point *p = new Point;
p->x = ((Point*)this)->x;
p->y = ((Point*)this)->y;
p->id = ((Point*)this)->id;
return p;
}
};
// 矩形类
struct Rectangle : public Basic
{
Point point;
int width;
int height;
Basic *copy()
{
Rectangle *p = new Rectangle;
p->point.x = ((Rectangle*)this)->point.x;
p->point.y = ((Rectangle*)this)->point.y;
p->width = ((Rectangle*)this)->width;
p->height = ((Rectangle*)this)->height;
p->id = ((Rectangle*)this)->id;
return p;
}
};
// 抽象对象的共同点, 构造成新的结点, 便于链接
typedef struct node
{
node *next;
Basic *pBasic;
}Node;
Node *head = NULL; // 指向第一结点(采用不带头结点的链表)
// 往链式消息队列中塞消息
Node *addToMsgQueue(Basic* pb)
{
Node *pn = new Node;
Node *qn = NULL;
Basic *p = pb->copy(); // 多态性
if(NULL == head)
{
head = pn;
}
else
{
qn = head;
while(NULL != qn->next)
{
qn = qn->next;
}
qn->next = pn;
}
pn->pBasic = p; // 千万别忘记啊
pn->next = NULL; // 千万别忘记啊
return head;
}
// 从链式消息队列中取出消息(结点)
Node *getMsgFromQueue()
{
if(NULL == head)
{
return NULL;
}
Node *pn = head;
head = head->next;
return pn;
}
// 注意: A模块要和B模块商量好
int main()
{
/* A模块 */
// 定义三个对象并赋值
Integer i;
Point po;
Rectangle rect;
i.id = IntegerId;
po.id = PointId;
rect.id = RectangeId;
i.a = 11;
po.x = 22;
po.y = 33;
rect.point.x = 44;
rect.point.y = 55;
rect.width = 66;
rect.height = 77;
// 塞入消息队列
addToMsgQueue(&i);
addToMsgQueue(&po);
addToMsgQueue(&rect);
addToMsgQueue(&i);
addToMsgQueue(&po);
addToMsgQueue(&rect);
/* B模块 */
Node *p = NULL;
// 从消息队列中取出消息
while(1)
{
p = getMsgFromQueue();
if(NULL == p)
{
// 这里最好睡眠一下
continue;
}
// 基于A,B模块商量的结果, 对指针进行还原
switch(p->pBasic->id)
{
case IntegerId:
{
cout << ((Integer*)(p->pBasic))->a << endl;
break;
}
case PointId:
{
cout << ((Point *)(p->pBasic))->x << endl;
cout << ((Point *)(p->pBasic))->y << endl;
break;
}
case RectangeId:
{
cout << ((Rectangle *)(p->pBasic))->point.x << endl;
cout << ((Rectangle *)(p->pBasic))->point.y << endl;
cout << ((Rectangle *)(p->pBasic))->width << endl;
cout << ((Rectangle *)(p->pBasic))->height << endl;
break;
}
default:
{
break;
}
}
}
return 0;
}
结果为:
11
22
33
44
55
66
77
11
22
33
44
55
66
77