Module: ppl/ppl Branch: sparse_matrices Commit: dc67686d3d77fca5c70d1b1947a5722e5022a6b8 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=dc67686d3d77f...

Author: Marco Poletti poletti.marco@gmail.com Date: Fri Apr 16 13:40:00 2010 +0200

Unlimited_Sparse_Row_Over_CO_Tree: remove some TODOs.

---

src/Unlimited_Sparse_Row_Over_CO_Tree.inlines.hh | 6 ------ 1 files changed, 0 insertions(+), 6 deletions(-)

diff --git a/src/Unlimited_Sparse_Row_Over_CO_Tree.inlines.hh b/src/Unlimited_Sparse_Row_Over_CO_Tree.inlines.hh index 65a6020..6007cf0 100644 --- a/src/Unlimited_Sparse_Row_Over_CO_Tree.inlines.hh +++ b/src/Unlimited_Sparse_Row_Over_CO_Tree.inlines.hh @@ -248,7 +248,6 @@ Unlimited_Sparse_Row_Over_CO_Tree::find_dangerous(const dimension_type c, #ifdef NDEBUG (void) itr; #endif - // TODO: consider a faster implementation. return find_dangerous(c); }

@@ -260,7 +259,6 @@ Unlimited_Sparse_Row_Over_CO_Tree #ifdef NDEBUG (void) itr; #endif - // TODO: consider a faster implementation. return lower_bound_dangerous(c); }

@@ -272,7 +270,6 @@ Unlimited_Sparse_Row_Over_CO_Tree::find(const dimension_type c, #ifdef NDEBUG (void) itr; #endif - // TODO: consider a faster implementation. return find(c); }

@@ -284,7 +281,6 @@ Unlimited_Sparse_Row_Over_CO_Tree::lower_bound(const dimension_type c, #ifdef NDEBUG (void) itr; #endif - // TODO: consider a faster implementation. return lower_bound(c); }

@@ -296,7 +292,6 @@ Unlimited_Sparse_Row_Over_CO_Tree::find(const dimension_type c, #ifdef NDEBUG (void) itr; #endif - // TODO: consider a faster implementation. return find(c); }

@@ -308,7 +303,6 @@ Unlimited_Sparse_Row_Over_CO_Tree::lower_bound(const dimension_type c, #ifdef NDEBUG (void) itr; #endif - // TODO: consider a faster implementation. return lower_bound(c); }