c++ 容器类 迭代器类实例 输入一组字符串，找出出现的次数

/*
 * Character12.cpp
 *
 *  Created on: 2014-3-21
 *      Author: Administrator
 */
#include <iostream>
#include <cstring>
#include <valarray>
#include <string>
#include <list>
#include <Cstring>
#include <memory>
#include <set>
#include <map>
#include <vector>
#include <sstream>
#include <algorithm>
#include <exception>

using namespace std;
void showStr(string str) {
	cout << str << " ";
}
void showmap(pair<string, int> p) {
	cout << p.first << " " << p.second;
}
char toLow(char ch) {
	return tolower(ch); //为什么tolower不能做函数指针呢
}
string& transStr(string& str) {
	transform(str.begin(), str.end(), str.begin(), toLow);
	return str;
}
bool coutIf(string& str) {
	cout << str << " ";
	return true;
}
int main() {
	//给vector输值
	vector<string> orginValue;
	string cinStr;
	cin >> cinStr;
	while (cinStr != "quite") {
		orginValue.push_back(cinStr);
		cin >> cinStr;
	}
	cout << "orgin value:" << endl;
	for_each(orginValue.begin(), orginValue.end(), showStr);
	//从vector中找出不同的，并把有大写的转成小写的
	set<string> setStr;
	//insert_iterator<set<string> >(setStr, setStr.begin()) //匿名类 调用插入迭代器的构造方法
	transform(orginValue.begin(), orginValue.end(), insert_iterator<set<string> >(setStr, setStr.begin()), transStr);
	cout << endl << "set value:" << endl;
	for_each(setStr.begin(), setStr.end(), showStr);

	//统计次数
	map<string, int> result;
	set<string>::iterator sit;
	for (sit = setStr.begin(); sit != setStr.end(); sit++) {
		result[*sit] = count(orginValue.begin(), orginValue.end(), *sit);
	}
	cout << endl << "map value:" << endl;
	for_each(result.begin(), result.end(), showmap);
	return 0;

}