日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當(dāng)前位置: 首頁 > 编程语言 > c/c++ >内容正文

c/c++

c++ template笔记(2)模板类

發(fā)布時(shí)間:2025/3/21 c/c++ 23 豆豆
生活随笔 收集整理的這篇文章主要介紹了 c++ template笔记(2)模板类 小編覺得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.

?

1.自定義Stack模板類

#include <vector> #include <stdexcept>template <typename T> class Stack {private:std::vector<T> elems; // elementspublic:void push(T const&); // push elementvoid pop(); // pop elementT top() const; // return top elementbool empty() const { // return whether the stack is emptyreturn elems.empty();} };template <typename T> void Stack<T>::push (T const& elem) {elems.push_back(elem); // append copy of passed elem }template<typename T> void Stack<T>::pop () {if (elems.empty()) {throw std::out_of_range("Stack<>::pop(): empty stack");}elems.pop_back(); // remove last element }template <typename T> T Stack<T>::top () const {if (elems.empty()) {throw std::out_of_range("Stack<>::top(): empty stack");}return elems.back(); // return copy of last element }

測試

#include <iostream> #include <string> #include <cstdlib> #include "stack1.hpp"int main() {try {Stack<int> intStack; // stack of intsStack<std::string> stringStack; // stack of strings// manipulate int stackintStack.push(7);std::cout << intStack.top() << std::endl;// manipulate string stackstringStack.push("hello");std::cout << stringStack.top() << std::endl; stringStack.pop();stringStack.pop();}catch (std::exception const& ex) {std::cerr << "Exception: " << ex.what() << std::endl;return EXIT_FAILURE; // exit program with ERROR status} }

由于多掉了一次pop所以報(bào)錯(cuò)

2.用typdef產(chǎn)生一個(gè)特定模板類別名

比如Stack<int>

typedef Stack<int> IntStack; int main() {IntStack intStack;intStack.push(7);std::cout << intStack.top() << std::endl; }

3.模板類的特化

#include <deque> #include <string> #include <stdexcept> #include "stack1.hpp"template<> class Stack<std::string> {private:std::deque<std::string> elems; // elementspublic:void push(std::string const&); // push elementvoid pop(); // pop elementstd::string top() const; // return top elementbool empty() const { // return whether the stack is emptyreturn elems.empty();} };void Stack<std::string>::push (std::string const& elem) {elems.push_back(elem); // append copy of passed elem }void Stack<std::string>::pop () {if (elems.empty()) {throw std::out_of_range("Stack<std::string>::pop(): empty stack");}elems.pop_back(); // remove last element }std::string Stack<std::string>::top () const {if (elems.empty()) {throw std::out_of_range("Stack<std::string>::top(): empty stack");}return elems.back(); // return copy of last element }

基于模板類之上,對(duì)于特定類型進(jìn)行重新實(shí)現(xiàn),比如上面就是一個(gè)對(duì)std:: string的特例實(shí)現(xiàn),內(nèi)部用deque實(shí)現(xiàn)

測試

#include <iostream> #include <string> #include <cstdlib> #include "stack2.hpp"int main() {try {Stack<int> intStack; // stack of intsStack<std::string> stringStack; // stack of strings// manipulate int stackintStack.push(7);std::cout << intStack.top() << std::endl;intStack.pop();// manipulate string stackstringStack.push("hello");std::cout << stringStack.top() << std::endl; stringStack.pop();stringStack.pop();}catch (std::exception const& ex) {std::cerr << "Exception: " << ex.what() << std::endl;return EXIT_FAILURE; // exit program with ERROR status} }

上面Stack<std::string>使用了特化的類

4.局部特化

若模板類有兩個(gè)參數(shù),那么確定其中一個(gè)參數(shù),另一個(gè)未確定的話,則可以說是局部特化

這些概念與c#的泛型是相同的.

5.預(yù)設(shè)模板

與局部特化概念差不多,但保留了參數(shù),給參數(shù)設(shè)置了一個(gè)默認(rèn)的類型

#include <vector> #include <stdexcept>template <typename T, typename CONT = std::vector<T> > class Stack {private:CONT elems; // elementspublic:void push(T const&); // push elementvoid pop(); // pop elementT top() const; // return top elementbool empty() const { // return whether the stack is emptyreturn elems.empty();} };template <typename T, typename CONT> void Stack<T,CONT>::push (T const& elem) {elems.push_back(elem); // append copy of passed elem }template <typename T, typename CONT> void Stack<T,CONT>::pop () {if (elems.empty()) {throw std::out_of_range("Stack<>::pop(): empty stack");}elems.pop_back(); // remove last element }template <typename T, typename CONT> T Stack<T,CONT>::top () const {if (elems.empty()) {throw std::out_of_range("Stack<>::top(): empty stack");}return elems.back(); // return copy of last element }

示例:這樣如果用默認(rèn)的類型,就可以少指定一個(gè)模板類的類型

#include <iostream> #include <deque> #include <cstdlib> #include "stack3.hpp"int main() {try {// stack of ints:Stack<int> intStack;// stack of doubles which uses a std::deque<> to manage the elementsStack<double,std::deque<double> > dblStack;// manipulate int stackintStack.push(7);std::cout << intStack.top() << std::endl;intStack.pop();// manipulate double stackdblStack.push(42.42);std::cout << dblStack.top() << std::endl; dblStack.pop();dblStack.pop();}catch (std::exception const& ex) {std::cerr << "Exception: " << ex.what() << std::endl;return EXIT_FAILURE; // exit program with ERROR status} }

轉(zhuǎn)載于:https://www.cnblogs.com/Clingingboy/archive/2011/03/08/1977189.html

總結(jié)

以上是生活随笔為你收集整理的c++ template笔记(2)模板类的全部內(nèi)容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò),歡迎將生活随笔推薦給好友。