$include_dir="/home/hyper-archives/boost-commit/include"; include("$include_dir/msg-header.inc") ?>
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>
 
-  <p>Memory Managed Pointer introduces the concept of <i>mm</i> 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 <i>mm_ptr<T></i>s allocated on the stack or the data segment (non heap) of the application.  Each <i>mm</i> is consequently composed of a 
-  list of all memory blocks constituting it and a counter tracking the number of times the <i>mm</i> is referenced by a <i>mm_ptr<T></i> from the stack or the data 
+  <p>Memory Managed Pointer introduces the concept of <i>set</i> 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 <i>mm_ptr<T></i>s allocated on the stack or the data segment (non heap) of the application.  Each <i>set</i> is consequently composed of a 
+  list of all memory blocks constituting it and a counter tracking the number of times the <i>set</i> is referenced by a <i>mm_ptr<T></i> from the stack or the data 
   segment.  For example:</p>
   
   <center>
@@ -82,10 +82,10 @@
 
   <h2><a name="cyclicism" id="cyclicism"></a>Cyclicism</h2>
   
-  <p>Therefore whenever a <i>mm</i> counter finds out the number of <i>mm_ptr<T></i> referencing it to be zero, the deallocation of each memory block composing 
-  the <i>mm</i> is enforced.  Thus whether the <i>mm</i> 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 <i>mm</i> counter reaches 
-  0 and consequently every elements composing the <i>mm</i> will be destructed and deallocated:</p>
+  <p>Therefore whenever a <i>set</i> counter finds out the number of <i>mm_ptr<T></i> referencing it to be zero, the deallocation of each memory block composing 
+  the <i>set</i> is enforced.  Thus whether the <i>set</i> 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 <i>set</i> counter reaches 
+  0 and consequently every elements composing the <i>set</i> will be destructed and deallocated:</p>
   
   <center>
     <img src="Cyclicism1.png"/><img src="Cyclicism2.png"/>
@@ -94,16 +94,16 @@
   <h2><a name="initialization" id="initialization"></a>Initialization</h2>
 
   <p>A <i>mm_ptr<T></i> 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 <i>mm</i> 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 <i>mm</i> it will be part of until the first <i>mm_ptr<T></i> found on 
-  the stack is or data segment is initialized, where the new <i>mm</i> counter will be shared with all of the newly allocated blocks of memory referencing each other.</p>
+  segment then a new <i>set</i> 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 <i>set</i> it will be part of until the first <i>mm_ptr<T></i> found on 
+  the stack is or data segment is initialized, where the new <i>set</i> counter will be shared with all of the newly allocated blocks of memory referencing each other.</p>
 
   <h2><a name="union" id="union"></a>Union</h2>
 
-  <p>A <i>mm</i> will be unified with another <i>mm</i> whenever one of its member is found to reference a member from a different <i>mm</i>.  The counter from the 
-  first <i>mm</i> will be added to the counter from the second <i>mm</i> and a redirection of the first counter to the second will occur so that all elements from the 
-  first <i>mm</i> make direct use of the second counter.  Once two <i>mm</i>s are unified they will stay unified even if the new reference responsible for unifying the 
-  <i>mm</i>s is once again disjointed.</p>
+  <p>A <i>set</i> will be unified with another <i>set</i> whenever one of its member is found to reference a member from a different <i>set</i>.  The counter from the 
+  first <i>set</i> will be added to the counter from the second <i>set</i> and a redirection of the first counter to the second will occur so that all elements from the 
+  first <i>set</i> make direct use of the second counter.  Once two <i>set</i>s are unified they will stay unified even if the new reference responsible for unifying the 
+  <i>set</i>s is once again disjointed.</p>
   
   <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>
 
   <p>When STL containers are made out of objects having members of type <i>mm_ptr<T></i> then it will be desirable to have all of the allocated nodes 
-  and its members part of the same <i>mm</i>.  This way all of the newly allocated <i>mm_ptr<T></i> will be referring to the same <i>mm</i> header.
+  and its members part of the same <i>set</i>.  This way all of the newly allocated <i>mm_ptr<T></i> will be referring to the same <i>set</i> 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: 
   <i>mm_allocator<T></i>.  For example:</p>