From 51e111660552b2ea7ad6d68e300d7c47f0dd4aae Mon Sep 17 00:00:00 2001 From: wolf Date: Mon, 5 May 2003 13:52:11 +0000 Subject: [PATCH] Update TODO. git-svn-id: https://svn.dealii.org/trunk@7565 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/deal.II/source/multigrid/mg_dof_tools.cc | 10 +++++----- deal.II/deal.II/source/numerics/solution_transfer.cc | 2 +- 2 files changed, 6 insertions(+), 6 deletions(-) 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 &dof, -//TODO: Replace FullMatrix by Table<2,bool> +//TODO[GK]: Replace FullMatrix by Table<2,bool> template void MGTools::make_flux_sparsity_pattern (const MGDoFHandler &dof, - SparsityPattern &sparsity, - const unsigned int level, - const FullMatrix& int_mask, - const FullMatrix& flux_mask) + SparsityPattern &sparsity, + const unsigned int level, + const FullMatrix& int_mask, + const FullMatrix& 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 -//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. -- 2.39.5