X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=libcds%2Fsrc%2Fstatic_bitsequence%2Fstatic_bitsequence_rrr02_light.h;h=2a5d57fc3475d11e09285715c9e642752f48e514;hb=a75155efc2ed07c1907ef017360bd719a47f9c06;hp=15da0a9591a77392fd15e54523cc001d2eef7c0b;hpb=52cb7bbcda67f4676335cdd4eb96d4d87ad1445d;p=SXSI%2FXMLTree.git

diff --git a/libcds/src/static_bitsequence/static_bitsequence_rrr02_light.h b/libcds/src/static_bitsequence/static_bitsequence_rrr02_light.h
index 15da0a9..2a5d57f 100644
--- a/libcds/src/static_bitsequence/static_bitsequence_rrr02_light.h
+++ b/libcds/src/static_bitsequence/static_bitsequence_rrr02_light.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)