Removed old experimental code from interleaved vec

tor.

examples/hugepages.cpp

@@ -1,6 +1,8 @@
 #include <sdsl/int_vector.hpp>
 #include <sdsl/suffixtrees.hpp>
 #include <sdsl/wt_rlmn.hpp>
+#include <sdsl/testutils.hpp>
+#include <sdsl/bit_vector_interleaved.hpp>
 #include <iostream>
 #include <string>
 
@@ -9,10 +11,14 @@ using namespace std;
 
 template<class tCsa>
 void do_something(const tCsa &csa){
+	stop_watch sw;
 	uint64_t sum=0;
-	for(size_t i=0; i<csa.size();++i){
-		sum+=csa[i];
+	sw.start();
+	for(size_t i=0; i<csa.size() and i<10000000;++i){
+		sum+=csa.psi(i);
 	}
+	sw.stop();
+	cout << sw.get_real_time() << endl;
 	cout<<"sum="<<sum<<endl;
 }
 
@@ -32,8 +38,8 @@ int main(int argc, char** argv){
 //	bool mapped = mm::map_hp();
 //	if( mapped ) mm::unmap_hp();
 
-	csa_wt<wt_rlmn<> > csa;
-	construct_csa(string(argv[1]), csa); 
+	csa_wt<wt_huff<bit_vector_interleaved<> > > csa;
+	construct_csa(string(argv[1]), csa);
 	do_something(csa); // before it is mapped
 	mapped = mm::map_hp();
 	do_something(csa); // while it is mapped

include/sdsl/bit_vector_interleaved.hpp

@@ -141,14 +141,6 @@ class bit_vector_interleaved
             init_rank_samples();
         }
 
-		bool map_it(){
-			return m_data.map_it();
-		}
-
-		bool unmap_it(){
-			return m_data.unmap_it();
-		} 
-
         //! Accessing the i-th element of the original bit_vector
         /*! \param i An index i with \f$ 0 \leq i < size()  \f$.
            \return The i-th bit of the original bit_vector