|
|
Boost-Commit : |
From: asutton_at_[hidden]
Date: 2008-06-02 20:19:11
Author: asutton
Date: 2008-06-02 20:19:10 EDT (Mon, 02 Jun 2008)
New Revision: 46069
URL: http://svn.boost.org/trac/boost/changeset/46069
Log:
Renamed a bunch of files.
Added:
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/incidence.hpp
- copied unchanged from r46068, /sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_set.hpp
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/incidence_list.hpp
- copied unchanged from r46068, /sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_list.hpp
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/incidence_store
- copied unchanged from r46068, /sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_store.hpp
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/incidence_vector.hpp
- copied unchanged from r46068, /sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_vector.hpp
Removed:
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_list.hpp
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_set.hpp
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_store.hpp
sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_vector.hpp
Deleted: sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_list.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_list.hpp 2008-06-02 20:19:10 EDT (Mon, 02 Jun 2008)
+++ (empty file)
@@ -1,98 +0,0 @@
-
-#ifndef BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_LIST_HPP
-#define BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_LIST_HPP
-
-#include <list>
-#include <algorithm>
-
-#include <boost/graphs/adjacency_list/ves/vertex_edge_store.hpp>
-
-namespace boost {
-namespace graphs {
-namespace adj_list {
-
-/**
- * The vertex edge list provides list-based storage for edges connected to
- * vertices. This type supports insertions in constant time, and find and
- * remove in linear w.r.t. to degree of the vertex.
- *
- * Vertex edge lists work well with both simple and multigraphs, arguably
- * offering near-optimal performance in the average case.
- */
-template <typename Edge>
-class vertex_edge_list
- : public vertex_edge_store< std::list<Edge> >
-{
- typedef vertex_edge_store< std::list<Edge> > base_type;
-public:
- typedef Edge edge_descriptor;
- typedef typename base_type::iterator iterator;
- typedef typename base_type::const_iterator const_iterator;
- typedef typename base_type::size_type size_type;
-
- // Constructors
- inline vertex_edge_list();
-
- // Add/Find/Remove interface.
- inline void add(edge_descriptor e);
- inline iterator find(edge_descriptor e);
- inline const_iterator find(edge_descriptor e) const;
- inline void remove(edge_descriptor e);
- inline void clear();
- inline size_type size() const;
-};
-
-// Functions
-
-template <typename E>
-vertex_edge_list<E>::vertex_edge_list()
- : base_type()
-{ }
-
-template <typename E>
-void
-vertex_edge_list<E>::add(edge_descriptor e)
-{
- this->_store.push_back(e);
-}
-
-template <typename E>
-typename vertex_edge_list<E>::iterator
-vertex_edge_list<E>::find(edge_descriptor e)
-{
- return std::find(this->_store.begin(), this->_store.end(), e);
-}
-
-template <typename E>
-typename vertex_edge_list<E>::const_iterator
-vertex_edge_list<E>::find(edge_descriptor e) const
-{
- return std::find(this->_store.begin(), this->_store.end(), e);
-}
-
-template <typename E>
-void
-vertex_edge_list<E>::remove(edge_descriptor e)
-{
- this->_store.erase(find(e));
-}
-
-template <typename E>
-void
-vertex_edge_list<E>::clear()
-{
- this->_store.clear();
-}
-
-template <typename E>
-typename vertex_edge_list<E>::size_type
-vertex_edge_list<E>::size() const
-{
- return this->_store.size();
-}
-
-} /* namespace adj_list */
-} /* namespace graphs */
-} /* namespace boost */
-
-#endif
Deleted: sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_set.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_set.hpp 2008-06-02 20:19:10 EDT (Mon, 02 Jun 2008)
+++ (empty file)
@@ -1,96 +0,0 @@
-
-#ifndef BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_SET_HPP
-#define BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_SET_HPP
-
-#include <set>
-
-#include <boost/graphs/adjacency_list/ves/vertex_edge_store.hpp>
-
-namespace boost {
-namespace graphs {
-namespace adj_list {
-
-/**
- * The vertex edge set provides set-based storage for edges connected to
- * vertices. This type supports insertions, find, and removal in logarithmic
- * time. Vertex edge sets only work for simple graphs since they preclude the
- * possibility of parallel edges.
- */
-template <typename Edge>
-class vertex_edge_set
- : public vertex_edge_store< std::set<Edge> >
-{
- typedef vertex_edge_store< std::set<Edge> > base_type;
-public:
- typedef Edge edge_descriptor;
- typedef typename base_type::iterator iterator;
- typedef typename base_type::const_iterator const_iterator;
- typedef typename base_type::size_type size_type;
-
- // Constructors
- vertex_edge_set();
-
- // Add/Find/Remove interface.
- inline void add(edge_descriptor e);
- inline iterator find(edge_descriptor e);
- inline const_iterator find(edge_descriptor e) const;
- inline void remove(edge_descriptor e);
- inline void clear();
- inline size_type size() const;
-};
-
-// Functions
-
-template <typename E>
-vertex_edge_set<E>::vertex_edge_set()
- : base_type()
-{ }
-
-template <typename E>
-void
-vertex_edge_set<E>::add(edge_descriptor e)
-{
- this->_store.insert(e);
-}
-
-template <typename E>
-typename vertex_edge_set<E>::iterator
-vertex_edge_set<E>::find(edge_descriptor e)
-{
- return this->_store.find(e);
-}
-
-template <typename E>
-typename vertex_edge_set<E>::const_iterator
-vertex_edge_set<E>::find(edge_descriptor e) const
-{
- return this->_store.find(e);
-}
-
-template <typename E>
-void
-vertex_edge_set<E>::remove(edge_descriptor e)
-{
- this->_store.erase(e);
-}
-
-template <typename E>
-void
-vertex_edge_set<E>::clear()
-{
- this->_store.clear();
-}
-
-template <typename E>
-typename vertex_edge_set<E>::size_type
-vertex_edge_set<E>::size() const
-{
- return this->_store.size();
-}
-
-
-} /* namespace adj_list */
-} /* namespace graphs */
-} /* namespace boost */
-
-#endif
Deleted: sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_store.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_store.hpp 2008-06-02 20:19:10 EDT (Mon, 02 Jun 2008)
+++ (empty file)
@@ -1,76 +0,0 @@
-
-#ifndef BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_STORE_HPP
-#define BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_STORE_HPP
-
-#include <set>
-
-namespace boost {
-namespace graphs {
-namespace adj_list {
-
-/**
- * The vertex store is a simple helper class that provides a number of common
- * functions for derived types.
- */
-template <typename Store>
-class vertex_edge_store
-{
-public:
- typedef typename Store::iterator iterator;
- typedef typename Store::const_iterator const_iterator;
- typedef typename Store::size_type size_type;
-
- // Constructors
- vertex_edge_store();
-
- // Iterator access.
- inline iterator begin();
- inline iterator end();
-
- inline const_iterator begin() const;
- inline const_iterator end() const;
-
-protected:
- Store _store;
-};
-
-// Functions
-
-template <typename S>
-vertex_edge_store<S>::vertex_edge_store()
- : _store()
-{ }
-
-template <typename S>
-typename vertex_edge_store<S>::iterator
-vertex_edge_store<S>::begin()
-{
- return _store.begin();
-}
-
-template <typename S>
-typename vertex_edge_store<S>::iterator
-vertex_edge_store<S>::end()
-{
- return _store.end();
-}
-
-template <typename S>
-typename vertex_edge_store<S>::const_iterator
-vertex_edge_store<S>::begin() const
-{
- return _store.begin();
-}
-
-template <typename S>
-typename vertex_edge_store<S>::const_iterator
-vertex_edge_store<S>::end() const
-{
- return _store.end();
-}
-
-} /* namespace adj_list */
-} /* namespace graphs */
-} /* namespace boost */
-
-#endif
Deleted: sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_vector.hpp
==============================================================================
--- sandbox/SOC/2008/graphs/branches/tagged/boost/graphs/adjacency_list/is/vertex_edge_vector.hpp 2008-06-02 20:19:10 EDT (Mon, 02 Jun 2008)
+++ (empty file)
@@ -1,95 +0,0 @@
-
-#ifndef BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_VECTOR_HPP
-#define BOOST_GRAPHS_ADJACENCY_LIST_VERTEX_EDGE_VECTOR_HPP
-
-#include <vector>
-
-#include <boost/graphs/adjacency_list/ves/vertex_edge_store.hpp>
-
-namespace boost {
-namespace graphs {
-namespace adj_list {
-
-/**
- * The vertex edge vector provides vector-based storage for edges connected to
- * vertices. This type supports insertions in constant time, and find and
- * remove are supported in linear time. The remove operation will invalidate
- * vertex edge iterators (i.e., in, out, incident, adjacency).
- */
-template <typename Edge>
-class vertex_edge_vector
- : public vertex_edge_store< std::vector<Edge> >
-{
- typedef vertex_edge_store< std::vector<Edge> > base_type;
-public:
- typedef Edge edge_descriptor;
- typedef typename base_type::iterator iterator;
- typedef typename base_type::const_iterator const_iterator;
- typedef typename base_type::size_type size_type;
-
- // Constructors
- inline vertex_edge_vector();
-
- // Add/Find/Remove interface.
- inline void add(edge_descriptor e);
- inline iterator find(edge_descriptor e);
- inline const_iterator find(edge_descriptor e) const;
- inline void remove(edge_descriptor e);
- inline void clear();
- inline size_type size() const;
-};
-
-// Functions
-
-template <typename E>
-vertex_edge_vector<E>::vertex_edge_vector()
- : base_type()
-{ }
-
-template <typename E>
-void
-vertex_edge_vector<E>::add(edge_descriptor e)
-{
- this->_store.push_back(e);
-}
-
-template <typename E>
-typename vertex_edge_vector<E>::iterator
-vertex_edge_vector<E>::find(edge_descriptor e)
-{
- return std::find(this->_store.begin(), this->_store.end(), e);
-}
-
-template <typename E>
-typename vertex_edge_vector<E>::const_iterator
-vertex_edge_vector<E>::find(edge_descriptor e) const
-{
- return std::find(this->_store.begin(), this->_store.end(), e);
-}
-
-template <typename E>
-void
-vertex_edge_vector<E>::remove(edge_descriptor e)
-{
- this->_store.erase(find(e));
-}
-
-template <typename E>
-void
-vertex_edge_vector<E>::clear()
-{
- this->_store.clear();
-}
-
-template <typename E>
-typename vertex_edge_vector<E>::size_type
-vertex_edge_vector<E>::size() const
-{
- return this->_store.size();
-}
-
-} /* namespace adj_list */
-} /* namespace graphs */
-} /* namespace boost */
-
-#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