Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r71464 - sandbox/mm_ptr/libs/smart_ptr/doc
From: phil_at_[hidden]
Date: 2011-04-24 12:57:51

Author: pbouchard
Date: 2011-04-24 12:57:50 EDT (Sun, 24 Apr 2011)
New Revision: 71464
URL: http://svn.boost.org/trac/boost/changeset/71464

Log:
* Renamed isolated mm to set
Text files modified:
   sandbox/mm_ptr/libs/smart_ptr/doc/rationale.html | 28 ++++++++++++++--------------
   sandbox/mm_ptr/libs/smart_ptr/doc/tutorial.html | 2 +-
   2 files changed, 15 insertions(+), 15 deletions(-)

Modified: sandbox/mm_ptr/libs/smart_ptr/doc/rationale.html
==============================================================================
--- sandbox/mm_ptr/libs/smart_ptr/doc/rationale.html (original)
+++ sandbox/mm_ptr/libs/smart_ptr/doc/rationale.html 2011-04-24 12:57:50 EDT (Sun, 24 Apr 2011)
@@ -71,9 +71,9 @@

 <h2><a name="introduction" id="introduction"></a>Introduction</h2>

- Memory Managed Pointer introduces the concept of mm where it is defined to be a one or many memory blocks referencing each other allocated on the heap pointed
- to by one or many mm_ptr<T>s allocated on the stack or the data segment (non heap) of the application. Each mm is consequently composed of a
- list of all memory blocks constituting it and a counter tracking the number of times the mm is referenced by a mm_ptr<T> from the stack or the data
+ Memory Managed Pointer introduces the concept of set where it is defined to be a one or many memory blocks referencing each other allocated on the heap pointed
+ to by one or many mm_ptr<T>s allocated on the stack or the data segment (non heap) of the application. Each set is consequently composed of a
+ list of all memory blocks constituting it and a counter tracking the number of times the set is referenced by a mm_ptr<T> from the stack or the data
 segment. For example:

 <center>
@@ -82,10 +82,10 @@

 <h2><a name="cyclicism" id="cyclicism"></a>Cyclicism</h2>

- Therefore whenever a mm counter finds out the number of mm_ptr<T> referencing it to be zero, the deallocation of each memory block composing
- the mm is enforced. Thus whether the mm was composed of memory blocks referencing each other in a cyclic way or not, all of them will be subject to
- destruction and deallocation indifferent from the cyclicism problem presented by the reference counters. As we can see in the following example, the mm counter reaches
- 0 and consequently every elements composing the mm will be destructed and deallocated:
+ Therefore whenever a set counter finds out the number of mm_ptr<T> referencing it to be zero, the deallocation of each memory block composing
+ the set is enforced. Thus whether the set was composed of memory blocks referencing each other in a cyclic way or not, all of them will be subject to
+ destruction and deallocation indifferent from the cyclicism problem presented by the reference counters. As we can see in the following example, the set counter reaches
+ 0 and consequently every elements composing the set will be destructed and deallocated:

 <center>
 <img src="Cyclicism1.png"/><img src="Cyclicism2.png"/>
@@ -94,16 +94,16 @@
 <h2><a name="initialization" id="initialization"></a>Initialization</h2>

 A mm_ptr<T> is initialized differently depending on the memory segment it is being instanciated on. If it is found to be residing the stack or the data
- segment then a new mm counter will also be instanciated. If it is found to be living on the heap then a more complicated mechanism is involved to track the
- last memory block that was allocated in the same thread, find its address and stack up the mm it will be part of until the first mm_ptr<T> found on
- the stack is or data segment is initialized, where the new mm counter will be shared with all of the newly allocated blocks of memory referencing each other.
+ segment then a new set counter will also be instanciated. If it is found to be living on the heap then a more complicated mechanism is involved to track the
+ last memory block that was allocated in the same thread, find its address and stack up the set it will be part of until the first mm_ptr<T> found on
+ the stack is or data segment is initialized, where the new set counter will be shared with all of the newly allocated blocks of memory referencing each other.

 <h2><a name="union" id="union"></a>Union</h2>

- A mm will be unified with another mm whenever one of its member is found to reference a member from a different mm. The counter from the
- first mm will be added to the counter from the second mm and a redirection of the first counter to the second will occur so that all elements from the
- first mm make direct use of the second counter. Once two mms are unified they will stay unified even if the new reference responsible for unifying the
- mms is once again disjointed.
+ A set will be unified with another set whenever one of its member is found to reference a member from a different set. The counter from the
+ first set will be added to the counter from the second set and a redirection of the first counter to the second will occur so that all elements from the
+ first set make direct use of the second counter. Once two sets are unified they will stay unified even if the new reference responsible for unifying the
+ sets is once again disjointed.

 <center>
 <img src="Union1.png"/><img src="Union2.png"/>

Modified: sandbox/mm_ptr/libs/smart_ptr/doc/tutorial.html
==============================================================================
--- sandbox/mm_ptr/libs/smart_ptr/doc/tutorial.html (original)
+++ sandbox/mm_ptr/libs/smart_ptr/doc/tutorial.html 2011-04-24 12:57:50 EDT (Sun, 24 Apr 2011)
@@ -87,7 +87,7 @@
 <h2><a name="advanced" id="advanced"></a>Advanced</h2>

 When STL containers are made out of objects having members of type mm_ptr<T> then it will be desirable to have all of the allocated nodes
- and its members part of the same mm. This way all of the newly allocated mm_ptr<T> will be referring to the same mm header.
+ and its members part of the same set. This way all of the newly allocated mm_ptr<T> will be referring to the same set header.
 In order to do so, we must tell the container in question a new allocator that will be used to instanciate the nodes. This allocator is called:
 mm_allocator<T>. For example:

Date view	Thread view	Subject view	Author view

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