STL代码

1 从标准输入设备读入文本数据，并予以断行；对数据排序；将排序后数据写到标准输出设备上。
int main() {
vector<string> vec;
string tmp;
while(getline(cin, tmp))
vec.push_back(tmp);
sort(vec.begin(), v.end());
//sort(vec.begin(), vec.end(), greater<string>());
copy(vec.begin(), v.end(), ostream_iterator<string>(cout, "\n"));
}
简化
int main() {
istream_iterator<string> it1(cin);
istream_iterator<string> it2;
vector<string> vec(it1, it2);
sort(vec.begin(), vec.end());
copy(vec.begin(), vec.end(), ostream_iterator<string>(cout, "\n"));
}


2 提高sort string的效率，使用字符串表格
struct strtab_cmp
{
typedef vector<char>::iterator strtab_iter;
bool operator() (const pair<strtab_iter, strtab_iter> & x,
const pair<strtab_iter, strtab_iter> &y) const {
return lexicographical_compare(x.first, x.second, y.first, y.second);
}
};


struct strtab_print
{
ostream& out;
strtab_print(ostream& os) : out(os) {}
typedef vector<char>::iterator strtab_iter;
void operator()(const pair<strtab_iter, strtab_iter> & s) const {
copy(s.first, s.second, ostream_iterator<char>(out));
}

};

int main()
{
vector<char> strtab;
char c;

while(cin.get(c))
strtab.push_back(c);

typedef vector<char>::iterator strtab_iter;
vector<pair<strtab_iter, strtab_iter>> lines;
strtab_iter start = strtab.begin();
while(start != strtab.end()) {
strtab_iter next = find(start, strtab.end(), '\n');
if(next != strtab.end())
++next;
lines.push_back(make_pair(start, next));
start = next;
}

sort(lines.begin(), lines.end(), strtab_cmp());
for_each(lines.begin(), lines.end(), strtab_print(cout));
}


3 外覆类，让旧的数据结构和泛型算法相互作用
template <class Node>
struct node_wrap {
Node *ptr;
node_wrap(Node* p = 0) : ptr(p) {};
NOde& operator*() const {return *ptr;}
Node* operator->() const {return ptr;}
node_wrap& operator++() {ptr=ptr->next; return *this;}
node_wrap operator++(int) { node_wrap tmp=*this; ++*this; return tmp;}
bool operator==(const node_wrap& i) const {return ptr == i.ptr;}
bool operator!=(const node_wrap& i) const {return ptr != i.ptr;}
};


4 function object或functor
比函数的优势，可以拥有局部状态
struct last_name_is
{
string value;
last_name_is(const string &val) : value(val) {}
bool operator()(const Person &x) const {
return x.last_name == value;
}
}
find_if(fisrt, last, last_name_is("Smith"))