diff --git a/doc/circular_buffer.qbk b/doc/circular_buffer.qbk index 726337a..ef4bf95 100644 --- a/doc/circular_buffer.qbk +++ b/doc/circular_buffer.qbk @@ -46,7 +46,7 @@ [def __min_capacity [memberref boost::circular_buffer_space_optimized::min_capacity() min_capacity]] [def __capacity_control [memberref boost::circular_buffer_space_optimized::capacity_control () capacity_control ]] -[def __debug_support [link circular_buffer.implmentation.debug_support debug support]] +[def __debug_support [link circular_buffer.implementation.debug_support debug support]] [include ../../../tools/auto_index/include/auto_index_helpers.qbk] [/ Must be first included file!] @@ -114,7 +114,7 @@ Here is a simple example to introduce the class __cb. [circular_buffer_example_1] -This example shows contruction, inserting elements, overwriting and popping. +This example shows construction, inserting elements, overwriting and popping. [circular_buffer_example_2] @@ -363,7 +363,7 @@ The __cb is compatible with the [@boost:libs/interprocess/index.html Boost.Inte [/ This should be in @boost:libs/interprocess/doc/index.html ] library used for interprocess communication. Considering that the circular_buffer's debug support relies on 'raw' pointers -(which is not permited by the Interprocess library) +(which is not permitted by the Interprocess library) the code has to compiled with debug support disabled (i.e. with `BOOST_CB_ENABLE_DEBUG` macro not defined or defined to 0). Not doing that will cause the compilation to fail. diff --git a/doc/jamfile.v2 b/doc/jamfile.v2 index ca6e53b..5a7efc4 100644 --- a/doc/jamfile.v2 +++ b/doc/jamfile.v2 @@ -83,8 +83,8 @@ doxygen autodoc # The syntax hoops to jump through are 'interesting' for more than one PREDEFINED, # and to permit spaces within definitions (use double quotes). - # Don't forget that every double quote " needs a preceeding \trip character! - # and that each trailing continuation \ needs a preceeding \trip character too! + # Don't forget that every double quote " needs a preceding \trip character! + # and that each trailing continuation \ needs a preceding \trip character too! # And finally that if more than one item is included (as here) the whole is # enclosed in "PREDEFINED=... ", but without a leading \. Go figure... diff --git a/example/circular_buffer_examples.bat b/example/circular_buffer_examples.bat index 1d005d9..9f6c8f7 100644 --- a/example/circular_buffer_examples.bat +++ b/example/circular_buffer_examples.bat @@ -1,5 +1,5 @@ echo off -rem quickbook doxgen auto-index docs template circular_buffer_html_index.bat +rem quickbook doxygen auto-index docs template circular_buffer_html_index.bat rem echo circular_buffer_html_index_%date%_%time:~0,2%_%time:~3,2%.log rem The DOS time format is assumed 12:34 and the : separator is not used. set t=%time% /T diff --git a/include/boost/circular_buffer/base.hpp b/include/boost/circular_buffer/base.hpp index d5426b5..aae90f5 100644 --- a/include/boost/circular_buffer/base.hpp +++ b/include/boost/circular_buffer/base.hpp @@ -1246,7 +1246,7 @@ public: */ circular_buffer& operator = (circular_buffer&& cb) BOOST_NOEXCEPT { cb.swap(*this); // now `this` holds `cb` - circular_buffer(get_allocator()) // temprary that holds initial `cb` allocator + circular_buffer(get_allocator()) // temporary that holds initial `cb` allocator .swap(cb); // makes `cb` empty return *this; } @@ -2174,7 +2174,7 @@ public: the erased element (towards the beginning). \par Complexity Linear (in std::distance(begin(), pos)). - \note This method is symetric to the erase(iterator) method and is more effective than + \note This method is symmetric to the erase(iterator) method and is more effective than erase(iterator) if the iterator pos is close to the beginning of the circular_buffer. (See the Complexity.) \sa erase(iterator), erase(iterator, iterator), @@ -2215,7 +2215,7 @@ public: the erased range (towards the beginning). \par Complexity Linear (in std::distance(begin(), last)). - \note This method is symetric to the erase(iterator, iterator) method and is more effective than + \note This method is symmetric to the erase(iterator, iterator) method and is more effective than erase(iterator, iterator) if std::distance(begin(), first) is lower that std::distance(last, end()). \sa erase(iterator), erase(iterator, iterator), rerase(iterator), diff --git a/include/boost/circular_buffer/space_optimized.hpp b/include/boost/circular_buffer/space_optimized.hpp index 9a26cc3..73d60c4 100644 --- a/include/boost/circular_buffer/space_optimized.hpp +++ b/include/boost/circular_buffer/space_optimized.hpp @@ -579,7 +579,7 @@ public: */ circular_buffer_space_optimized& operator = (circular_buffer_space_optimized&& cb) BOOST_NOEXCEPT { cb.swap(*this); // now `this` holds `cb` - circular_buffer(get_allocator()) // temprary that holds initial `cb` allocator + circular_buffer(get_allocator()) // temporary that holds initial `cb` allocator .swap(cb); // makes `cb` empty return *this; } diff --git a/test/soft_iterator_invalidation.cpp b/test/soft_iterator_invalidation.cpp index 770179d..9c27173 100644 --- a/test/soft_iterator_invalidation.cpp +++ b/test/soft_iterator_invalidation.cpp @@ -600,7 +600,7 @@ void validity_swap_test() { cb1.swap(cb2); // Although iterators refer to the original elements, - // their interal state is inconsistent and no other operation + // their internal state is inconsistent and no other operation // (except dereferencing) can be invoked on them any more. BOOST_CHECK(*it11 == 1); BOOST_CHECK(*it12 == 2);