[Boost-commit] svn:boost r70013 - sandbox/assign_v2/libs/assign/v2

Subject: [Boost-commit] svn:boost r70013 - sandbox/assign_v2/libs/assign/v2
From: erwann.rogard_at_[hidden]
Date: 2011-03-15 23:14:37

Author: e_r
Date: 2011-03-15 23:14:36 EDT (Tue, 15 Mar 2011)
New Revision: 70013
URL: http://svn.boost.org/trac/boost/changeset/70013

Log:
upd assign
Added:
   sandbox/assign_v2/libs/assign/v2/tutorial.cpp   (contents, props changed)
   sandbox/assign_v2/libs/assign/v2/tutorial.h   (contents, props changed)

Added: sandbox/assign_v2/libs/assign/v2/tutorial.cpp
==============================================================================
--- (empty file)
+++ sandbox/assign_v2/libs/assign/v2/tutorial.cpp	2011-03-15 23:14:36 EDT (Tue, 15 Mar 2011)
@@ -0,0 +1,95 @@
+//////////////////////////////////////////////////////////////////////////////
+//  Boost.Assign v2                                                         //
+//                                                                          //
+//  Copyright (C) 2003-2004 Thorsten Ottosen                                //
+//  Copyright (C) 2010 Erwann Rogard                                        //
+//  Use, modification and distribution are subject to the                   //
+//  Boost Software License, Version 1.0. (See accompanying file             //
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)        //
+//////////////////////////////////////////////////////////////////////////////
+#include <assert.h>
+#include <vector>
+#include <deque>
+#include <map>
+#include <queue>
+#include <boost/assign/v2.hpp>
+#include <boost/array.hpp>
+#include <boost/lambda/lambda.hpp>
+#include <boost/range/algorithm_ext/iota.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/range/algorithm/equal.hpp>
+#include <boost/range/algorithm/max_element.hpp>
+#include <boost/range/algorithm/stable_partition.hpp>
+#include <boost/variant.hpp>
+#include <libs/assign/v2/tutorial.h>
+
+namespace tutorial_assign_v2{
+
+    void run()
+    {
+        using namespace boost;
+        using namespace assign::v2;
+        {
+            //[tutorial_assign
+            std::vector<int> numeric( 10 ); iota( numeric, 0 ); typedef std::string str_;
+            typedef variant< int, str_ > data_; array<data_, 16> numeric_kb;
+            put( numeric_kb )
+                ( "+" )( "-" )( "*" )( "/" )( "=" )( "." )
+                ( as_arg_list( numeric ) );
+
+            assert( get<str_>( numeric_kb.front() ) == "+" );
+            assert( get<int>( numeric_kb.back()  ) == 9 );
+            //]
+        }
+        {
+            //[tutorial_piping
+            using namespace lambda;
+            std::deque<int> cont; range::stable_partition( cont | _csv_put( 0, 1, 2, 3, 4, 5 ), _1 % 2 );
+            //]
+            //[tutorial_container_generation
+            assert( range::equal( cont, csv_deque(1, 3, 5, 0, 2, 4) ) );
+            //]
+        }
+        {
+            //[tutorial_ref_array
+            int x = 4, y = 6, z = -1;
+            int const& max = *max_element( ref::csv_array( x, y, z ) );
+            assert( &max == &y );
+            //]
+        }
+        {
+            //[tutorial_chain
+            std::vector<int> consecutive8( 8 ); for(int i = 0; i < 8; i++){ consecutive8[i] = 1 + i; }
+            array<int, 5> consecutive5; int six, seven, eight;
+            boost::copy( 
+                consecutive8, 
+                begin( consecutive5 | _chain( ref::csv_array( six, seven, eight ) | ref::_get ) )
+            );
+            assert(consecutive5[0] == 1); assert(consecutive5[4] == 5); 
+            assert( six == 6 ); assert( eight == 8);
+            //]
+        }
+        {    
+            //[tutorial_conversion
+            std::queue<int> fifo = converter( csv_deque( 72, 31, 48 ) ); 
+            assert( fifo.front() == 72 );
+            //]        
+        }
+        {
+            //[tutorial_arg_forwarding
+            std::map<std::string, int> map; put( map )( "foo", 1 )( "bar", 2 )( "baz", 3 );
+            assert( map["bar"] == 2 );
+            //]
+        }
+        {
+            //[tutorial_parametrization
+            using namespace lambda;
+            typedef int T; array<T, 4> powers = converter( csv_deque( 1, 10, -1, -1 ) ); 
+            int shift = 2; ( put( powers ) % ( _iterate = var( shift )++ ) )( 100 )( 1000 );
+
+            int value = 1; for(shift = 0; shift < powers.size(); shift++){ assert( powers[shift] == value ); value *=10; }
+            //]
+        }
+    }
+    
+}// tutorial_assign_v2
\ No newline at end of file

Added: sandbox/assign_v2/libs/assign/v2/tutorial.h
==============================================================================
--- (empty file)
+++ sandbox/assign_v2/libs/assign/v2/tutorial.h	2011-03-15 23:14:36 EDT (Tue, 15 Mar 2011)
@@ -0,0 +1,19 @@
+//////////////////////////////////////////////////////////////////////////////
+//  Boost.Assign v2                                                         //
+//                                                                          //
+//  Copyright (C) 2003-2004 Thorsten Ottosen                                //
+//  Copyright (C) 2010 Erwann Rogard                                        //
+//  Use, modification and distribution are subject to the                   //
+//  Boost Software License, Version 1.0. (See accompanying file             //
+//  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)        //
+//////////////////////////////////////////////////////////////////////////////
+#ifndef LIBS_ASSIGN_V2_TUTORIAL_ER_2010_H
+#define LIBS_ASSIGN_V2_TUTORIAL_ER_2010_H
+
+namespace tutorial_assign_v2{
+
+    void run();
+
+}// tutorial_assign_v2
+
+#endif LIBS_ASSIGN_V2_TUTORIAL_ER_2010_H
\ No newline at end of file