diff --git a/doc/acknowledgments.html b/doc/acknowledgments.html index e4829282..c6f5fa79 100644 --- a/doc/acknowledgments.html +++ b/doc/acknowledgments.html @@ -53,7 +53,7 @@ http://www.boost.org/LICENSE_1_0.txt) Beman Dawes who got the boost serialization ball rolling. It was one or both of these two that invented the much beloved & syntax used to implement both save and - load in one fuction specification. + load in one function specification.
  • Vladimir Prus for evaluating an early draft and contributing the diamond inheritance example.
  • William E. Kempf diff --git a/doc/archive_reference.html b/doc/archive_reference.html index 24c09f95..311db299 100644 --- a/doc/archive_reference.html +++ b/doc/archive_reference.html @@ -41,7 +41,7 @@ class must implement in order to be used to serialize Our discussion will focus on archives used for saving as the hierarchy is exactly analogous for archives used for loading data. -

    Minimum Requirments

    +

    Minimum Requirements

    The simplest class which will model the Archive concept specifies the functions that a class will look like: @@ -271,7 +271,7 @@ exception. Exhaustive testing of the library requires testing the different aspects of object serialization with each archive. There are 46 different tests that can run with any archive. There are 5 "standard archives" included with the system. -(3 in systems that don't support wide charactor i/o). +(3 in systems that don't support wide character i/o).

    In addition, there are 28 other tests which aren't related to any particular archive class.

    @@ -323,7 +323,7 @@ library_test --toolset=gcc -sBOOST_ARCHIVE_LIST=portable_binary_archive.hpp All archives described so far are implemented as templates. Code to save and load data to archives is regenerated for each combination of archive class and data type. -Under these cirumstances, a good optimizing compiler that can expand +Under these circumstances, a good optimizing compiler that can expand inline functions to enough depth will generate fast code. However: