Update of /cvsroot/boost/boost/libs/xpressive/proto/example
In directory 
sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv13835/libs/xpressive/proto/example

Modified Files:
        calc3.cpp lazy_vector.cpp 
Log Message:
update examples for recent code changes

Index: calc3.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/xpressive/proto/example/calc3.cpp,v
retrieving revision 1.4
retrieving revision 1.5
diff -u -d -r1.4 -r1.5
--- calc3.cpp   11 Jun 2007 17:52:12 -0000      1.4
+++ calc3.cpp   20 Jun 2007 01:45:49 -0000      1.5
@@ -58,7 +58,7 @@
         // Calculate the arity of the current expression.
         typedef typename Grammar::template apply<Expr, State, Visitor>::type 
arity;
         // The old maximum is passed along in the State parameter by
-        // proto::trans::fold<> (see below). The new maximum is the
+        // proto::transform::fold<> (see below). The new maximum is the
         // larger of the old maximum and the arity we just calculated.
         typedef typename mpl::max<arity, State>::type type;
     };
@@ -83,16 +83,16 @@
         //// This accomplishes the same thing without the need to
         //// define a separate placeholder_arity<> transform, but
         //// is a little more cryptic.
-        //proto::trans::apply1<
+        //proto::transform::apply1<
         //    proto::terminal< arg<_> >
         //  , arg_arity< proto::result_of::arg<mpl::_> >
         //>
 
         // Any other terminals have arity 0 ...
-      , proto::trans::always< proto::terminal<_>, mpl::int_<0> >
+      , proto::transform::always< proto::terminal<_>, mpl::int_<0> >
         // For any non-terminals, find the arity of the children and
         // take the maximum. This is recursive.
-      , proto::trans::fold<
+      , proto::transform::fold<
             // This matches any non-terminal for which the children
             // are themselves calculator expressions.
             proto::nary_expr<_, proto::vararg< max_arity< CalculatorGrammar > 
> >
@@ -108,7 +108,7 @@
             //        // child node), and mpl::_2 will be replaced with the 
State of
             //        // the transformation so far (i.e., the maximum arity 
found so
             //        // far).
-            //        proto::trans::apply2<CalculatorGrammar, 
mpl::max<mpl::_1, mpl::_2> >
+            //        proto::transform::apply2<CalculatorGrammar, 
mpl::max<mpl::_1, mpl::_2> >
             //    >
             //>
         >

Index: lazy_vector.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/xpressive/proto/example/lazy_vector.cpp,v
retrieving revision 1.3
retrieving revision 1.4
diff -u -d -r1.3 -r1.4
--- lazy_vector.cpp     26 May 2007 00:53:57 -0000      1.3
+++ lazy_vector.cpp     20 Jun 2007 01:45:49 -0000      1.4
@@ -45,7 +45,7 @@
     {}
 
     // Use default_eval for all the operations ...
-    template<typename Expr, typename Tag = typename Expr::tag_type>
+    template<typename Expr, typename Tag = typename Expr::proto_tag>
     struct eval
       : proto::default_eval<Expr, lazy_subscript_context>
     {};


-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/
_______________________________________________
Boost-cvs mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/boost-cvs

Reply via email to