2
0
mirror of https://github.com/boostorg/ublas.git synced 2026-02-20 15:12:16 +00:00

remove std::set and non concept insert

[SVN r25307]
This commit is contained in:
Michael Stevens
2004-09-21 13:43:39 +00:00
parent c4a7dac1a7
commit 6ca53a7a30

View File

@@ -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);