|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r54983 - in sandbox: cloneable/libs/cloneable/test monotonic/boost/monotonic monotonic/libs/monotonic/doc/html monotonic/libs/monotonic/doc/html/monotonic_storage
From: christian.schladetsch_at_[hidden]
Date: 2009-07-16 17:10:59
Author: cschladetsch
Date: 2009-07-16 17:10:58 EDT (Thu, 16 Jul 2009)
New Revision: 54983
URL: http://svn.boost.org/trac/boost/changeset/54983
Log:
commented-out test code from header, added docs.
Text files modified:
sandbox/cloneable/libs/cloneable/test/tests.cpp | 2 +-
sandbox/monotonic/boost/monotonic/storage.hpp | 3 ++-
sandbox/monotonic/libs/monotonic/doc/html/index.html | 12 ++++++------
sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/change_log.html | 4 ++--
sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/containers.html | 4 ++--
sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html | 8 ++++----
6 files changed, 17 insertions(+), 16 deletions(-)
Modified: sandbox/cloneable/libs/cloneable/test/tests.cpp
==============================================================================
--- sandbox/cloneable/libs/cloneable/test/tests.cpp (original)
+++ sandbox/cloneable/libs/cloneable/test/tests.cpp 2009-07-16 17:10:58 EDT (Thu, 16 Jul 2009)
@@ -23,7 +23,7 @@
#include <boost/cloneable/clone.hpp>
#include <boost/cloneable/vector.hpp>
-#include <boost/cloneable/list.hpp>`
+#include <boost/cloneable/list.hpp>
#include <boost/cloneable/map.hpp>
#include <boost/cloneable/set.hpp>
#include <boost/cloneable/heterogenous_map.hpp>
Modified: sandbox/monotonic/boost/monotonic/storage.hpp
==============================================================================
--- sandbox/monotonic/boost/monotonic/storage.hpp (original)
+++ sandbox/monotonic/boost/monotonic/storage.hpp 2009-07-16 17:10:58 EDT (Thu, 16 Jul 2009)
@@ -93,6 +93,7 @@
chain.clear();
}
+/*
struct Allocation
{
size_t cursor;
@@ -146,7 +147,7 @@
//void *ptr = from_heap(num_bytes, alignment);
//return Allocation(&chain.front(), restore_point, ptr);
}
-
+*/
public:
void *allocate(size_t num_bytes, size_t alignment = 1)
{
Modified: sandbox/monotonic/libs/monotonic/doc/html/index.html
==============================================================================
--- sandbox/monotonic/libs/monotonic/doc/html/index.html (original)
+++ sandbox/monotonic/libs/monotonic/doc/html/index.html 2009-07-16 17:10:58 EDT (Thu, 16 Jul 2009)
@@ -28,7 +28,7 @@
</h3></div></div></div>
<div><p class="copyright">Copyright © 2009 Christian Schladetsch</p></div>
<div><div class="legalnotice" title="Legal Notice">
-<a name="id661122"></a><p>
+<a name="id668376"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -65,7 +65,7 @@
The library provides a means for allocation to come from the BSS, stack, or
the heap, or transparently from a combination of the BSS, stack and heap. Allocation
is fast, because de-allocation does nothing
- <sup>[<a name="id661163" href="#ftn.id661163" class="footnote">1</a>]</sup>
+ <sup>[<a name="id668417" href="#ftn.id668417" class="footnote">1</a>]</sup>
. As such, the amount of storage used by a monotonic allocator can only ever
increase - hence the name of the library. A LIFO allocation model is also provided.
</p>
@@ -79,7 +79,7 @@
<span class="bold"><strong>Boost.Monotonic</strong></span> is generally used where performace
is a key concern, but there are many use-cases where use of this library provides
new functionality
- <sup>[<a name="id661207" href="#ftn.id661207" class="footnote">2</a>]</sup>
+ <sup>[<a name="id668461" href="#ftn.id668461" class="footnote">2</a>]</sup>
.
</p>
<p>
@@ -115,16 +115,16 @@
</div>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id661163" href="#id661163" class="para">1</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id668417" href="#id668417" class="para">1</a>] </sup>
except for <code class="computeroutput"><span class="identifier">monotonic</span><span class="special">::</span><span class="identifier">stack</span><span class="special"><></span></code>
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id661207" href="#id661207" class="para">2</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id668461" href="#id668461" class="para">2</a>] </sup>
such as in self- or mutually-recursive algorithms
</p></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: July 08, 2009 at 20:00:33 GMT</small></p></td>
+<td align="left"><p><small>Last revised: July 08, 2009 at 20:26:03 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
Modified: sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/change_log.html
==============================================================================
--- sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/change_log.html (original)
+++ sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/change_log.html 2009-07-16 17:10:58 EDT (Thu, 16 Jul 2009)
@@ -27,14 +27,14 @@
<a name="monotonic_storage.change_log"></a><a class="link" href="change_log.html" title="Change Log"> Change Log</a>
</h2></div></div></div>
<a name="monotonic_storage.change_log.version_0_4"></a><h4>
-<a name="id661264"></a>
+<a name="id668518"></a>
<a class="link" href="change_log.html#monotonic_storage.change_log.version_0_4">Version 0.4</a>
</h4>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Added reclaimable storage
</li></ul></div>
<a name="monotonic_storage.change_log.version_0_3"></a><h4>
-<a name="id661284"></a>
+<a name="id668538"></a>
<a class="link" href="change_log.html#monotonic_storage.change_log.version_0_3">Version 0.3</a>
</h4>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
Modified: sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/containers.html
==============================================================================
--- sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/containers.html (original)
+++ sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/containers.html 2009-07-16 17:10:58 EDT (Thu, 16 Jul 2009)
@@ -29,7 +29,7 @@
<p>
Along with an allocator, storage and stack system, the Monotonic library provides
a set of containers that use stateful monotonic allocators
- <sup>[<a name="id667493" href="#ftn.id667493" class="footnote">5</a>]</sup>
+ <sup>[<a name="id674786" href="#ftn.id674786" class="footnote">5</a>]</sup>
.
</p>
<p>
@@ -86,7 +86,7 @@
</h3></div></div></div></div>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id667493" href="#id667493" class="para">5</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id674786" href="#id674786" class="para">5</a>] </sup>
these are based on boost::interprocess::containers
</p></div>
</div>
Modified: sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html
==============================================================================
--- sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html (original)
+++ sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html 2009-07-16 17:10:58 EDT (Thu, 16 Jul 2009)
@@ -231,7 +231,7 @@
directly and wherever we want efficient resource management. Using a <code class="computeroutput"><span class="identifier">monotonic</span><span class="special">::</span><span class="identifier">stack</span><span class="special"><></span></code>
gives you a first-class C++ stack which you can use at will, pass as an argument
or return as a result
- <sup>[<a name="id666094" href="#ftn.id666094" class="footnote">3</a>]</sup>
+ <sup>[<a name="id673387" href="#ftn.id673387" class="footnote">3</a>]</sup>
.
</p>
<p>
@@ -347,7 +347,7 @@
<tr><td align="left" valign="top"><p>
Copying <code class="computeroutput"><span class="identifier">stack</span><span class="special"><></span></code>
objects performs a slicing copy. To safely copy general stacks, use <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">cloneable</span><span class="special">::</span><span class="identifier">stack</span><span class="special"><></span></code>
- <sup>[<a name="id667266" href="#ftn.id667266" class="footnote">4</a>]</sup>
+ <sup>[<a name="id674560" href="#ftn.id674560" class="footnote">4</a>]</sup>
instead
</p></td></tr>
</table></div>
@@ -393,10 +393,10 @@
</div>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id666094" href="#id666094" class="para">3</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id673387" href="#id673387" class="para">3</a>] </sup>
To avoid slicing copies, use Boost.Cloneable.Stack
</p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id667266" href="#id667266" class="para">4</a>] </sup>
+<div class="footnote"><p><sup>[<a name="ftn.id674560" href="#id674560" class="para">4</a>] </sup>
TODO
</p></div>
</div>
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk