[Boost-commit] svn:boost r71917 - trunk/libs/spirit/doc/support

Subject: [Boost-commit] svn:boost r71917 - trunk/libs/spirit/doc/support
From: blelbach_at_[hidden]
Date: 2011-05-13 11:15:33

Author: wash
Date: 2011-05-13 11:15:31 EDT (Fri, 13 May 2011)
New Revision: 71917
URL: http://svn.boost.org/trac/boost/changeset/71917

Log:
Change wording of utree docs.

Text files modified: 
   trunk/libs/spirit/doc/support/utree.qbk |    18 ++++++++----------                      
   1 files changed, 8 insertions(+), 10 deletions(-)

Modified: trunk/libs/spirit/doc/support/utree.qbk
==============================================================================
--- trunk/libs/spirit/doc/support/utree.qbk	(original)
+++ trunk/libs/spirit/doc/support/utree.qbk	2011-05-13 11:15:31 EDT (Fri, 13 May 2011)
@@ -12,19 +12,17 @@
 
 [section:utree The utree data structure]
 
-The `utree` data structure is a generic, hierarchical, and dynamic data 
-structure that can represent abstract syntax trees. It's well integrated with 
-__qi__ and __karma__. It can be passed as an attribute while parsing almost any
-grammars. At the same time, it can be used as an attribute to generate output 
-from.
+`utree` is a dynamically-typed hierarchical data structure that can represent
+abstract syntax trees. It's well integrated with __qi__ and __karma__. `utree`
+can be passed as an attribute to almost any grammar. `utree`'s type system is
+implemented through the use of a discriminated union and type punning.
+
+`utree` has a minimal memory footprint. The data structure size is 16 bytes on a
+32-bit platform, and 32 bytes on 64-bit a platform (`4*sizeof(void*)`). Being a
+container of itself, it can represent tree structures.
 
 [utree_types]
 
-[note utree has minimal memory footprint. The data structure size is
-16 bytes on a 32-bit platform, and 32 bytes on 64-bit a platform 
-(`4*sizeof(void*)`). Being a container of itself, it can represent tree 
-structures.]
-
 The UTF-8 string, UTF-8 symbol, and binary data types are internally stored 
 either directly as the node data (small string optimization applied), or they 
 are allocated from the heap, storing the pointer to the allocated data in the