[Boost-commit] svn:boost r52403 - trunk/libs/graph/test

Subject: [Boost-commit] svn:boost r52403 - trunk/libs/graph/test
From: asutton_at_[hidden]
Date: 2009-04-15 08:24:23

Author: asutton
Date: 2009-04-15 08:24:21 EDT (Wed, 15 Apr 2009)
New Revision: 52403
URL: http://svn.boost.org/trac/boost/changeset/52403

Log:
Added missing copyright info for test files.

Text files modified: 
   trunk/libs/graph/test/adj_list_invalidation.cpp |     5 +++++                                   
   trunk/libs/graph/test/adj_list_loops.cpp        |     5 +++++                                   
   trunk/libs/graph/test/core_numbers_test.cpp     |     5 +++++                                   
   trunk/libs/graph/test/dimacs.cpp                |     5 +++++                                   
   trunk/libs/graph/test/test_graphs.cpp           |    12 ++++++++----                            
   5 files changed, 28 insertions(+), 4 deletions(-)

Modified: trunk/libs/graph/test/adj_list_invalidation.cpp
==============================================================================
--- trunk/libs/graph/test/adj_list_invalidation.cpp	(original)
+++ trunk/libs/graph/test/adj_list_invalidation.cpp	2009-04-15 08:24:21 EDT (Wed, 15 Apr 2009)
@@ -1,3 +1,8 @@
+// (C) Copyright Andrew Sutton 2009
+//
+// Use, modification and distribution are subject to the
+// Boost Software License, Version 1.0 (See accompanying file
+// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
 #include <iostream>
 #include <string>

Modified: trunk/libs/graph/test/adj_list_loops.cpp
==============================================================================
--- trunk/libs/graph/test/adj_list_loops.cpp	(original)
+++ trunk/libs/graph/test/adj_list_loops.cpp	2009-04-15 08:24:21 EDT (Wed, 15 Apr 2009)
@@ -1,3 +1,8 @@
+// (C) Copyright Andrew Sutton 2009
+//
+// Use, modification and distribution are subject to the
+// Boost Software License, Version 1.0 (See accompanying file
+// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
 #if __GNUC__ == 4 && __GNUC_MINOR__ >= 3
 # define BOOST_NO_HASH

Modified: trunk/libs/graph/test/core_numbers_test.cpp
==============================================================================
--- trunk/libs/graph/test/core_numbers_test.cpp	(original)
+++ trunk/libs/graph/test/core_numbers_test.cpp	2009-04-15 08:24:21 EDT (Wed, 15 Apr 2009)
@@ -1,3 +1,8 @@
+// (C) Copyright David Gleich 2007
+//
+// Use, modification and distribution are subject to the
+// Boost Software License, Version 1.0 (See accompanying file
+// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
 #include <vector>
 #include <boost/graph/adjacency_list.hpp>

Modified: trunk/libs/graph/test/dimacs.cpp
==============================================================================
--- trunk/libs/graph/test/dimacs.cpp	(original)
+++ trunk/libs/graph/test/dimacs.cpp	2009-04-15 08:24:21 EDT (Wed, 15 Apr 2009)
@@ -1,3 +1,8 @@
+// (C) Copyright Andrew Sutton 2009
+//
+// Use, modification and distribution are subject to the
+// Boost Software License, Version 1.0 (See accompanying file
+// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
 #include <boost/graph/read_dimacs.hpp>
 #include <boost/graph/write_dimacs.hpp>

Modified: trunk/libs/graph/test/test_graphs.cpp
==============================================================================
--- trunk/libs/graph/test/test_graphs.cpp	(original)
+++ trunk/libs/graph/test/test_graphs.cpp	2009-04-15 08:24:21 EDT (Wed, 15 Apr 2009)
@@ -1,9 +1,17 @@
+// (C) Copyright 2007-2009 Andrew Sutton
+//
+// Use, modification and distribution are subject to the
+// Boost Software License, Version 1.0 (See accompanying file
+// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
 
 #include <iostream>
 
 #include <boost/graph/undirected_graph.hpp>
 #include <boost/graph/directed_graph.hpp>
 
+// TODO: Finish implementing this test module. In theory, this will become a
+// generic testing facility for any kind of graph declaration.
+
 using namespace std;
 using namespace boost;
 
@@ -28,16 +36,12 @@
     int n;
 };
 
-// TODO: Finish implementing this test. Actually, generalize the test so that
-// it works for lots of different graph types.
-
 template <typename Graph>
 void test()
 {
     typedef typename Graph::vertex_descriptor Vertex;
     Graph g;
     BOOST_ASSERT(num_vertices(g) == 0);
-
 }
 
 int main()