diff --git a/doc/Jamfile.v2 b/doc/Jamfile.v2 index 5c470ce..fe7f054 100644 --- a/doc/Jamfile.v2 +++ b/doc/Jamfile.v2 @@ -50,6 +50,8 @@ boostbook standalone : html:boost.root=../../../.. html:boost.libraries=../../../../libs/libraries.htm + html:img.src.path=../../../../doc/html/ + xhtml:img.src.path=../../../../doc/html/ generate.section.toc.level=3 chunk.first.sections=1 pdf:img.src.path=$(images_location)/ diff --git a/doc/container.qbk b/doc/container.qbk index 285e5fd..daec5ce 100644 --- a/doc/container.qbk +++ b/doc/container.qbk @@ -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]