【Accelerated C++】读书笔记(三)

#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> // // 模板函数 /// //可以调用median(vi)从而给median函数一个vector<int>类型的名为vi的对象 template <class T> T median(std::vector<T> v) { //std::vector<T>模板参数的类型::size_type本身也是一个类型 //所以必须加上typename 让系统环境知道应该把这个名称当做一个类型来处理 typedef typename std::vector<T>::size_type vec_sz; vec_sz size = v.size(); if(size == 0) throw std::domain_error("median of an empty vector"); std::sort(v.begin(),v.end()); vec_sz mid = size/2; return size % 2 == 0 ? (v[mid]+v[mid-1]) / 2 : v[mid]; } // /// 五种迭代器 //顺序只读访问 template <class In,class X> In find(In begin,In end, const X& x) { while(begin!=end && *begin != x) ++begin; return begin; } //顺序只写访问 template <class In,class Out> Out copy(In begin,In end,Out,dest) { while(begin != Out) { *dest++ = *begin++; } return dest; } //顺序读-写访问 template <class For,class X> void replace(For beg,For end,const X& x,const X&y) { while(beg != end) { if(*beg == x) *beg = y; ++beg; } } //可逆访问 template <class Bi> void reverse(Bi begin,Bi end) { while(begin != end) { -- end; if(begin != end) swap(*begin++,*end); } } //随机访问 template <class Ran,class X> bool binary_search(Ran begin,Ran end, const X& x) { while(begin < end) { Ran mid = begin +(end-begin) / 2; if(x < *mid) end = mid; else if(*mid <x) begin = mid +1; else return true; } return false; } int main() { std::string s; std::map<std::string,int> counters; while(std::cin >> s) { ++counters[s]; } for(std::map<std::string,int>::const_iterator iter = counters.begin();iter != counters.end(); ++iter) { // iter->first键 - 值 iter->second std::cout << iter->first << "/t" << iter->second << std::endl; } //替代名 使代码更清晰 typedef std::vector<std::string> Rule; typedef std::vector<Rule> Rule_collection; typedef std::vector<Rule_collection> Grammer; return 0; } //增量运算符的优先级与*相同，并且都是右结合，所以 *out++ 与*(out++)一样