[Boost-commit] svn:boost r42921 - branches/unordered/trunk/libs/unordered/test/unordered

From: daniel_james_at_[hidden]
Date: 2008-01-23 06:43:35

Author: danieljames
Date: 2008-01-23 06:43:35 EST (Wed, 23 Jan 2008)
New Revision: 42921
URL: http://svn.boost.org/trac/boost/changeset/42921

Log:
Remove some tabs.
Text files modified: 
   branches/unordered/trunk/libs/unordered/test/unordered/simple_tests.cpp |    18 +++++++++---------                      
   1 files changed, 9 insertions(+), 9 deletions(-)

Modified: branches/unordered/trunk/libs/unordered/test/unordered/simple_tests.cpp
==============================================================================
--- branches/unordered/trunk/libs/unordered/test/unordered/simple_tests.cpp	(original)
+++ branches/unordered/trunk/libs/unordered/test/unordered/simple_tests.cpp	2008-01-23 06:43:35 EST (Wed, 23 Jan 2008)
@@ -84,8 +84,8 @@
 
 int main()
 {
-  	using namespace std;
-   	srand(14878);
+    using namespace std;
+    srand(14878);
 
     std::cout<<"Test unordered_set.\n";
     boost::unordered_set<int> set;
@@ -99,9 +99,9 @@
     simple_test(multiset);
     
     for(int i1 = 0; i1 < 1000; ++i1) {
-    	int count = rand() % 10, index = rand();
-    	for(int j = 0; j < count; ++j)
-	    	multiset.insert(index);
+        int count = rand() % 10, index = rand();
+        for(int j = 0; j < count; ++j)
+            multiset.insert(index);
     }
     simple_test(multiset);
     
@@ -109,7 +109,7 @@
     boost::unordered_map<int, int> map;
 
     for(int i2 = 0; i2 < 1000; ++i2) {
-    	map.insert(std::pair<const int, int>(rand(), rand()));
+        map.insert(std::pair<const int, int>(rand(), rand()));
     }
     simple_test(map);
 
@@ -117,9 +117,9 @@
     boost::unordered_multimap<int, int> multimap;
 
     for(int i3 = 0; i3 < 1000; ++i3) {
-    	int count = rand() % 10, index = rand();
-    	for(int j = 0; j < count; ++j)
-	    	multimap.insert(std::pair<const int, int>(index, rand()));
+        int count = rand() % 10, index = rand();
+        for(int j = 0; j < count; ++j)
+            multimap.insert(std::pair<const int, int>(index, rand()));
     }
     simple_test(multimap);