From 8936bba758d494ee5aa8a2bd0eb6778643f22781 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Fri, 23 Jan 2015 18:55:44 -0600 Subject: [PATCH] Remove deprecated function SparsityPattern::partition. --- doc/news/changes.h | 1 + include/deal.II/lac/sparsity_pattern.h | 39 -------------------------- source/lac/sparsity_pattern.cc | 9 ------ 3 files changed, 1 insertion(+), 48 deletions(-) diff --git a/doc/news/changes.h b/doc/news/changes.h index d3ed4ffacb..9db97cc55d 100644 --- a/doc/news/changes.h +++ b/doc/news/changes.h @@ -152,6 +152,7 @@ inconvenience this causes. argument. - SparsityPattern and ChunkSparsityPattern functions that take an optimize_diagonal argument. + - SparsityPattern::partition. - Mapping::transform_covariant and Mapping::transform_contravariant. - The typedef CompressedBlockSparsityPattern. - The deprecated constructors of SparsityPattern iterator classes. diff --git a/include/deal.II/lac/sparsity_pattern.h b/include/deal.II/lac/sparsity_pattern.h index f271684eed..d213d71945 100644 --- a/include/deal.II/lac/sparsity_pattern.h +++ b/include/deal.II/lac/sparsity_pattern.h @@ -986,45 +986,6 @@ public: */ row_iterator row_end (const size_type r) const DEAL_II_DEPRECATED; - /** - * @deprecated This function is deprecated. Use SparsityTools::partition - * instead. - * - * Use the METIS partitioner to generate a partitioning of the degrees of - * freedom represented by this sparsity pattern. In effect, we view this - * sparsity pattern as a graph of connections between various degrees of - * freedom, where each nonzero entry in the sparsity pattern corresponds to - * an edge between two nodes in the connection graph. The goal is then to - * decompose this graph into groups of nodes so that a minimal number of - * edges are cut by the boundaries between node groups. This partitioning is - * done by METIS. Note that METIS can only partition symmetric sparsity - * patterns, and that of course the sparsity pattern has to be square. We do - * not check for symmetry of the sparsity pattern, since this is an - * expensive operation, but rather leave this as the responsibility of - * caller of this function. - * - * After calling this function, the output array will have values between - * zero and @p n_partitions-1 for each node (i.e. row or column of the - * matrix). - * - * This function will generate an error if METIS is not installed unless @p - * n_partitions is one. I.e., you can write a program so that it runs in the - * single-processor single-partition case without METIS installed, and only - * requires METIS when multiple partitions are required. - * - * Note that the sparsity pattern itself is not changed by calling this - * function. However, you will likely use the information generated by - * calling this function to renumber degrees of freedom, after which you - * will of course have to regenerate the sparsity pattern. - * - * This function will rarely be called separately, since in finite element - * methods you will want to partition the mesh, not the matrix. This can be - * done by calling @p GridTools::partition_triangulation. - */ - void partition (const unsigned int n_partitions, - std::vector &partition_indices) const DEAL_II_DEPRECATED; - - /** * @deprecated This is kind of an expert mode. Get access to the rowstart * array, but read-only. diff --git a/source/lac/sparsity_pattern.cc b/source/lac/sparsity_pattern.cc index 3c8282a582..f854bc0e74 100644 --- a/source/lac/sparsity_pattern.cc +++ b/source/lac/sparsity_pattern.cc @@ -964,15 +964,6 @@ SparsityPattern::memory_consumption () const -void -SparsityPattern:: -partition (const unsigned int n_partitions, - std::vector &partition_indices) const -{ - SparsityTools::partition (*this, n_partitions, partition_indices); -} - - // explicit instantiations template void SparsityPattern::copy_from (const SparsityPattern &); template void SparsityPattern::copy_from (const CompressedSparsityPattern &); -- 2.39.5