|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r52389 - trunk/libs/graph_parallel/doc
From: jewillco_at_[hidden]
Date: 2009-04-14 12:20:33
Author: jewillco
Date: 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
New Revision: 52389
URL: http://svn.boost.org/trac/boost/changeset/52389
Log:
Removed tabs
Text files modified:
trunk/libs/graph_parallel/doc/dehne_gotz_min_spanning_tree.rst | 12 ++++++------
trunk/libs/graph_parallel/doc/local_subgraph.rst | 4 ++--
trunk/libs/graph_parallel/doc/scalable_rmat_generator.rst | 2 +-
trunk/libs/graph_parallel/doc/simple_trigger.rst | 2 +-
trunk/libs/graph_parallel/doc/sorted_rmat_generator.rst | 4 ++--
trunk/libs/graph_parallel/doc/sorted_unique_rmat_generator.rst | 10 +++++-----
trunk/libs/graph_parallel/doc/unique_rmat_generator.rst | 2 +-
trunk/libs/graph_parallel/doc/vertex_list_adaptor.rst | 2 +-
8 files changed, 19 insertions(+), 19 deletions(-)
Modified: trunk/libs/graph_parallel/doc/dehne_gotz_min_spanning_tree.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/dehne_gotz_min_spanning_tree.rst (original)
+++ trunk/libs/graph_parallel/doc/dehne_gotz_min_spanning_tree.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -110,21 +110,21 @@
typename SupervertexMap>
OutputIterator
dense_boruvka_minimum_spanning_tree(const Graph& g, WeightMap weight_map,
- OutputIterator out,
- VertexIndexMap index,
- RankMap rank_map, ParentMap parent_map,
- SupervertexMap supervertex_map);
+ OutputIterator out,
+ VertexIndexMap index,
+ RankMap rank_map, ParentMap parent_map,
+ SupervertexMap supervertex_map);
template<typename Graph, typename WeightMap, typename OutputIterator,
typename VertexIndex>
OutputIterator
dense_boruvka_minimum_spanning_tree(const Graph& g, WeightMap weight_map,
- OutputIterator out, VertexIndex index);
+ OutputIterator out, VertexIndex index);
template<typename Graph, typename WeightMap, typename OutputIterator>
OutputIterator
dense_boruvka_minimum_spanning_tree(const Graph& g, WeightMap weight_map,
- OutputIterator out);
+ OutputIterator out);
}
Description
Modified: trunk/libs/graph_parallel/doc/local_subgraph.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/local_subgraph.rst (original)
+++ trunk/libs/graph_parallel/doc/local_subgraph.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -45,8 +45,8 @@
::
- DistributedGraph& base() { return g; }
- const DistributedGraph& base() const { return g; }
+ DistributedGraph& base() { return g; }
+ const DistributedGraph& base() const { return g; }
Returns the underlying distributed graph.
Modified: trunk/libs/graph_parallel/doc/scalable_rmat_generator.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/scalable_rmat_generator.rst (original)
+++ trunk/libs/graph_parallel/doc/scalable_rmat_generator.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -10,7 +10,7 @@
::
template<typename ProcessGroup, typename Distribution,
- typename RandomGenerator, typename Graph>
+ typename RandomGenerator, typename Graph>
class scalable_rmat_iterator
{
public:
Modified: trunk/libs/graph_parallel/doc/simple_trigger.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/simple_trigger.rst (original)
+++ trunk/libs/graph_parallel/doc/simple_trigger.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -40,7 +40,7 @@
void
simple_trigger(ProcessGroup& pg, int tag, Class* self,
Result (Class::*pmf)(int source, int tag, const T& data,
- trigger_receive_context context))
+ trigger_receive_context context))
The ``simple_trigger`` function registers a trigger that invokes the
given member function (``pmf``) on the object ``self`` whenever a
Modified: trunk/libs/graph_parallel/doc/sorted_rmat_generator.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/sorted_rmat_generator.rst (original)
+++ trunk/libs/graph_parallel/doc/sorted_rmat_generator.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -59,7 +59,7 @@
sorted_rmat_iterator(RandomGenerator& gen, vertices_size_type n,
edges_size_type m, double a, double b, double c,
double d, bool permute_vertices = true,
- EdgePredicate ep = keep_all_edges());
+ EdgePredicate ep = keep_all_edges());
Constructs an R-MAT generator iterator that creates a graph with ``n``
vertices and ``m`` edges. ``a``, ``b``, ``c``, and ``d`` represent
@@ -111,4 +111,4 @@
:alt: Parallel BGL
:target: http://www.osl.iu.edu/research/pbgl
-.. _compressed sparse row graph: http://www.boost.org/libs/graph/doc/compressed_sparse_row.html
\ No newline at end of file
+.. _compressed sparse row graph: http://www.boost.org/libs/graph/doc/compressed_sparse_row.html
Modified: trunk/libs/graph_parallel/doc/sorted_unique_rmat_generator.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/sorted_unique_rmat_generator.rst (original)
+++ trunk/libs/graph_parallel/doc/sorted_unique_rmat_generator.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -24,8 +24,8 @@
sorted_unique_rmat_iterator(RandomGenerator& gen, vertices_size_type n,
edges_size_type m, double a, double b, double c,
double d, bool bidirectional = true,
- bool permute_vertices = true,
- EdgePredicate ep = keep_all_edges());
+ bool permute_vertices = true,
+ EdgePredicate ep = keep_all_edges());
// Iterator operations
reference operator*() const;
pointer operator->() const;
@@ -61,8 +61,8 @@
sorted_unique_rmat_iterator(RandomGenerator& gen, vertices_size_type n,
edges_size_type m, double a, double b, double c,
double d, bool bidirectional = false,
- bool permute_vertices = true,
- EdgePredicate ep = keep_all_edges());
+ bool permute_vertices = true,
+ EdgePredicate ep = keep_all_edges());
Constructs an R-MAT generator iterator that creates a graph with ``n``
vertices and ``m`` edges. ``a``, ``b``, ``c``, and ``d`` represent
@@ -133,4 +133,4 @@
:alt: Parallel BGL
:target: http://www.osl.iu.edu/research/pbgl
-.. _compressed sparse row graph: http://www.boost.org/libs/graph/doc/compressed_sparse_row.html
\ No newline at end of file
+.. _compressed sparse row graph: http://www.boost.org/libs/graph/doc/compressed_sparse_row.html
Modified: trunk/libs/graph_parallel/doc/unique_rmat_generator.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/unique_rmat_generator.rst (original)
+++ trunk/libs/graph_parallel/doc/unique_rmat_generator.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -57,7 +57,7 @@
unique_rmat_iterator(RandomGenerator& gen, vertices_size_type n,
edges_size_type m, double a, double b, double c,
double d, bool permute_vertices = true,
- EdgePredicate ep = keep_all_edges());
+ EdgePredicate ep = keep_all_edges());
Constructs an R-MAT generator iterator that creates a graph with ``n``
vertices and ``m`` edges. ``a``, ``b``, ``c``, and ``d`` represent
Modified: trunk/libs/graph_parallel/doc/vertex_list_adaptor.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/vertex_list_adaptor.rst (original)
+++ trunk/libs/graph_parallel/doc/vertex_list_adaptor.rst 2009-04-14 12:20:30 EDT (Tue, 14 Apr 2009)
@@ -14,7 +14,7 @@
{
public:
vertex_list_adaptor(const Graph& g,
- const GlobalIndexMap& index_map = GlobalIndexMap());
+ const GlobalIndexMap& index_map = GlobalIndexMap());
};
template<typename Graph, typename GlobalIndexMap>
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