|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r53845 - in sandbox/monotonic/libs/monotonic: doc test
From: christian.schladetsch_at_[hidden]
Date: 2009-06-12 22:52:07
Author: cschladetsch
Date: 2009-06-12 22:52:06 EDT (Fri, 12 Jun 2009)
New Revision: 53845
URL: http://svn.boost.org/trac/boost/changeset/53845
Log:
removed /Zi from release build :(, updated documentation.
Text files modified:
sandbox/monotonic/libs/monotonic/doc/index.html | 27 +++++++++++++++++----------
sandbox/monotonic/libs/monotonic/test/main.cpp | 4 ++--
sandbox/monotonic/libs/monotonic/test/monotonic.vcproj | 6 +++++-
3 files changed, 24 insertions(+), 13 deletions(-)
Modified: sandbox/monotonic/libs/monotonic/doc/index.html
Modified: sandbox/monotonic/libs/monotonic/test/main.cpp
Modified: sandbox/monotonic/libs/monotonic/test/monotonic.vcproj
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
==============================================================================
--- sandbox/monotonic/libs/monotonic/doc/index.html (original)
+++ sandbox/monotonic/libs/monotonic/doc/index.html 2009-06-12 22:52:06 EDT (Fri, 12 Jun 2009)
@@ -24,13 +24,13 @@
<th class="docinfo-name">
Version:</th>
<td>
- Unversioned, still just in vault</td>
+ 0.1a</td>
</tr>
<tr class="field">
<th class="docinfo-name">
License:</th>
<td class="field-body">
- None.</td>
+ Distributed under the Boost Software License, Version 1.0.</td>
</tr>
</tbody>
</table>
@@ -38,9 +38,9 @@
<h1>
Boost.Monotonic</h1>
<p>
- Boost.Monotonic is an implementation of container allocators that use a given,
- fixed-size storage buffer.
- This buffer can be on the heap, or the stack.</p>
+ Boost.Monotonic is an implementation of an allocator that use a given,
+ fixed-size storage buffer. This buffer can be on the heap, or the stack, and may
+ be shared by multiple containers.</p>
<h2 id="Motivation">
Motivation
</h2>
@@ -52,7 +52,7 @@
There are many uses for such a system, including per-frame containers and
efficient containers for use in recursion. </p>
<p>
- It is the fastest allocation system theoretically possible, with the downside
+ It is a fast allocation system, with the downside
that the resident set size can only grow in size. Hence the proposed name of a
"monotonic" allocator.
</p>
@@ -60,10 +60,9 @@
Proposal
</h2>
<p>
- The source code resides at <a href="http://www.boostpro.com/vault/index.php?action=downloadfile&filename=MonotonicAllocator.zip&directory=&"
- target="_blank">http://www.boostpro.com/vault/
+ The source code resides in the boost sandbox.</p>
<p>
- This is a constant-time, stack-based STL-compliant allocator with the following
+ This is a constant-time, stack-based STL-compliant[1] allocator with the following
properties: </p>
<ul>
<li>Space for objects is pre-allocated. This can be on the heap <strong>or</strong>
@@ -83,7 +82,8 @@
<li>Cache coherency is high </li>
</ul>
</li>
- <li>Allocation is lightening-fast as it only involves advancing a pointer </li>
+ <li>Allocation is lightening-fast as it only involves advancing a pointer and
+ possible alignment.</li>
<li>Deallocation is even faster as it does absolutely nothing </li>
<li>Different containers can share the same storage </li>
</ul>
@@ -268,6 +268,13 @@
</div>
<div id="reference" class="section">
<h2>
+ Notes</h2>
+ <p>
+ [1] It can be argued that the proposed allocator is not in fact "STL-compliant",
+ as it includes a pointer to storage used by the allocator. This can be addressed
+ either by changing the standard to allow an allocator to store a pointer, or by
+ removing this pointer and using a global pointer-to-storage.</p>
+ <h2>
References</h2>
<ul class="simple">
<li><none></li>
==============================================================================
--- sandbox/monotonic/libs/monotonic/test/main.cpp (original)
+++ sandbox/monotonic/libs/monotonic/test/main.cpp 2009-06-12 22:52:06 EDT (Fri, 12 Jun 2009)
@@ -343,7 +343,7 @@
for (int n = 0; n < outter_loops; ++n)
{
test_map_list_impl_mono(inner_loops, storage);
- storage.reset();
+ storage.reset(); ///<<< reset the memory usage to zero
}
double e0 = t0.elapsed();
cout << "test_map_list: mono: " << e0 << endl;
@@ -359,10 +359,10 @@
int main()
{
+ test_alignment();
test_speed();
test_speed_heap();
test_map_list_realtime();
- test_alignment();
test_basic();
test_copy();
test_ctors();
==============================================================================
--- sandbox/monotonic/libs/monotonic/test/monotonic.vcproj (original)
+++ sandbox/monotonic/libs/monotonic/test/monotonic.vcproj 2009-06-12 22:52:06 EDT (Fri, 12 Jun 2009)
@@ -121,7 +121,7 @@
EnableFunctionLevelLinking="true"
UsePrecompiledHeader="0"
WarningLevel="3"
- DebugInformationFormat="3"
+ DebugInformationFormat="0"
/>
<Tool
Name="VCManagedResourceCompilerTool"
@@ -216,6 +216,10 @@
</Filter>
</Filter>
<File
+ RelativePath="..\doc\index.html"
+ >
+ </File>
+ <File
RelativePath=".\main.cpp"
>
</File>