[Boost-commit] svn:boost r55893 - sandbox/statistics/tree/libs/doc

Subject: [Boost-commit] svn:boost r55893 - sandbox/statistics/tree/libs/doc
From: erwann.rogard_at_[hidden]
Date: 2009-08-30 18:02:06

Author: e_r
Date: 2009-08-30 18:02:06 EDT (Sun, 30 Aug 2009)
New Revision: 55893
URL: http://svn.boost.org/trac/boost/changeset/55893

Log:
m
Text files modified: 
   sandbox/statistics/tree/libs/doc/readme.txt |    34 ++++++++++++++++++++--------------      
   1 files changed, 20 insertions(+), 14 deletions(-)

Modified: sandbox/statistics/tree/libs/doc/readme.txt
==============================================================================
--- sandbox/statistics/tree/libs/doc/readme.txt	(original)
+++ sandbox/statistics/tree/libs/doc/readme.txt	2009-08-30 18:02:06 EDT (Sun, 30 Aug 2009)
@@ -1,5 +1,5 @@
 ///////////////////////////////////////////////////////////////////////////////
-// tree::doc::readme.hpp                                                     //
+// tree_view::doc::readme.hpp                                                //
 //                                                                           //
 //  Copyright 2009 Erwann Rogard. Distributed under the Boost                //
 //  Software License, Version 1.0. (See accompanying file                    //
@@ -12,9 +12,9 @@
 
 [ Overview ]
 
-    Maps a vector to a tree view, where all the nodes share the same number of
+    Maps a vector to a tree view, where each node has a fixed number of
     branches. 
-
+    
 [ Useful links ]
 
     A comprehensive tree framework that is unrelated to this package:
@@ -27,26 +27,32 @@
 [ Dependencies ]
 
 /usr/local/boost_1_39_0/ 
+/switch 
+
+[ Links ]
+Here's the current link to switch:
+http://www.boostpro.com/vault/index.php?action=downloadfile&filename=switch.zip&directory=&
+
 
 [ History ]
 
-July 2009 : Current version
+Sep 01, 2009    : Addressed some bugs and added dynamic_stage.hpp 
+July 2009       : Current version
 
 [ Output ]
 
 main.cpp
 
--> example_tree (0,1)(1,4)(4,13)
+-> example_tree 
+{[i(j),i(j+1)) : j=0,...,3}:(0,1)(1,4)(4,13)(13,40)
+(stage,k,i)
 (0,0,0)
 (1,0,1)(1,1,2)(1,2,3)
 (2,0,4)(2,1,5)(2,2,6)(2,3,7)(2,4,8)(2,5,9)(2,6,10)(2,7,11)(2,8,12)
-(3,0,13)(3,1,14)(3,2,15)(3,3,16)(3,4,17)(3,5,18)(3,6,19)(3,7,20)(3,8,21)(3,9,22)(3,10,23)(3,11,24)(3,12,25)(3,13,26)(3,14,27)(3,15,28)(3,16,29)(3,17,30)(3,18,31)(3,19,32)(3,20,33)(3,21,34)(3,22,35)(3,23,36)(3,24,37)(3,25,38)
-
-(0,0,0)(0,0,0)(0,0,0)
-(1,0,1)(1,0,1)(1,0,1)(1,1,2)(1,1,2)(1,1,2)(1,2,3)(1,2,3)(1,2,3)
-(2,0,4)(2,0,4)(2,0,4)(2,1,5)(2,1,5)(2,1,5)(2,2,6)(2,2,6)(2,2,6)(2,3,7)(2,3,7)(2,3,7)(2,4,8)(2,4,8)(2,4,8)(2,5,9)(2,5,9)(2,5,9)(2,6,10)(2,6,10)(2,6,10)(2,7,11)(2,7,11)(2,7,11)(2,8,12)(2,8,12)
-
-(3,39,52)(3,38,51)(3,37,50)(3,36,49)(3,35,48)(3,34,47)(3,33,46)(3,32,45)(3,31,44)(3,30,43)(3,29,42)(3,28,41)(3,27,40)(3,26,39)(3,25,38)(3,24,37)(3,23,36)(3,22,35)(3,21,34)(3,20,33)(3,19,32)(3,18,31)(3,17,30)(3,16,29)(3,15,28)(3,14,27)(3,13,26)(3,12,25)(3,11,24)(3,10,23)(3,9,22)(3,8,21)(3,7,20)(3,6,19)(3,5,18)(3,4,17)(3,3,16)(3,2,15)(3,1,14)(3,0,13)
-(2,12,16)(2,11,15)(2,10,14)(2,9,13)(2,8,12)(2,7,11)(2,6,10)(2,5,9)(2,4,8)(2,3,7)(2,2,6)(2,1,5)(2,0,4)
-(1,3,4)(1,2,3)(1,1,2)(1,0,1) <- 
+(3,0,13)(3,1,14)(3,2,15)(3,3,16)(3,4,17)(3,5,18)(3,6,19)(3,7,20)(3,8,21)(3,9,22)(3,10,23)(3,11,24)(3,12,25)(3,13,26)(3,14,27)(3,15,28)(3,16,29)(3,17,30)(3,18,31)(3,19,32)(3,20,33)(3,21,34)(3,22,35)(3,23,36)(3,24,37)(3,25,38)(3,26,39)
+(stage,k,i)
+(3,26,39)(3,25,38)(3,24,37)(3,23,36)(3,22,35)(3,21,34)(3,20,33)(3,19,32)(3,18,31)(3,17,30)(3,16,29)(3,15,28)(3,14,27)(3,13,26)(3,12,25)(3,11,24)(3,10,23)(3,9,22)(3,8,21)(3,7,20)(3,6,19)(3,5,18)(3,4,17)(3,3,16)(3,2,15)(3,1,14)(3,0,13)
+(2,8,12)(2,7,11)(2,6,10)(2,5,9)(2,4,8)(2,3,7)(2,2,6)(2,1,5)(2,0,4)
+(1,2,3)(1,1,2)(1,0,1)
+(0,0,0) <-