責(zé)任鏈表的本質(zhì)是:將可能處理一個(gè)請求的對象鏈接成一個(gè)鏈,并將請求在這個(gè)鏈上傳遞,直到有對象處理該請求(可能需要提供一個(gè)默認(rèn)處理所有請求的類)
UML結(jié)構(gòu)圖:
任鏈表模式.jpg)
這個(gè)模式也比較簡單,沒太多值得說得,復(fù)制了這里的內(nèi)容:http://blog.csdn.net/lcl_data/article/details/9042739
辛辛苦苦了工作了一年,終于可以加薪了,向主管提交了加薪申請,主管一看不得了,自己職權(quán)不夠,批不了,主管把申請上交總監(jiān),總監(jiān)發(fā)現(xiàn)自己也批不了,申請到了總經(jīng)理手中,總經(jīng)理一看,小伙子口氣不小了,有膽識敢申請,先來談下心。
#include <iostream>
#include <string>
using namespace std;
// 請求
class Request
{
public:
int m_nNumber;
};
// 管理者
class Manager
{
public:
Manager(string temp) { name = temp; }
void SetSuccessor(Manager* temp) { manager = temp; }
virtual void GetRequest(Request* request) = 0;
virtual ~Manager() {}
protected:
Manager* manager;
string name;
};
// 經(jīng)理
class CommonManager : public Manager
{
public:
CommonManager(string strTemp) : Manager(strTemp) {}
virtual void GetRequest(Request* request);
~CommonManager() final {};
};
void CommonManager::GetRequest(Request* request)
{
if (request->m_nNumber>=0 && request->m_nNumber<1000)
{
cout << name << " 處理了請求: " << request->m_nNumber << endl;
}
else
{
manager->GetRequest(request);
}
}
// 總監(jiān)
class Majordomo : public Manager
{
public:
Majordomo(string strTemp) : Manager(strTemp) {}
virtual void GetRequest(Request* request);
};
void Majordomo::GetRequest(Request* request)
{
if (request->m_nNumber <= 5000)
{
cout << name << " 處理了請求: " << request->m_nNumber << endl;
}else
{
manager->GetRequest(request);
}
}
//總經(jīng)理
class GeneralManager: public Manager
{
public:
GeneralManager(string name):Manager(name) {}
virtual void GetRequest(Request* request) //總經(jīng)理可以處理所有請求
{
cout << name << " 處理了請求: " << request->m_nNumber << endl;
}
};
int main(){
Manager* common = new CommonManager("張經(jīng)理");
Manager* major = new Majordomo("李總監(jiān)");
GeneralManager* general = new GeneralManager("趙總");
common->SetSuccessor(major);
major->SetSuccessor(general);
Request* rq = new Request();
rq->m_nNumber = 999;
common->GetRequest(rq);
rq->m_nNumber = 4999;
common->GetRequest(rq);
rq->m_nNumber = 6999;
common->GetRequest(rq);
delete rq;
delete major;
delete common;
delete general;
return 0;
}