Subject: [Boost-commit] svn:boost r53884 - sandbox/monotonic/libs/monotonic/doc
From: christian.schladetsch_at_[hidden]
Date: 2009-06-13 22:03:07
Author: cschladetsch
Date: 2009-06-13 22:03:07 EDT (Sat, 13 Jun 2009)
New Revision: 53884
URL: http://svn.boost.org/trac/boost/changeset/53884
Log:
gah VS is a terrible HTML editor!
Text files modified:
sandbox/monotonic/libs/monotonic/doc/index.html | 24 +++++++++++++++---------
1 files changed, 15 insertions(+), 9 deletions(-)
Modified: sandbox/monotonic/libs/monotonic/doc/index.html
==============================================================================
--- sandbox/monotonic/libs/monotonic/doc/index.html (original)
+++ sandbox/monotonic/libs/monotonic/doc/index.html 2009-06-13 22:03:07 EDT (Sat, 13 Jun 2009)
@@ -50,21 +50,27 @@
Motivation
</h2>
<p>
- We would like to use the various STL containers which take their storage from the stack. In
- this way, for example a std::map<K,T> can use storage from the stack rather than
- fragmenting the heap. Also, it would be great if the same storage
- could be used by different containers, and even better if we could chose to use
- the stack or the heap.</p>
+ We would sometimes like to use the various STL containers and use the stack for
+ their storage. In
+ this way, for example, a map<K, list< vector<T> > > can use storage from the stack
+ for the map, the list and the vector, rather than
+ fragmenting the heap. </p>
+ <p>
+ Also, it would be great if the same storage
+ could be used by different containers, and even better if we could choose to use
+ the stack or the heap, and better still if there was zero overhead for the
+ memory allocations.</p>
<p>
- There are many uses for such a system, including per-frame containers,
+ There are many uses for such a system, including very fast and very small data
+ structures, per-frame containers,
efficient use containers for use in recursion, and reducing or removing heap
fragmentation. </p>
<p>
- This is what this library does, by collaborating various allocators with a
+ This is what this library does, by collaborating multiple instances of the same
+ type of allocator with a
common shared storage.
It is a fast allocation system, O(1) to allocate and zero-cost to deallocate; hence the proposed name of a
- "monotonic" allocator.
- </p>
+ "monotonic" allocator. </p>
<h2 id="Proposal">
Quick Example</h2>
<p>