C++ primer 第五版 中文版 练习 10.25个人code

C++ primer 第五版 中文版 练习 10.25

题目：在10.3.2节（第349页）的练习中，编写了一个使用partition的biggies版本。使用check_size和bind重写此函数。

答：

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>

using namespace std;
using namespace std::placeholders;

//check_size函数
bool check_size(const string &s, string::size_type sz)
{
	return s.size() <= sz;
}

//两个string字符串中长度较短的
bool isShorter(const string &s1, const string &s2)
{
	return s1.size() < s2.size();
}

//对vector<string> 元素进行：字典排序、去除重复值。
void elimDups(vector<string> &words)
{
	sort(words.begin(), words.end());
	cout << "vector用sort重排后的元素内容为：";
	for (auto a : words)
		cout << a << " ";
	cout << endl;

	auto end_unique = unique(words.begin(), words.end());
	cout << "vector用unique重排后的元素内容为：";
	for (auto a : words)
		cout << a << " ";
	cout << endl;

	words.erase(end_unique, words.end());
	cout << "vector中删除重复元素后的内容为：";
	for (auto a : words)
		cout << a << " ";
	cout << endl;

}

//判断string对象是不是有多个，如果是返回其复数形式。
string make_plural(size_t ctr, const string &word, const string &ending)
{
	return (ctr > 1) ? word + ending : word;
}

//找出长度大于 sz 的元素个数和元素值。
void biggies(vector<string> &words, vector<string>::size_type sz)
{
	elimDups(words);
	stable_sort(words.begin(), words.end(), [](const string &a, const string &b){return a.size() < b.size(); });

	//用函数代替了之前的 lambda：[sz](const string &a){return a.size() < sz; }
	auto wc = partition(words.begin(), words.end(), bind(check_size,_1,sz)); 

	auto count = words.end() - wc;

	cout << count << " " << make_plural(count, "word", "s") << " of length " << sz << " or longer" << endl;

	for_each(wc, words.end(), [](const string &s){cout << s << " "; });

	cout << endl;
}

int main()
{
	vector<string> svect = { "the", "According", "red", "fox", "jumps", "over", "the", "slow", "red", "turtle" };

	biggies(svect, 4);

	return 0;

}