Ticket #5955: bimap-docs.patch
| File bimap-docs.patch, 4.2 KB (added by , 10 years ago) |
|---|
-
libs/bimap/doc/quick_tutorial.qbk
80 80 81 81 [import ../example/step_by_step.cpp] 82 82 83 A conv inience header is avaiable in the boost directory:83 A convenience header is available in the boost directory: 84 84 85 85 #include <boost/bimap.hpp> 86 86 … … 123 123 124 124 bm.left.find(1)->second = "1"; // Compilation error 125 125 126 If you insert `(1,"one")` and `(1,"1")` in a `std::map<int,std::string>` the second insertion will have no effect. In a `bimap<X,Y>` both keys have to remain unique. The insertion may fail in other situ tions too. Lets see an example126 If you insert `(1,"one")` and `(1,"1")` in a `std::map<int,std::string>` the second insertion will have no effect. In a `bimap<X,Y>` both keys have to remain unique. The insertion may fail in other situations too. Lets see an example 127 127 128 128 bm.clear(); 129 129 -
libs/bimap/doc/history.qbk
51 51 [ 52 52 Once in Boost, the library switched to the now familiar name 53 53 "Boost.MultiIndex". Late in 2004, it formally became a member of Boost. 54 Joaquin continued to en chance the library and added new features such as54 Joaquin continued to enhance the library and added new features such as 55 55 composite keys and random-access indices. 56 56 ]] 57 57 … … 71 71 72 72 [[2007 - Boost.Bimap] 73 73 [ 74 The formal review took place at the beg gining of the year and Boost.Bimap74 The formal review took place at the beginning of the year and Boost.Bimap 75 75 was accepted in Boost. 76 76 ]] 77 77 ] -
libs/bimap/doc/compiler_specifics.qbk
41 41 42 42 [h2 VS 7.1] 43 43 44 If a .cpp file uses more than four different sbimaps the compiler will run44 If a .cpp file uses more than four different bimaps the compiler will run 45 45 out of symbols and issue an internal compiler error. The official solution 46 46 in msdn is to split the .cpp in several files or upgrade your compiler. 47 47 -
libs/bimap/doc/tutorial.qbk
246 246 [heading Countries Populations] 247 247 248 248 We want to store countries populations. 249 The requ eriments are:249 The requirements are: 250 250 251 # Get a list of countries in decre sing order of their populations.252 # Given a countr ie, get their population.251 # Get a list of countries in decreasing order of their populations. 252 # Given a country, get their population. 253 253 254 Lets create the approp iate bimap.254 Lets create the appropriate bimap. 255 255 256 256 typedef bimap< 257 257 … … 768 768 [code_user_defined_names_untagged_version] 769 769 770 770 In Boost.Bimap there is a better way to document the code and 771 in the meantime helping you to write more ma ntainable and readable code.771 in the meantime helping you to write more maintainable and readable code. 772 772 You can tag the two collections of the bimap so they can be 773 773 accessed by more descriptive names. 774 774 … … 954 954 Additionally, the type of this two parameters can be tagged to specify 955 955 user defined names instead of the usual `member_at::-Side-` tags. 956 956 957 The possible sway to use the first parameter are:957 The possible way to use the first parameter are: 958 958 959 959 bimap< Type, R > 960 960 -
libs/bimap/doc/bimap_and_boost.qbk
36 36 types can be used as key. There is a library in Boost that already 37 37 allows the creation of this kind of container: Boost.MultiIndex. It 38 38 offers great flexibility and lets you construct almost any container 39 that you could dream of. The framework is very clean. You migh want to39 that you could dream of. The framework is very clean. You might want to 40 40 read this library's tutorial to learn about the power that has been 41 41 achieved. 42 42
