From 8d7efe6754b354d71ddbfacad2a9cb3d24a0fd47 Mon Sep 17 00:00:00 2001 From: bangerth Date: Sun, 30 Dec 2012 02:09:20 +0000 Subject: [PATCH] Un-deprecated a function and explain alternatives when appropriate. git-svn-id: https://svn.dealii.org/branches/branch_deprecated@27871 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/include/deal.II/lac/sparsity_pattern.h | 10 ++++++++-- 1 file changed, 8 insertions(+), 2 deletions(-) diff --git a/deal.II/include/deal.II/lac/sparsity_pattern.h b/deal.II/include/deal.II/lac/sparsity_pattern.h index 633c11c8e8..411b81b6e0 100644 --- a/deal.II/include/deal.II/lac/sparsity_pattern.h +++ b/deal.II/include/deal.II/lac/sparsity_pattern.h @@ -790,10 +790,16 @@ public: * complexity of this function is log(m) if the sparsity pattern is * compressed. * - * @deprecated Use SparseMatrix::const_iterator + * @note This function is not cheap since it has to search through all + * of the elements of the given row i to find whether index + * j exists. Thus, it is more expensive than necessary in cases + * where you want to loop over all of the nonzero elements of this + * sparsity pattern (or of a sparse matrix associated with it) or of a + * single row. In such cases, it is more efficient to use iterators over + * the elements of the sparsity pattern or of the sparse matrix. */ unsigned int operator() (const unsigned int i, - const unsigned int j) const DEAL_II_DEPRECATED; + const unsigned int j) const; /** * This is the inverse operation to operator()(): given a global index, find -- 2.39.5