Index: libs/assign/test/ptr_map_inserter.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/assign/test/ptr_map_inserter.cpp,v
retrieving revision 1.1
diff -u -r1.1 ptr_map_inserter.cpp
--- libs/assign/test/ptr_map_inserter.cpp	14 Feb 2006 23:19:31 -0000	1.1
+++ libs/assign/test/ptr_map_inserter.cpp	26 Aug 2006 12:27:25 -0000
@@ -27,9 +27,9 @@
 // 
 struct abstract_base
 {
-	virtual ~abstract_base() {}
-	virtual void foo() = 0;
-	virtual abstract_base* clone() const = 0;
+    virtual ~abstract_base() {}
+    virtual void foo() = 0;
+    virtual abstract_base* clone() const = 0;
 };
 
 struct implementation : abstract_base
@@ -49,11 +49,11 @@
     implementation( int, std::string, int, std::string )
     { }
 
-	virtual void foo() {}
-	virtual abstract_base* clone() const
-	{
-		return new implementation( *this );
-	}
+    virtual void foo() {}
+    virtual abstract_base* clone() const
+    {
+        return new implementation( *this );
+    }
 };
 
 
Index: libs/graph/example/kevin-bacon2.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/graph/example/kevin-bacon2.cpp,v
retrieving revision 1.2
diff -u -r1.2 kevin-bacon2.cpp
--- libs/graph/example/kevin-bacon2.cpp	6 Jan 2006 22:02:52 -0000	1.2
+++ libs/graph/example/kevin-bacon2.cpp	26 Aug 2006 12:29:09 -0000
@@ -38,7 +38,7 @@
 using namespace boost;
 
 typedef adjacency_list<vecS, vecS, undirectedS, 
-		       vertex_properties, edge_properties> Graph;
+               vertex_properties, edge_properties> Graph;
 typedef graph_traits<Graph>::vertex_descriptor Vertex;
 typedef graph_traits<Graph>::edge_descriptor Edge;
 
@@ -84,7 +84,7 @@
 
   for (tie(i, end) = vertices(g); i != end; ++i)
     std::cout << g[*i].name << " has a Bacon number of "
-	      << bacon_number[*i] << std::endl;
+          << bacon_number[*i] << std::endl;
 
   return 0;
 }
Index: libs/graph/test/csr_graph_test.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/graph/test/csr_graph_test.cpp,v
retrieving revision 1.13
diff -u -r1.13 csr_graph_test.cpp
--- libs/graph/test/csr_graph_test.cpp	9 Mar 2006 20:06:23 -0000	1.13
+++ libs/graph/test/csr_graph_test.cpp	26 Aug 2006 12:30:11 -0000
@@ -200,8 +200,8 @@
     if (i % 13 == 0) check_consistency(g4);
   }
   assert_graphs_equal(g3, boost::identity_property_map(),
-		      g4, boost::identity_property_map(),
-		      boost::identity_property_map());
+                      g4, boost::identity_property_map(),
+                      boost::identity_property_map());
 
   // Check edge_from_index (and implicitly the edge_index property map) for
   // each edge in g2
@@ -241,11 +241,11 @@
       BOOST_CHECK(source(edge_info.first, g2) == *vi);
       BOOST_CHECK(target(edge_info.first, g2) == tgtd);
       std::pair<CSRGraphT::out_edge_iterator, CSRGraphT::out_edge_iterator> er =
-	edge_range(*vi, tgtd, g2);
+        edge_range(*vi, tgtd, g2);
       BOOST_CHECK(er.first != er.second);
       for (; er.first != er.second; ++er.first) {
-	BOOST_CHECK(source(*er.first, g2) == *vi);
-	BOOST_CHECK(target(*er.first, g2) == tgtd);
+        BOOST_CHECK(source(*er.first, g2) == *vi);
+        BOOST_CHECK(target(*er.first, g2) == tgtd);
       }
     }
 
@@ -255,7 +255,7 @@
     CSRGraphT::out_edge_iterator oei2, oei2_end;
     for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) {
       if (target(*oei2, g2) == test_vertex)
-	++edge_count;
+        ++edge_count;
     }
 
     // Test edge and edge_range on an edge that may not be present
Index: libs/graph/test/dominator_tree_test.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/graph/test/dominator_tree_test.cpp,v
retrieving revision 1.3
diff -u -r1.3 dominator_tree_test.cpp
--- libs/graph/test/dominator_tree_test.cpp	10 Dec 2005 00:50:17 -0000	1.3
+++ libs/graph/test/dominator_tree_test.cpp	26 Aug 2006 12:31:29 -0000
@@ -26,10 +26,10 @@
 using namespace boost;
 
 typedef adjacency_list<
-	listS,
-	listS,
-	bidirectionalS,
-	property<vertex_index_t, std::size_t>, no_property> G;
+    listS,
+    listS,
+    bidirectionalS,
+    property<vertex_index_t, std::size_t>, no_property> G;
 
 int test_main(int, char*[])
 {
@@ -209,7 +209,7 @@
       G g(
           testSet[i].edges, testSet[i].edges + testSet[i].numOfEdges,
           numOfVertices);
-		
+
       typedef graph_traits<G>::vertex_descriptor Vertex;
       typedef property_map<G, vertex_index_t>::type IndexMap;
       typedef
Index: libs/graph/test/matching_test.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/graph/test/matching_test.cpp,v
retrieving revision 1.1
diff -u -r1.1 matching_test.cpp
--- libs/graph/test/matching_test.cpp	7 Sep 2005 15:39:03 -0000	1.1
+++ libs/graph/test/matching_test.cpp	26 Aug 2006 12:32:06 -0000
@@ -21,17 +21,17 @@
 using namespace boost;
 
 typedef adjacency_list<vecS, 
-		       vecS, 
-		       undirectedS, 
-      		       property<vertex_index_t, int> >  undirected_graph;
+                       vecS, 
+                       undirectedS, 
+                       property<vertex_index_t, int> >  undirected_graph;
 
 typedef adjacency_list<listS,
-		       listS,
-		       undirectedS,
-		       property<vertex_index_t, int> >  undirected_list_graph;
+                       listS,
+                       undirectedS,
+                       property<vertex_index_t, int> >  undirected_list_graph;
 
 typedef adjacency_matrix<undirectedS, 
-			 property<vertex_index_t,int> > undirected_adjacency_matrix_graph;
+                         property<vertex_index_t,int> > undirected_adjacency_matrix_graph;
 
 
 template <typename Graph>
@@ -72,7 +72,7 @@
       wi = vi;
       ++wi;
       for(; wi != vi_end; ++wi)
-	add_edge(*vi,*wi,g);      
+        add_edge(*vi,*wi,g);      
     }
 }
 
@@ -104,10 +104,10 @@
       vi = ui;
       ++vi;
       while (vi != halfway)
-	{
-	  add_edge(*ui,*vi,g);
-	  ++vi;
-	}
+        {
+          add_edge(*ui,*vi,g);
+          ++vi;
+        }
       ++ui;
     }
 
@@ -160,7 +160,7 @@
   if (!edmonds_result)
     {
       std::cout << "Verifier reporting a problem finding a perfect matching on" << std::endl
-		<< "the complete graph using " << graph_name << std::endl;
+                << "the complete graph using " << graph_name << std::endl;
       all_tests_passed = false;
     }
   
@@ -174,7 +174,7 @@
   if (!greedy_result)
     {
       std::cout << "Verifier reporting a problem finding a greedy matching on" << std::endl
-		<< "the complete graph using " << graph_name << std::endl;
+                << "the complete graph using " << graph_name << std::endl;
       all_tests_passed = false;
     }
 
@@ -188,7 +188,7 @@
   if (!extra_greedy_result)
     {
       std::cout << "Verifier reporting a problem finding an extra greedy matching on" << std::endl
-		<< "the complete graph using " << graph_name << std::endl;
+                << "the complete graph using " << graph_name << std::endl;
       all_tests_passed = false;
     }
 
@@ -202,8 +202,8 @@
   if (edmonds_result && !edmonds_sanity_check)
     {
       std::cout << "Verifier okayed edmonds' algorithm on the complete graph, but" << std::endl
-		<< "the matching returned either wasn't a valid matching or wasn't" << std::endl
-		<< "actually a maximum cardinality matching." << std::endl;
+                << "the matching returned either wasn't a valid matching or wasn't" << std::endl
+                << "actually a maximum cardinality matching." << std::endl;
       all_tests_passed = false;
     }
 
@@ -214,8 +214,8 @@
   if (greedy_result && !greedy_sanity_check)
     {
       std::cout << "Verifier okayed greedy algorithm on the complete graph, but" << std::endl
-		<< "the matching returned either wasn't a valid matching or wasn't" << std::endl
-		<< "actually a maximum cardinality matching." << std::endl;
+                << "the matching returned either wasn't a valid matching or wasn't" << std::endl
+                << "actually a maximum cardinality matching." << std::endl;
       all_tests_passed = false;
     }
   
@@ -226,8 +226,8 @@
   if (extra_greedy_result && !extra_greedy_sanity_check)
     {
       std::cout << "Verifier okayed extra greedy algorithm on the complete graph, but" << std::endl
-		<< "the matching returned either wasn't a valid matching or wasn't" << std::endl
-		<< "actually a maximum cardinality matching." << std::endl;
+                << "the matching returned either wasn't a valid matching or wasn't" << std::endl
+                << "actually a maximum cardinality matching." << std::endl;
       all_tests_passed = false;
     }
   
@@ -268,7 +268,7 @@
   if (!gabows_graph_result)
     {
       std::cout << "Problem on Gabow's Graph with " << graph_name << ":" << std::endl
-		<< "   Verifier reporting a maximum cardinality matching not found." << std::endl;
+                << "   Verifier reporting a maximum cardinality matching not found." << std::endl;
       all_tests_passed = false;
     }
   
@@ -276,9 +276,9 @@
   if (gabows_graph_result && matching_size(h,gabow_mate) != num_v)
     {
       std::cout << "Problem on Gabow's Graph with " << graph_name << ":" << std::endl
-		<< "   Verifier reported a maximum cardinality matching found," << std::endl
-		<< "   but matching size is " << matching_size(h,gabow_mate)
-		<< " when it should be " << num_v << std::endl;
+                << "   Verifier reported a maximum cardinality matching found," << std::endl
+                << "   but matching size is " << matching_size(h,gabow_mate)
+                << " when it should be " << num_v << std::endl;
       all_tests_passed = false;
     }
 
@@ -298,11 +298,11 @@
       vertex_descriptor_t u = random_vertex(j,rand_num);
       vertex_descriptor_t v = random_vertex(j,rand_num);
       if (u != v)
-	{
-	  tie(tuples::ignore, success) = add_edge(u, v, j);
-	  if (success)
-	    num_edges++;
-	}
+        {
+          tie(tuples::ignore, success) = add_edge(u, v, j);
+          if (success)
+            num_edges++;
+        }
     }
 
   mate_t random_mate(double_num_v);
Index: libs/graph/test/random_matching_test.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/graph/test/random_matching_test.cpp,v
retrieving revision 1.1
diff -u -r1.1 random_matching_test.cpp
--- libs/graph/test/random_matching_test.cpp	7 Sep 2005 15:39:03 -0000	1.1
+++ libs/graph/test/random_matching_test.cpp	26 Aug 2006 12:32:20 -0000
@@ -19,9 +19,9 @@
 using namespace boost;
 
 typedef adjacency_list<vecS, 
-		       vecS, 
-		       undirectedS, 
-      		       property<vertex_index_t, int> >  undirected_graph;
+                       vecS, 
+                       undirectedS, 
+                       property<vertex_index_t, int> >  undirected_graph;
 
 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t;
 typedef vector_property_map<graph_traits<undirected_graph>::vertex_descriptor, vertex_index_map_t > mate_t;
@@ -35,7 +35,7 @@
   if (argc < 3)
     {
       std::cout << "Usage: " << argv[0] << " n m" << std::endl
-		<< "Tests the checked matching on a random graph w/ n vertices and m edges" << std::endl;
+                << "Tests the checked matching on a random graph w/ n vertices and m edges" << std::endl;
       exit(-1);
     }
   
@@ -58,15 +58,15 @@
       vertex_descriptor_t u = random_vertex(g,rand_num);
       vertex_descriptor_t v = random_vertex(g,rand_num);
       if (u != v)
-	{
-	  if (!edge(u,v,g).second)
-	    tie(tuples::ignore, success) = add_edge(u, v, g);
-	  else
-	    success = false;
-
-	  if (success)
-	    num_edges++;
-	}
+        {
+          if (!edge(u,v,g).second)
+            tie(tuples::ignore, success) = add_edge(u, v, g);
+          else
+            success = false;
+
+          if (success)
+            num_edges++;
+        }
     }
 
   mate_t mate(n);
@@ -80,15 +80,15 @@
       typedef graph_traits<undirected_graph>::edge_iterator edge_iterator_t;
       edge_iterator_t ei,ei_end;
       for(tie(ei,ei_end) = edges(g); ei != ei_end; ++ei)
-	std:: cout << *ei << ", ";
+        std:: cout << *ei << ", ";
       std::cout << std::endl;
       
       std::cout << "Matching is: ";
       vertex_iterator_t vi, vi_end;
       for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
-	if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() &&
-	    *vi < mate[*vi])
-	  std::cout << "{" << *vi << "," << mate[*vi] << "}, ";
+        if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() &&
+            *vi < mate[*vi])
+          std::cout << "{" << *vi << "," << mate[*vi] << "}, ";
       std::cout << std::endl;
     }
 
@@ -117,7 +117,7 @@
 
   if (matching_size(g,mate) > matching_size(g,greedy_mate) &&
       maximum_cardinality_matching_verifier<undirected_graph,mate_t,vertex_index_map_t>::verify_matching(g,greedy_mate,get(vertex_index,g)))
-	std::cout << "TEST 3 FAILED!!!" << std::endl;
+        std::cout << "TEST 3 FAILED!!!" << std::endl;
 
   return 0;
 }
Index: libs/numeric/ublas/test/placement_new.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/numeric/ublas/test/placement_new.cpp,v
retrieving revision 1.7
diff -u -r1.7 placement_new.cpp
--- libs/numeric/ublas/test/placement_new.cpp	11 Aug 2005 19:02:31 -0000	1.7
+++ libs/numeric/ublas/test/placement_new.cpp	26 Aug 2006 12:33:52 -0000
@@ -22,7 +22,7 @@
     }
     ~udt () {}      // required for GCC prior to 3.4 to generate cookie
 
-	static udt* base_pointer;
+    static udt* base_pointer;
 };
 
 udt* udt::base_pointer;
Index: libs/numeric/ublas/test/test11.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/numeric/ublas/test/test11.cpp,v
retrieving revision 1.1.2.2
diff -u -r1.1.2.2 test11.cpp
--- libs/numeric/ublas/test/test11.cpp	8 Jun 2006 20:45:00 -0000	1.1.2.2
+++ libs/numeric/ublas/test/test11.cpp	26 Aug 2006 12:34:08 -0000
@@ -34,7 +34,7 @@
     
     template<class VP>
     void test_expression_with (VP &v1, VP &v2, VP &v3) const {
-    	// Expression type tests
+        // Expression type tests
         value_type t;
         size_type i;
         real_type n;
Index: libs/range/test/iterator_range.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/range/test/iterator_range.cpp,v
retrieving revision 1.15
diff -u -r1.15 iterator_range.cpp
--- libs/range/test/iterator_range.cpp	13 Dec 2005 22:50:57 -0000	1.15
+++ libs/range/test/iterator_range.cpp	26 Aug 2006 12:34:37 -0000
@@ -26,7 +26,7 @@
 
 using namespace boost;
 using namespace std;
-	
+
 void check_reference_type();
 
 void check_iterator_range()
@@ -94,7 +94,7 @@
     rrr = make_iterator_range( rrr, -1, 1 );
     BOOST_CHECK( rrr == str );
 
-	check_reference_type();
+    check_reference_type();
 }
 
 
@@ -124,10 +124,10 @@
     typedef BOOST_DEDUCED_TYPENAME range_result_iterator<Container>::type citer_type;
     typedef iterator_range<citer_type> riter_type;
     riter_type a_riter( make_iterator_range( a_cont ) );
-	a_riter.front();
-	a_riter.back();
-	int i = a_riter[0];
-	return i;
+    a_riter.front();
+    a_riter.back();
+    int i = a_riter[0];
+    return i;
 }
 
 
Index: libs/typeof/test/Jamfile
===================================================================
RCS file: /cvsroot/boost/boost/libs/typeof/test/Jamfile,v
retrieving revision 1.10.2.2
diff -u -r1.10.2.2 Jamfile
--- libs/typeof/test/Jamfile	18 Jun 2006 15:40:45 -0000	1.10.2.2
+++ libs/typeof/test/Jamfile	26 Aug 2006 12:34:59 -0000
@@ -22,64 +22,64 @@
 }
 
 test-suite "typeof" 
-	:  
-	[ compile type.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : type_native ]
-	[ compile type.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : type_emulation ]
+    :  
+    [ compile type.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : type_native ]
+    [ compile type.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : type_emulation ]
 
-	[ compile template_type.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_type_native ]
-	[ compile template_type.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_type_emulation ]
+    [ compile template_type.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_type_native ]
+    [ compile template_type.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_type_emulation ]
 
-	[ compile template_int.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_int_native ]
-	[ compile template_int.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_int_emulation ]
+    [ compile template_int.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_int_native ]
+    [ compile template_int.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_int_emulation ]
 
-	[ compile template_tpl.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_tpl_native ]
-	[ compile template_tpl.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_tpl_emulation ]
+    [ compile template_tpl.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_tpl_native ]
+    [ compile template_tpl.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_tpl_emulation ]
 
-	[ compile template_enum.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_enum_native ]
-	[ compile template_enum.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_enum_emulation ]
+    [ compile template_enum.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_enum_native ]
+    [ compile template_enum.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_enum_emulation ]
 
-	[ compile template_dependent.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_dependent_native ]
-	[ compile template_dependent.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_dependent_emulation ]
+    [ compile template_dependent.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_dependent_native ]
+    [ compile template_dependent.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_dependent_emulation ]
 
-	[ compile template_multiword.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_multiword_native ]
-	[ compile template_multiword.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_multiword_emulation ]
+    [ compile template_multiword.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : template_multiword_native ]
+    [ compile template_multiword.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : template_multiword_emulation ]
 
-	[ compile modifiers.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : modifiers_native ]
-	[ compile modifiers.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : modifiers_emulation ]
+    [ compile modifiers.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : modifiers_native ]
+    [ compile modifiers.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : modifiers_emulation ]
 
-	[ compile function.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_native ]
-	[ compile function.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_emulation ]
+    [ compile function.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_native ]
+    [ compile function.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_emulation ]
 
-	[ compile function_binding.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_binding_native ]
-	[ compile function_binding.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_binding_emulation ]
+    [ compile function_binding.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_binding_native ]
+    [ compile function_binding.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_binding_emulation ]
 
-	[ compile function_ptr.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ptr_native ]
-	[ compile function_ptr.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_ptr_emulation ]
+    [ compile function_ptr.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ptr_native ]
+    [ compile function_ptr.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_ptr_emulation ]
 
-	[ compile function_ref.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ref_native ]
-	[ compile function_ref.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_ref_emulation ]
+    [ compile function_ref.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ref_native ]
+    [ compile function_ref.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_ref_emulation ]
 
-	[ compile member_function.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : member_function_native ]
-	[ compile member_function.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : member_function_emulation ]
+    [ compile member_function.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : member_function_native ]
+    [ compile member_function.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : member_function_emulation ]
 
-	[ compile data_member.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : data_member_native ]
-	[ compile data_member.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : data_member_emulation ]
+    [ compile data_member.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : data_member_native ]
+    [ compile data_member.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : data_member_emulation ]
 
-	[ compile noncopyable.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : noncopyable_native ]
-	[ compile noncopyable.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : noncopyable_emulation ]
+    [ compile noncopyable.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : noncopyable_native ]
+    [ compile noncopyable.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : noncopyable_emulation ]
 
-	[ compile std.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : std_native ]
-	[ compile std.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : std_emulation ]
+    [ compile std.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : std_native ]
+    [ compile std.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : std_emulation ]
 
-	[ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_NATIVE special-requirements : odr_native ]
-	[ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_EMULATION special-requirements : odr_emulation ]
+    [ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_NATIVE special-requirements : odr_native ]
+    [ run odr1.cpp odr2.cpp : : : <define>BOOST_TYPEOF_EMULATION special-requirements : odr_emulation ]
 
-	[ compile function_ptr_from_tpl.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ptr_from_tpl_native ]
-	[ compile function_ptr_from_tpl.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_ptr_from_tpl_emulation ]
+    [ compile function_ptr_from_tpl.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : function_ptr_from_tpl_native ]
+    [ compile function_ptr_from_tpl.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : function_ptr_from_tpl_emulation ]
 
-	[ compile nested_typedef.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : nested_typedef_native ]
-	[ compile nested_typedef.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : nested_typedef_emulation ]
+    [ compile nested_typedef.cpp : <define>BOOST_TYPEOF_NATIVE special-requirements : nested_typedef_native ]
+    [ compile nested_typedef.cpp : <define>BOOST_TYPEOF_EMULATION special-requirements : nested_typedef_emulation ]
 
-	[ run odr_no_uns1.cpp odr_no_uns2.cpp : : : <define>BOOST_TYPEOF_EMULATION special-requirements : odr_no_uns ]
+    [ run odr_no_uns1.cpp odr_no_uns2.cpp : : : <define>BOOST_TYPEOF_EMULATION special-requirements : odr_no_uns ]
 
-	;
+    ;
Index: libs/typeof/test/odr_no_uns1.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/typeof/test/odr_no_uns1.cpp,v
retrieving revision 1.1.2.2
diff -u -r1.1.2.2 odr_no_uns1.cpp
--- libs/typeof/test/odr_no_uns1.cpp	18 Jun 2006 15:40:45 -0000	1.1.2.2
+++ libs/typeof/test/odr_no_uns1.cpp	26 Aug 2006 12:35:50 -0000
@@ -3,13 +3,13 @@
 
 void odr_no_uns1()
 {
-	odr_test_1 t1;
-	odr_test_2 t2;
-	BOOST_AUTO(v1, t1);
-	BOOST_AUTO(v2, t2);
+    odr_test_1 t1;
+    odr_test_2 t2;
+    BOOST_AUTO(v1, t1);
+    BOOST_AUTO(v2, t2);
 }
 
 int main()
 {
-	return 0;
+    return 0;
 }
Index: libs/typeof/test/odr_no_uns2.cpp
===================================================================
RCS file: /cvsroot/boost/boost/libs/typeof/test/odr_no_uns2.cpp,v
retrieving revision 1.1.2.2
diff -u -r1.1.2.2 odr_no_uns2.cpp
--- libs/typeof/test/odr_no_uns2.cpp	18 Jun 2006 15:40:45 -0000	1.1.2.2
+++ libs/typeof/test/odr_no_uns2.cpp	26 Aug 2006 12:35:35 -0000
@@ -3,8 +3,8 @@
 
 void odr_no_uns2()
 {
-	odr_test_1 t1;
-	odr_test_2 t2;
-	BOOST_AUTO(v1, t1);
-	BOOST_AUTO(v2, t2);
+    odr_test_1 t1;
+    odr_test_2 t2;
+    BOOST_AUTO(v1, t1);
+    BOOST_AUTO(v2, t2);
 }
Index: tools/build/v2/test/indirect_conditional.py
===================================================================
RCS file: /cvsroot/boost/boost/tools/build/v2/test/indirect_conditional.py,v
retrieving revision 1.1
diff -u -r1.1 indirect_conditional.py
--- tools/build/v2/test/indirect_conditional.py	7 Feb 2006 10:26:17 -0000	1.1
+++ tools/build/v2/test/indirect_conditional.py	26 Aug 2006 12:28:15 -0000
@@ -17,7 +17,7 @@
 {
     if <variant>debug in $(properties)
     {
-	    return <define>OK ;
+        return <define>OK ;
     }
 }
 
Index: tools/build/v2/test/project-test3/lib3/Jamfile
===================================================================
RCS file: /cvsroot/boost/boost/tools/build/v2/test/project-test3/lib3/Jamfile,v
retrieving revision 1.5
diff -u -r1.5 Jamfile
--- tools/build/v2/test/project-test3/lib3/Jamfile	19 Sep 2005 08:49:50 -0000	1.5
+++ tools/build/v2/test/project-test3/lib3/Jamfile	26 Aug 2006 12:28:39 -0000
@@ -11,10 +11,10 @@
     local r ;
     for local p in $(properties)
     {
-	    if $(p:G) != <action>
-	    {
-	        r += $(p) ;
-	    }
+        if $(p:G) != <action>
+        {
+            r += $(p) ;
+        }
     }
     return [ property.as-path
         [ property.remove incidental : $(r) ] ] ;
Index: tools/inspect/unnamed_namespace_check.cpp
===================================================================
RCS file: /cvsroot/boost/boost/tools/inspect/unnamed_namespace_check.cpp,v
retrieving revision 1.1.2.2
diff -u -r1.1.2.2 unnamed_namespace_check.cpp
--- tools/inspect/unnamed_namespace_check.cpp	24 Jul 2006 18:32:46 -0000	1.1.2.2
+++ tools/inspect/unnamed_namespace_check.cpp	26 Aug 2006 12:35:48 -0000
@@ -32,7 +32,7 @@
      register_signature( ".hh" ); // just in case
      register_signature( ".hpp" );
      register_signature( ".hxx" ); // just in case
-	 register_signature( ".inc" );
+     register_signature( ".inc" );
      register_signature( ".ipp" );
      register_signature( ".inl" );
    }

