欧美性猛交XXXX免费看蜜桃,成人网18免费韩国,亚洲国产成人精品区综合,欧美日韩一区二区三区高清不卡,亚洲综合一区二区精品久久

泛型編程與設計新思維


作者：徐景周

template<class T1, int Size>class Queue		// 類(lèi)模板，其中T1為類(lèi)型參數，Size為非類(lèi)型參數{ public: 	explicit Queue():size_(Size){};		// 顯式構造，避免隱式轉換	……	template<class T2> void assign(T2 first,T2 last);   // 內嵌函數模板 private:	T* temp_;	int size_;}	// 類(lèi)模板中內嵌函數模板Compare的外圍實(shí)現(如在Queue類(lèi)外實(shí)現)	template<class T1,int Size> template<class T2>	void Queue<T1,Size>::assign (T2 first,T2 last) {};	// 模板的使用方法	int ia[4] = {0,1,2,3};	Queue<int, sizeof(ia)/sizeof(int)> qi;	qi.assign(ai,ai+4);

	template<class InputIterator, class Distance>	void advance(InputIterator& i, Distance n, input_iterator_tag)	{		for(; n>0; --n,++i){}          // InputIterator具有++性	}

	template<class ForwardIterator, class Distance>	void advance(ForwardIterator& i, Distance n,forward_iterator_tag)	{		advance(i, n, input_iterator_tag());	}

	template<class BidirectionalIterator, class Distance>	void advance(BidirectionalIterator& i, Distance n, bidirectional_iterator_tag)	{		if(n>=0)          		// 具有++、--性		  for(; n>0; --n,++i){}		else		  for(; n>0; ++n,--i){}	}

	template<class RandomAccessIterator, class Distance>	void advance(RandomAccessIterator& i, Distance n, random_access_iterator_tag)	{		i += n;          		// 具有++、--、+=等性	}

	struct counter	{		typedef int result_type;		counter(result_type init=0):n(init){}		result_type operator() { return n++;}		result_type n;	}

	template<class Number> struct even        // 函數對象even，找出第一個(gè)偶數	{		bool operator()(Number x) const {return (x&1) == 0;}	}	// 使用算法find_if在區間A到A+N中找到滿(mǎn)足函數對象even的元素	int A[] = {1,0,3,4};	const int N=sizeof(A)/sizeof(int);	find_if(A,A+N, even<int>());

	struct ltstr	{		bool operator()(const char* s1, const char* s2) const		{ return strcmp(s1<s2) < 0;}	};	// 使用函數對象ltstr，輸出set容器中A和B的并集	const int N=3	const char* a[N] = {"xjz","xzh","gh"};	const char* b[N]= {"jzx","zhx","abc"};	set<const char*,ltstr> A(a,a+N);	set<const char*,ltstr> B(b,b+N);	set_union(A.begin(),A.end(),B.begin(),B.end(), 	                     ostream_iterator<const char*>(cout," "), ltstr());

1、vector使用	// 將A中以元素5為分割點(diǎn)，分別排序，使排序后5后面的元素都大于5之前的元素(后區間不排序)，	// 然后輸出int main()	{		int A[] = {7,2,6,4,5,8,9,3,1};		const int N=sizeof(A)/sizeof(int);		vector<int> V(A,A+N);		partial_sort(V,V+5,V+N);		copy(V,V+N,ostream_iterator<int>(cout," "));		cout << endl;	} 	輸出可能是：1 2 3 4 5 8 9 7 62、list使用	// 產(chǎn)生一空l(shuí)ist，插入元素后排序，然后輸出	int main()	{		list<int> L1;		L1.push_back(0);		L1.push_front(1);		L1.insert(++L1.begin,3);		L1.sort();		copy(L1.begin(),L1.end(),ostream_iterator<int>(cout," "));	}	輸出：0 1 33、deque使用	int main()	{		deque<int> Q;		Q.push_back(3);		Q.push_front(1);		Q.insert(Q.begin()+1,2);		Copy(Q.begin(),Q.end(),ostream_iterator<int>(cout," "));	}	輸出：1 2 34、map使用	int main()	{		map<string,int> M;		M.insert(make_pair("A",11);		pair<map<string,int>::iterator, bool> p = M.insert(make_pair("C",5));		if(p.second)			cout << p.first->second<<endl;	}	輸出：55、multiset使用	int main()	{		const int N = 5;		int a[N] = {4,1,1,3,5};		multiset<int> A(a,a+N);		copy(A.begin(),A.end(),ostream_iterator<int>(cout," "));	}	輸出：1 1 3 4 5

// Singleton.h文件中class Singleton{public:static Singleton& Instance(){	if(!pInstance_){		if(destroyed_){       // 引用是否已經(jīng)失效			OnDeadReference();		}		else {			Create();        // 第一次時(shí)創(chuàng  )建實(shí)例		}	}	return *pInstance_;}private:	Singleton();				// 禁止默認構造	Singleton(const Singleton&);		// 禁止拷貝構造	Singleton& operator= (const Singleton&);　    // 禁止賦值操作	static void Create()			// 傳加創(chuàng  )建的實(shí)例引用	{		static Singleton  theInstance;		pInstance_ = &theInstance;	}	static void OnDeadReference()	{		throw std::runtime_error(" 實(shí)例被不正當消毀");	}	virtual  ~Singleton()	{		pInstance- = 0;		destroyed_ = true;	}		static Singleton *pInstance_;	static bool destroyed_;}// Singleton.cpp中靜態(tài)成員變量初始化Singleton* Singleton::pInstance_ = 0;Bool Singleton::destroyed_ = false;

	template	<		class T,		template<class> calss CreationPolicy = CreateUsingNew,		template<class> class LifetimePolicy=DefaultLifetime,	>	classs SingletonHolder	{	public:		static T& Instance()		{			if(!pInstance_)			{				if(destroyed_)					{					LifetimePolicy<T>::OnDeadReference();					destroyed_ = false;				}				pInstance_ = CreationPolicy<T>::Create();				LifetimePolicy<T>::SchedultCall(&DestorySingleton);			}			return *pInstance_;		}	private:		static void DestroySinleton()		{			assert(!destroyed_);			CreationPlicy<T>::Destroy(pInstance_);			pInstance_ = 0;			destroyed_ = true;		}		SingletonHolder();		SingletonHolder (const SingletonHolder &);				SingletonHolder & operator= (const SingletonHolder &);　 				Static T* pInstance_;		Static bool destroyed_;	};

class A{};	typedef SingletonHolder<A, CreateUsingNew> SingleA;

	class A{};	class Derived : public A {};	template<class T> struct MyCreator : public CreateUsingNew<T>	{		static T* Create()		{			return new Derived;		}		static void Destroy(T* pInstance)		{			delete pInstance;		}	}	typedef  SingletonHolder<A,MyCreator> SingleA;

• C++ Primer(第三版) --- 潘愛(ài)民等譯
• Effective C++(第二版) --- 侯捷譯
• More Effective C++ --- 侯捷譯
• Exceptional C++ --- 卓小濤譯
• More Exceptional C++ --- 於春景譯
• 深度探索C++對象模型 --- 侯捷譯
• 泛型編程與STL --- 侯捷譯
• C++ STL程序員開(kāi)發(fā)指南 --- 彭木根等箸
• 設計模式：可復用面向對象軟件的元素 --- 李英軍等譯
• C++設計新思維 --- 侯捷等譯

地址：陜西省西安市勞動(dòng)路90號院(臺板廠(chǎng)家屬院)六單元郵編：710082EMAIL：jingzhou_xu@163.net未來(lái)工作室(Future Studio)