|
|
Boost-Commit : |
From: asutton_at_[hidden]
Date: 2008-08-27 09:33:29
Author: asutton
Date: 2008-08-27 09:33:28 EDT (Wed, 27 Aug 2008)
New Revision: 48404
URL: http://svn.boost.org/trac/boost/changeset/48404
Log:
Removing some old files.
Fixed an inadvertent typo.
Removed:
sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/advanced_search.hpp
sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/iterator.hpp
sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/utility.hpp
Text files modified:
sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/breadth_first.hpp | 3 ---
sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/depth_first.hpp | 3 ---
sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search.hpp | 1 -
sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search/algorithm.hpp | 2 +-
4 files changed, 1 insertions(+), 8 deletions(-)
Deleted: sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/advanced_search.hpp
==============================================================================
Modified: sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/breadth_first.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/breadth_first.hpp (original)
+++ sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/breadth_first.hpp 2008-08-27 09:33:28 EDT (Wed, 27 Aug 2008)
@@ -6,9 +6,6 @@
#include <boost/graphs/colors.hpp>
#include <boost/graphs/directional_edge.hpp>
-#include <boost/graphs/algorithms/utility.hpp>
-#include <boost/graphs/algorithms/iterator.hpp>
-
#include <boost/graphs/algorithms/search.hpp>
Modified: sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/depth_first.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/depth_first.hpp (original)
+++ sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/depth_first.hpp 2008-08-27 09:33:28 EDT (Wed, 27 Aug 2008)
@@ -6,9 +6,6 @@
#include <boost/graphs/colors.hpp>
#include <boost/graphs/directional_edge.hpp>
-#include <boost/graphs/algorithms/utility.hpp>
-#include <boost/graphs/algorithms/iterator.hpp>
-
#include <boost/graphs/algorithms/search.hpp>
/**
Deleted: sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/iterator.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/iterator.hpp 2008-08-27 09:33:28 EDT (Wed, 27 Aug 2008)
+++ (empty file)
@@ -1,68 +0,0 @@
-
-#ifndef ALGORITHM_ITERATOR_HPP
-#define ALGORITHM_ITERATOR_HPP
-
-/**
- * Provide an iterator abstraction over algorithm objects. Dereferencing this
- * iterator returns the algorithm which can then be queried for its current
- * state.
- *
- * This is kind of a strange iterator in the sense that it doesn't support
- * post-increment operations. That would require making a copy of underlying
- * algorithm, which would be very, very expensive. Is this a basic iterator
- * concept?
- *
- * @requires Algorithm<Algorithm>
- *
- * @todo This probably works on any algorithm as long as it provides a next
- * function.
- */
-template <typename Algorithm>
-struct algorithm_iterator
-{
- typedef std::forward_iterator_tag iterator_category;
- typedef std::size_t difference_type;
- typedef Algorithm value_type;
- typedef value_type const& reference;
- typedef value_type const* pointer;
-
- // Construct an end iterator.
- algorithm_iterator()
- : algo()
- { }
-
- // Explicitly build an iterator over the state of the given algo.
- algorithm_iterator(Algorithm* algo)
- : algo(algo)
- { }
-
- inline algorithm_iterator& operator++()
- { algo->next(); return *this; }
-
- // Return true if this iterator is past the end. An iterator is past the
- // end if a) the algo pointer is null or b) the current edge is null.
- bool end() const
- { return !algo || (algo && !algo->current()); }
-
- // Two iterators are equivalent if they're both at the end or both refer
- // to the same edge.
- inline bool operator==(algorithm_iterator const& x) const
- {
- return (!algo && x.end())
- || (!x.algo && end())
- || (algo && x.algo && algo->current() == x.algo->current());
- }
-
- inline bool operator!=(algorithm_iterator const& x) const
- { return !operator==(x); }
-
- inline reference operator*() const
- { return *algo; }
-
- inline pointer operator->() const
- { return algo; }
-
- Algorithm* algo;
-};
-
-#endif
Modified: sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search.hpp (original)
+++ sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search.hpp 2008-08-27 09:33:28 EDT (Wed, 27 Aug 2008)
@@ -7,7 +7,6 @@
#include <boost/graphs/colors.hpp>
#include <boost/graphs/properties.hpp>
-#include <boost/graphs/algorithms/utility.hpp>
#include <boost/graphs/algorithms/search/visitor.hpp>
#include <boost/graphs/algorithms/search/strategy.hpp>
Modified: sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search/algorithm.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search/algorithm.hpp (original)
+++ sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/search/algorithm.hpp 2008-08-27 09:33:28 EDT (Wed, 27 Aug 2008)
@@ -32,7 +32,7 @@
buf.push(v);
color(v, ColorTraits::white());
vis.start_vertex(g, v);
- vis.discover_vertex(v);
+ vis.discover_vertex(g, v);
}
/**
Deleted: sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/utility.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/trunk/boost/graphs/algorithms/utility.hpp 2008-08-27 09:33:28 EDT (Wed, 27 Aug 2008)
+++ (empty file)
@@ -1,5 +0,0 @@
-
-#ifndef ALGORITHM_UTILITY_HPP
-#define ALGORITHM_UTILITY_HPP
-
-#endif
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk