From 6ca53a7a30147ddc46b679bd64699fc9f93c858e Mon Sep 17 00:00:00 2001
From: Michael Stevens <mail@michael-stevens.de>
Date: Tue, 21 Sep 2004 13:43:39 +0000
Subject: [PATCH] remove std::set and non concept insert

[SVN r25307]
---
 .../boost/numeric/ublas/storage_sparse.hpp    | 33 -------------------
 1 file changed, 33 deletions(-)

diff --git a/include/boost/numeric/ublas/storage_sparse.hpp b/include/boost/numeric/ublas/storage_sparse.hpp
index d72848b4..154819df 100644
--- a/include/boost/numeric/ublas/storage_sparse.hpp
+++ b/include/boost/numeric/ublas/storage_sparse.hpp
@@ -18,7 +18,6 @@
 #define BOOST_UBLAS_STORAGE_SPARSE_H
 
 #include <map>
-#include <set>
 
 #include <boost/numeric/ublas/storage.hpp>
 
@@ -377,22 +376,6 @@ namespace boost { namespace numeric { namespace ublas {
         }
         // This function seems to be big. So we do not let the compiler inline it.
         // BOOST_UBLAS_INLINE
-        void insert (pointer it, pointer it1, pointer it2) {
-#if BOOST_UBLAS_CHECK_ENABLE
-            while (it1 != it2) {
-                insert (it, *it1);
-                ++ it1;
-            }
-#else
-            difference_type n = it - begin ();
-            resize (size () + it2 - it1);
-            it = begin () + n;
-            std::copy (it1, it2, it);
-            std::sort (begin (), end (), detail::less_pair<value_type> ());
-#endif
-        }
-        // This function seems to be big. So we do not let the compiler inline it.
-        // BOOST_UBLAS_INLINE
         void erase (pointer it) {
             BOOST_UBLAS_CHECK (begin () <= it && it < end (), bad_index ());
             // Fixed by George Katsirelos.
@@ -713,22 +696,6 @@ namespace boost { namespace numeric { namespace ublas {
         }
         // This function seems to be big. So we do not let the compiler inline it.
         // BOOST_UBLAS_INLINE
-        void insert (pointer it, pointer it1, pointer it2) {
-#if BOOST_UBLAS_CHECK_ENABLE
-            while (it1 != it2) {
-                insert (it, *it1);
-                ++ it1;
-            }
-#else
-            difference_type n = it - begin ();
-            resize (size () + it2 - it1);
-            it = begin () + n;
-            std::copy (it1, it2, it);
-            std::sort (begin (), end (), std::less<value_type> ());
-#endif
-        }
-        // This function seems to be big. So we do not let the compiler inline it.
-        // BOOST_UBLAS_INLINE
         void erase (pointer it) {
             BOOST_UBLAS_CHECK (begin () <= it && it < end (), bad_index ());
             std::copy (it + 1, end (), it);