X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=libcds%2Fsrc%2Fstatic_bitsequence%2Ftable_offset.h;h=aabebbad10a580582e24889fd7b80d267e80001d;hb=e38bc834442d5369a523ba47d74865e48995ace4;hp=f24c22e4568434d6b2835d5b47206654850eed78;hpb=0bf9688e2615a9fc07860c5762240e4ce26ee5d3;p=SXSI%2FXMLTree.git

diff --git a/libcds/src/static_bitsequence/table_offset.h b/libcds/src/static_bitsequence/table_offset.h
index f24c22e..aabebba 100644
--- a/libcds/src/static_bitsequence/table_offset.h
+++ b/libcds/src/static_bitsequence/table_offset.h
@@ -25,7 +25,7 @@
 #include <basics.h>
 #include <iostream>
 
-using namespace std;
+//using namespace std;
 
 /** Universal table required for static_bitsequence_rrr02, Raman, Raman and Rao's [1] 
  *  proposal for rank/select capable data structures, it achieves space nH_0, 
@@ -41,6 +41,7 @@ using namespace std;
 class table_offset {
 
 public:
+  /** builds a universal table, designed for u<=15 */
 	table_offset(uint u);
 	~table_offset();
 	
@@ -102,4 +103,3 @@ protected:
 };
 
 #endif
-