summaryrefslogtreecommitdiff
path: root/libs/bimap/doc/quick_tutorial.qbk
diff options
context:
space:
mode:
Diffstat (limited to 'libs/bimap/doc/quick_tutorial.qbk')
-rw-r--r--[-rwxr-xr-x]libs/bimap/doc/quick_tutorial.qbk4
1 files changed, 2 insertions, 2 deletions
diff --git a/libs/bimap/doc/quick_tutorial.qbk b/libs/bimap/doc/quick_tutorial.qbk
index bc14fcd2e..67b127695 100755..100644
--- a/libs/bimap/doc/quick_tutorial.qbk
+++ b/libs/bimap/doc/quick_tutorial.qbk
@@ -80,7 +80,7 @@ __RELATION_AND_PAIR__
[import ../example/step_by_step.cpp]
-A convinience header is avaiable in the boost directory:
+A convenience header is available in the boost directory:
#include <boost/bimap.hpp>
@@ -123,7 +123,7 @@ However dereferencing a `bimap<X,Y>::left_iterator` returns a type that is
bm.left.find(1)->second = "1"; // Compilation error
-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 situtions too. Lets see an example
+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
bm.clear();