From: wolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Mon, 5 May 2003 13:52:11 +0000 (+0000)
Subject: Update TODO.
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=51e111660552b2ea7ad6d68e300d7c47f0dd4aae;p=dealii-svn.git

Update TODO.


git-svn-id: https://svn.dealii.org/trunk@7565 0785d39b-7218-0410-832d-ea1e28bc413d
---

diff --git a/deal.II/deal.II/source/multigrid/mg_dof_tools.cc b/deal.II/deal.II/source/multigrid/mg_dof_tools.cc
index 28bf830e96..505deea3e3 100644
--- a/deal.II/deal.II/source/multigrid/mg_dof_tools.cc
+++ b/deal.II/deal.II/source/multigrid/mg_dof_tools.cc
@@ -177,14 +177,14 @@ MGTools::make_flux_sparsity_pattern_edge (const MGDoFHandler<dim> &dof,
 
 
 
-//TODO: Replace FullMatrix by Table<2,bool>
+//TODO[GK]: Replace FullMatrix by Table<2,bool>
 template<int dim, class SparsityPattern>
 void
 MGTools::make_flux_sparsity_pattern (const MGDoFHandler<dim> &dof,
-					SparsityPattern       &sparsity,
-					const unsigned int level,
-					const FullMatrix<double>& int_mask,
-					const FullMatrix<double>& flux_mask)
+                                     SparsityPattern       &sparsity,
+                                     const unsigned int level,
+                                     const FullMatrix<double>& int_mask,
+                                     const FullMatrix<double>& flux_mask)
 {
   const unsigned int n_dofs = dof.n_dofs(level);
   const unsigned int n_comp = dof.get_fe().n_components();
diff --git a/deal.II/deal.II/source/numerics/solution_transfer.cc b/deal.II/deal.II/source/numerics/solution_transfer.cc
index 96fa0927c8..153d2b5c57 100644
--- a/deal.II/deal.II/source/numerics/solution_transfer.cc
+++ b/deal.II/deal.II/source/numerics/solution_transfer.cc
@@ -23,7 +23,7 @@
 #include <numerics/solution_transfer.h>
 
 
-//TODO: the storage of data in the indices_on_cell array is rather inefficient, both in terms of memory as well as in terms of computing time, since we allocate a large array of small vectors. It would be more efficient to use a Table<2> for that, but since we let user pointers point into this data, this is not exactly a 5-minuter to change. should be done, however, sometimes.
+//TODO[?]: the storage of data in the indices_on_cell array is rather inefficient, both in terms of memory as well as in terms of computing time, since we allocate a large array of small vectors. It would be more efficient to use a Table<2> for that, but since we let user pointers point into this data, this is not exactly a 5-minuter to change. should be done, however, sometimes.