HSDS - Hide's Succinct Data Structure library collection

Install

$ git clone git://github.com/hideo55/cpp-HSDS.git
$ cd cpp-HSDS
$ git submodule init
$ git submodule update
$ cmake .
$ make && make install

Libraries

BitVector

BitVector class is implementation of Succinct Bit Vector(a.k.a. Fully Indexable Dictionary).

Sample

#include "hsds/bit-vector.hpp"

using namespace hsds;

int main(){
    BitVector bv;
    bv.set(0, true);
    bv.set(100, true);
    
    ...
    
    bv.build();
    
    uint64_t pos = bv.select1(0); // =0
    pos = bv.select1(1);          // =100
    pos = bv.select0(0);          // =1
 
    return 0;   
}

Build

$ g++ sample.cpp -o sample -lhsds-bitvector

WaveletMatrix

WaveletMatrix class is implementation of the Wavelet Matrix.

#include "hsds/wavelet-matrix.hpp"

using namespace std;
using namespace hsds;

void main(){
    vector<uint64_t> vec;
    vec.push_back(1);
    vec.push_back(3);
    vec.push_back(1);
    vec.push_back(4);
    vec.push_back(2);
    vec.push_back(10);
    vec.push_back(1);

    WaveletMatix wm;
    
    wm.build(vec);
    
    cout << wm[3] << endl;          // =4 ... vec[3]
    cout << wm.rank(2, 6) << endl;         // =2 ... The number of 2 in vec[0..5]
    cout << wm.select(2,2) << endl;        // =5 ... The second 2 appeared in vec[5]
    cout << wm.rankLessThan(4, 5) << endl; // =3 ... {1,0,2}  appear in vec[0..5]
    cout << wm.rankMoreThan(4, 5) << endl; // =1 ... {5} appear in vec[0..5]
    
    uint64_t pos = 0, val = 0;
    wm.maxRange(1, 6, pos, val); // =(pos=3, val=4). A[3]=4 is the maximum in vec[1...6)
    wm.minRange(1, 6, pos, val); // =(pos=2, val=0) A[6]=0 is minimum in vec[3..6)
    wm.quantileRange(1, 6, 3, pos, val); // = (pos=4, val=2). Sort A[1...6) = 01224, and take the (3+1)-th value
    
    std::vector<ListResult> result;
    wm.listModeRange(1,3, 0, 8, 3, result); //  = (c=2, freq=2), (c=1, freq=1)
    
    result.clear();
    wm.listMaxRange(1,5, 0, 8, 3, result); // = (c=4, freq=1), (c=3, freq=1), (c=2, freq=2)
    
    result.clear();
    wm.listMinRange(0,5, 0, 8, 3, result); // = (c=0, freq=2), (c=1, freq=1), (c=2, freq=2)
    
    return 0;    
}

Build

$ g++ sample.cpp -o sample -lhsds-waveletmatrix

Trie(LOUDS)

Trie class is implementation of LOUDS(Level-Order Unary Degree Sequence) Trie.

#include "hsds/trie.hpp"

using namespace std;
using namespace hsds;

void main(){
    vector<string> keyList;
    keyList.push_back("abc");
    keyList.push_back("abcdef");
    keyList.push_back("xyz");
    
    Trie trie;
    trie.build(keyList);
    
    vector<Trie::id_t> ids;
    trie.commomPrefixSearch("abcdef", 6, ids);
    vector<Trie::Result> results;
    trie.commonPrefixSearch("abcdef", 6, results);
}

Build

$ g++ sample.cpp -o sample -lhsds-trie

Document

API Documentation

Author

Hideaki Ohno

License

(The MIT License)

Copyright (c) 2013 Hideaki Ohno <hide.o.j55{at}gmail.com>

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.