C++ Templates: The Complete Guide

相似文件 换一批

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

本帖隐藏的内容

C ++Templates.rar (725.2 KB, 需要: 5 个论坛币) 本附件包括：

• C ++Templates.chm

2017-1-9 06:01:36 上传

需要: 5 个论坛币  [购买]

1. Publisher:        Addison-Wesley Professional
   
2. Categories:        Addison Wesley , The Complete Guide
   
3. Author:        David Vandevoorde
   
4. Edition:        1
   
5. ISBN-10:        0201734842
   
6. ISBN-13:        9780201734843
   
7. Pages:        552
   
8. Published:        Nov 22 2002
   
9. Posted:        Jun 30 2016
   
10. Language:        English
    
11. Book format:        CHM
    
12. Book size:        0.72 MB

复制代码

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏1 回帖

关键词：Templates Complete Template Guide plate

1. 3.1.1 Declaration of Class Templates
   
2. Declaring class templates is similar to declaring function templates: Before the declaration, a statement declares an identifier as a type parameter. Again, T is usually used as an identifier:
   
3. 
   
4. template <typename T>
   
5. class Stack {
   
6.   …
   
7. };
   
8. Here again, the keyword class can be used instead of typename:
   
9. 
   
10. template <class T>
    
11. class Stack {
    
12.   …
    
13. };
    
14. Inside the class template, T can be used just like any other type to declare members and member functions. In this example, T is used to declare the type of the elements as vector of Ts, to declare push() as a member function that gets a constant T reference as an argument, and to declare top() as a function that returns a T:
    
15. 
    
16. template <typename T>
    
17. class Stack {
    
18.   private:
    
19.     std::vector<T> elems;  // elements
    
20. 
    
21.   public:
    
22.     Stack();               // constructor
    
23.     void push(T const&);   // push element
    
24.     void pop();            // pop element
    
25.     T top() const;         // return top element
    
26. };

复制代码

1. 3.1.2 Implementation of Member Functions
   
2. To define a member function of a class template, you have to specify that it is a function template, and you have to use the full type qualification of the class template. Thus, the implementation of the member function push() for type Stack<T> looks like this:
   
3. 
   
4. template <typename T>
   
5. void Stack<T>::push (T const& elem)
   
6. {
   
7.     elems.push_back(elem);    // append copy of passed elem
   
8. }
   
9. In this case, push_back() of the element vector is called, which appends the element at the end of the vector.
   
10. 
    
11. Note that pop_back() of a vector removes the last element but doesn't return it. The reason for this behavior is exception safety. It is impossible to implement a completely exception-safe version of pop() that returns the removed element (this topic was first discussed by Tom Cargill in [CargillExceptionSafety] and is discussed as Item 10 in [SutterExceptional]). However, ignoring this danger, we could implement a pop() that returns the element just removed. To do this, we simply use T to declare a local variable of the element type:
    
12. 
    
13. template<typename T>
    
14. T Stack<T>::pop ()
    
15. {
    
16.     if (elems.empty()) {
    
17.         throw std::out_of_range("Stack<>::pop(): empty stack");
    
18.     }
    
19.     T elem = elems.back();    // save copy of last element
    
20.     elems.pop_back();         // remove last element
    
21.     return elem;              // return copy of saved element
    
22. }

复制代码

看看。。。谢谢分享！！！

......