Adaptive-CSA | Adaptive CSA , is data-aware , can select the best coding

Adaptive-CSA is a C library. Adaptive-CSA has no bugs, it has no vulnerabilities and it has low support. You can download it from GitHub.

##what is it? adaptive-csa is a succinct data structure(sds),sds can represent an object as implicitly,and in space close to information-theoretic lower bound of the object while supporting operations of the original object efficiently. csa and fm both are implicit expression about sa(suffix array),has the ability of fast pattern mathing,and needs little space,and adapative-csa is faster and smaller than normal-csa,adapative-csa is a advanced version of the original csa.as you can guess,we developed a set of coding methods,for each pieces of data,always select the best one,that's the bigest secret about my works. it works like a mixture of kmp and bzip2,you can build a csa-index for a document,and then you have mainly there operations in your hands:. ##how to use it ###just for fun step 1:download or clone it step 2:make step 3:run my_csa ###build your own program step 1:download or clone it step 2:make step 3:include csa.h step 4:g++ your_program.cpp -o xx csa.a ###example ``cpp #include"csa.h" #include using namespace std; int main() { csa csa("filename"); int num; csa.counting(pattern,num); cout<<"pattern "<<<" occs "<<<" times"<