From 51b8115fc103774169419b2a8350bbfc03f40958 Mon Sep 17 00:00:00 2001 From: insideoutclub Date: Fri, 5 Sep 2014 10:34:21 -0700 Subject: [PATCH] Update algorithms.qbk Fixed the spelling of "old-fashioned". --- doc/reference/algorithms.qbk | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/reference/algorithms.qbk b/doc/reference/algorithms.qbk index ce4b140..8dcd848 100644 --- a/doc/reference/algorithms.qbk +++ b/doc/reference/algorithms.qbk @@ -63,7 +63,7 @@ std::vector vec = ...; boost::erase(vec, boost::unique(boost::sort(vec))); `` -Notice the use of `boost::return_found_end`. What if we wanted to erase all the duplicates except one of them? In old-fashined STL-programming we might write +Notice the use of `boost::return_found_end`. What if we wanted to erase all the duplicates except one of them? In old-fashioned STL-programming we might write `` // assume 'vec' is already sorted