Removed unused images from documentation and fixed some qbk [endsect] tags.

[SVN r83727]
This commit is contained in:
Ion Gaztañaga
2013-04-02 22:42:58 +00:00
parent 754736c83f
commit e6828a448a
2 changed files with 4 additions and 1 deletions

View File

@@ -50,6 +50,8 @@ boostbook standalone
:
<format>html:<xsl:param>boost.root=../../../..
<format>html:<xsl:param>boost.libraries=../../../../libs/libraries.htm
<format>html:<xsl:param>img.src.path=../../../../doc/html/
<format>xhtml:<xsl:param>img.src.path=../../../../doc/html/
<xsl:param>generate.section.toc.level=3
<xsl:param>chunk.first.sections=1
<format>pdf:<xsl:param>img.src.path=$(images_location)/

View File

@@ -253,7 +253,7 @@ can a stable design approach the behavior of `vector` (random access iterators,
insertion/deletion, minimal memory overhead, etc.)?
The following image describes the layout of a possible data structure upon which to base the design of a stable vector:
[$images/stable_vector.png [width 50%] [align center] ]
[$../../libs/container/doc/html/images/stable_vector.png [width 50%] [align center] ]
Each element is stored in its own separate node. All the nodes are referenced from a contiguous array of pointers, but
also every node contains an "up" pointer referring back to the associated array cell. This up pointer is the key element
@@ -667,6 +667,7 @@ use [*Boost.Container]? There are several reasons for that:
[@https://svn.boost.org/trac/boost/ticket/7969 #7969],
[@https://svn.boost.org/trac/boost/ticket/8118 #8118],
[@https://svn.boost.org/trac/boost/ticket/8294 #8294].
[endsect]
[section:release_notes_boost_1_53_00 Boost 1.53 Release]