From 5e0ea4d9a9bfbcfc4a6f386226adb9a7f9a428d6 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Mon, 30 Apr 2001 11:10:49 +0000 Subject: [PATCH] Remove TODO, add comment. git-svn-id: https://svn.dealii.org/trunk@4508 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/lac/include/lac/filtered_matrix.h | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-) diff --git a/deal.II/lac/include/lac/filtered_matrix.h b/deal.II/lac/include/lac/filtered_matrix.h index 03dc7f33a4..621b3c2d80 100644 --- a/deal.II/lac/include/lac/filtered_matrix.h +++ b/deal.II/lac/include/lac/filtered_matrix.h @@ -281,6 +281,12 @@ class FilteredMatrix : public Subscriptor * @p{std::map}, * this is automatically the * case. + * + * Note that we do not check + * whether the input range is + * sorted, as this would be too + * expensive. You have to ensure + * this yourself. */ template void add_constraints (const ConstraintList &new_constraints); @@ -588,7 +594,6 @@ add_constraints (const ConstraintList &new_constraints) constraints.begin()+old_size, constraints.end(), PairComparison()); -//TODO:[WB] Use equal_range etc to assert that the array is indeed sorted }; -- 2.39.5