X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=libcds%2Fsrc%2Fstatic_bitsequence%2Fstatic_bitsequence_rrr02.h;h=e50d27386db9cb83ebedb87cb3d43ff962ba7372;hb=f32808a35be7a1e62830a5972473178014fa44e5;hp=33276720410f84ed20675d22167d058a6de546ce;hpb=9c696a1b1a7034794b3768e4e1e40db86e87ebbb;p=SXSI%2FXMLTree.git

diff --git a/libcds/src/static_bitsequence/static_bitsequence_rrr02.h b/libcds/src/static_bitsequence/static_bitsequence_rrr02.h
index 3327672..e50d273 100644
--- a/libcds/src/static_bitsequence/static_bitsequence_rrr02.h
+++ b/libcds/src/static_bitsequence/static_bitsequence_rrr02.h
@@ -31,7 +31,7 @@
 #include <cassert>
 #include <iostream>
 
-using namespace std;
+//using namespace std;
 
 /** Implementation of Raman, Raman and Rao's [1] proposal for rank/select capable
  *  data structures, it achieves space nH_0, O(sample_rate) time for rank and O(log len)