/* The following code example is taken from the book
* "The C++ Standard Library - A Tutorial and Reference, 2nd Edition"
* by Nicolai M. Josuttis, Addison-Wesley, 2012
*
* (C) Copyright Nicolai M. Josuttis 2012.
* Permission to copy, use, modify, sell and distribute this software
* is granted provided this copyright notice appears in all copies.
* This software is provided "as is" without express or implied
* warranty, and with no claim as to its suitability for any purpose.
*/
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
// function object to compare strings
// - allows you to set the comparison criterion at runtime
// - allows you to compare case insensitive
class RuntimeStringCmp
{
public:
// constants for the comparison criterion
enum cmp_mode {normal, nocase};
private:
// actual comparison mode
const cmp_mode mode;
// auxiliary function to compare case insensitive
static bool nocase_compare(char c1, char c2)
{
return toupper(c1) < toupper(c2);
}
public:
// constructor: initializes the comparison criterion
RuntimeStringCmp(cmp_mode m = normal) : mode(m)
{
}
// the comparison
bool operator()(const string& s1, const string& s2) const
{
if (mode == normal) {
return s1 < s2;
} else {
return lexicographical_compare(s1.begin(), s1.end(),
s2.begin(), s2.end(),
nocase_compare);
}
}
};
// container type:
// - map with
// - string keys
// - string values
// - the special comparison object type
typedef map<string, string, RuntimeStringCmp> StringStringMap;
// function that fills and prints such containers
void fillAndPrint(StringStringMap& coll);
int main()
{
// create a container with the default comparison criterion
StringStringMap coll1;
fillAndPrint(coll1);
// create an object for case-insensitive comparisons
RuntimeStringCmp ignorecase(RuntimeStringCmp::nocase);
// create a container with the case-insensitive comparisons criterion
StringStringMap coll2(ignorecase);
fillAndPrint(coll2);
}
void fillAndPrint(StringStringMap& coll)
{
// insert elements in random order
coll["Deutschland"] = "Germany";
coll["deutsch"] = "German";
coll["Haken"] = "snag";
coll["arbeiten"] = "work";
coll["Hund"] = "dog";
coll["gehen"] = "go";
coll["Unternehmen"] = "enterprise";
coll["unternehmen"] = "undertake";
coll["gehen"] = "walk";
coll["Bestatter"] = "undertaker";
// print elements
cout.setf(ios::left, ios::adjustfield);
for (const auto& elem : coll) {
cout << setw(15) << elem.first << " "
<< elem.second << endl;
}
cout << endl;
}
C++标准库（第2版）STL 源码
4星 · 超过85%的资源 需积分: 39 130 浏览量
2018-06-11
09:48:36
上传
评论
收藏 217KB RAR 举报 
C++标准库（第2版）STL 源码 （293个子文件） 
mapcmp1.cpp 3KB refsem1.cpp 3KB sort1.cpp 3KB moneypunct.cpp 2KB sort1.cpp 2KB sorted1.cpp 2KB regex1.cpp 2KB chrono2.cpp 2KB vector1.cpp 2KB setcmp1.cpp 2KB forwardlist1.cpp 2KB loc2.cpp 2KB sequence2.cpp 2KB sum1.cpp 2KB thread1.cpp 2KB regex2.cpp 2KB string1.cpp 2KB async3.cpp 2KB sharedptr3.cpp 2KB gslice1.cpp 2KB list1.cpp 2KB map2.cpp 2KB nthelement1.cpp 2KB condvar2.cpp 2KB set1.cpp 2KB enableshared1.cpp 2KB sharedfuture1.cpp 2KB timeget.cpp 2KB bind1.cpp 2KB lambda6.cpp 2KB promise1.cpp 2KB multimap1.cpp 2KB dist1.cpp 2KB searchn1.cpp 2KB complex1.cpp 2KB fstream1.cpp 2KB innerproduct1.cpp 2KB move1.cpp 2KB multiset1.cpp 2KB indirectarray1.cpp 2KB timeput.cpp 2KB transform2.cpp 2KB rotate2.cpp 2KB slice1.cpp 2KB fill1.cpp 2KB replace2.cpp 2KB ispermutation1.cpp 2KB hashfunc2.cpp 2KB numget.cpp 2KB stringiter1.cpp 2KB algo1old.cpp 2KB search2.cpp 2KB refwrap1.cpp 2KB minmax1.cpp 2KB issorted1.cpp 2KB mismatch1.cpp 2KB stringnumconv1.cpp 2KB find1.cpp 2KB regextokeniter1.cpp 2KB adjacentfind1.cpp 2KB async1.cpp 2KB bind1.cpp 2KB random2.cpp 2KB weakptr2.cpp 2KB findof1.cpp 2KB accumulate1.cpp 2KB prime1.cpp 2KB weakptr1.cpp 2KB reviter3.cpp 2KB remove2.cpp 2KB add1.cpp 2KB lexicocmp1.cpp 2KB unique1.cpp 2KB inserter1.cpp 2KB remove2.cpp 2KB hashfunc1.cpp 2KB transform1.cpp 2KB unordset1.cpp 2KB partialsort2.cpp 2KB sum2.cpp 2KB valarray1.cpp 1KB sharedptr1.cpp 1KB string2.cpp 1KB limits1.cpp 1KB copy1.cpp 1KB random1.cpp 1KB partialsort1.cpp 1KB bounds1.cpp 1KB unique2.cpp 1KB permutation1.cpp 1KB chrono1.cpp 1KB itercategory1.cpp 1KB find2.cpp 1KB tuple1.cpp 1KB findend1.cpp 1KB equal1.cpp 1KB algo1.cpp 1KB regexiter1.cpp 1KB wstring2utf8.cpp 1KB async2.cpp 1KB共 293 条
- 1
- 2
- 3
资源评论
cs2522019-08-14和这本书配套的，没啥问题
简单tl2019-05-22垃圾资源，根本无实现源码，只有应用示例。
aidelong2018-10-30源代码资源，可以参考，谢谢分享
