From 30f9601c9c5a102930fea285b55feb515402ea4c Mon Sep 17 00:00:00 2001
From: wolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Mon, 14 Apr 2003 14:47:18 +0000
Subject: [PATCH] Add two TODOs for Guido.

git-svn-id: https://svn.dealii.org/trunk@7393 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/lac/include/lac/sparse_matrix_ez.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/deal.II/lac/include/lac/sparse_matrix_ez.h b/deal.II/lac/include/lac/sparse_matrix_ez.h
index 880d90b3a9..158c276dab 100644
--- a/deal.II/lac/include/lac/sparse_matrix_ez.h
+++ b/deal.II/lac/include/lac/sparse_matrix_ez.h
@@ -1118,6 +1118,7 @@ inline
 typename SparseMatrixEZ<number>::const_iterator&
 SparseMatrixEZ<number>::const_iterator::operator++ ()
 {
+//TODO[GK]: exclude entries with column index -1, i.e. simply jump over them  
   Assert (accessor.a_row < accessor.matrix->m(), ExcIteratorPastEnd());
   
   ++(accessor.a_index);
@@ -1320,6 +1321,8 @@ void SparseMatrixEZ<number>::set (const unsigned int i,
 {
   Assert (i<m(), ExcIndexRange(i,0,m()));
   Assert (j<n(), ExcIndexRange(j,0,n()));
+
+//TODO[GK]: Do as the documentation promises: ignore zero values. The complication is that we should ignore the zero entry if no entry is there already, but set an existing entry to zero
   Entry* entry = allocate(i,j);
   entry->value = value;
 }
-- 
2.39.5