[Boost-commit] svn:boost r64921 - trunk/boost/spirit/home/support/detail/lexer/parser

Subject: [Boost-commit] svn:boost r64921 - trunk/boost/spirit/home/support/detail/lexer/parser
From: jamin.hanson_at_[hidden]
Date: 2010-08-19 08:55:19

Author: ben_hanson
Date: 2010-08-19 08:55:17 EDT (Thu, 19 Aug 2010)
New Revision: 64921
URL: http://svn.boost.org/trac/boost/changeset/64921

Log:
Space before * in casts. As this version of lexertl will be maintained primarily in SVN now, this kind of thing should happen less.
Text files modified: 
   trunk/boost/spirit/home/support/detail/lexer/parser/parser.hpp |    12 ++++++------                            
   1 files changed, 6 insertions(+), 6 deletions(-)

Modified: trunk/boost/spirit/home/support/detail/lexer/parser/parser.hpp
==============================================================================
--- trunk/boost/spirit/home/support/detail/lexer/parser/parser.hpp	(original)
+++ trunk/boost/spirit/home/support/detail/lexer/parser/parser.hpp	2010-08-19 08:55:17 EDT (Thu, 19 Aug 2010)
@@ -452,7 +452,7 @@
             for (std::size_t i_ = 2; i_ < top_; ++i_)
             {
                 curr_ = prev_->copy (node_ptr_vector_);
-                tree_node_stack_.push (static_cast<node*>(0));
+                tree_node_stack_.push (static_cast<node *>(0));
                 tree_node_stack_.top () = prev_;
                 sequence (node_ptr_vector_, tree_node_stack_);
                 prev_ = curr_;
@@ -463,7 +463,7 @@
                 if (token_._min > 1)
                 {
                     curr_ = prev_->copy (node_ptr_vector_);
-                    tree_node_stack_.push (static_cast<node*>(0));
+                    tree_node_stack_.push (static_cast<node *>(0));
                     tree_node_stack_.top () = prev_;
                     sequence (node_ptr_vector_, tree_node_stack_);
                     prev_ = curr_;
@@ -471,7 +471,7 @@
 
                 if (token_._comma && token_._max)
                 {
-                    tree_node_stack_.push (static_cast<node*>(0));
+                    tree_node_stack_.push (static_cast<node *>(0));
                     tree_node_stack_.top () = prev_;
                     optional (greedy_, node_ptr_vector_, tree_node_stack_);
                     prev_ = tree_node_stack_.top ();
@@ -482,7 +482,7 @@
                     for (std::size_t i_ = 1; i_ < count_; ++i_)
                     {
                         curr_ = prev_->copy (node_ptr_vector_);
-                        tree_node_stack_.push (static_cast<node*>(0));
+                        tree_node_stack_.push (static_cast<node *>(0));
                         tree_node_stack_.top () = prev_;
                         sequence (node_ptr_vector_, tree_node_stack_);
                         prev_ = curr_;
@@ -490,7 +490,7 @@
                 }
                 else
                 {
-                    tree_node_stack_.push (static_cast<node*>(0));
+                    tree_node_stack_.push (static_cast<node *>(0));
                     tree_node_stack_.top () = prev_;
                     zero_or_more (greedy_, node_ptr_vector_, tree_node_stack_);
                     prev_ = tree_node_stack_.top ();
@@ -498,7 +498,7 @@
                 }
             }
 
-            tree_node_stack_.push (static_cast<node*>(0));
+            tree_node_stack_.push (static_cast<node *>(0));
             tree_node_stack_.top () = prev_;
             sequence (node_ptr_vector_, tree_node_stack_);
         }