inv_list.h

Go to the documentation of this file.

#ifndef GPUGenie_inv_list_h
#define GPUGenie_inv_list_h

#include <vector>
#include <string>
#include <unordered_map>

namespace genie
{
namespace table
{

class inv_list
{
public:
    /* \var vector<int> distinct_value_sequence
     * \brief Used in sequence search. compact the range.
     */
    std::unordered_map<int, int> _distinct;


private:
    int _size;

    std::pair<int, int> _bound;

    std::vector<std::vector<int> > _inv;

    unsigned int shift_bits_subsequence;


public:
    inv_list() :
            _size(0)
    {
    }

    inv_list(std::vector<int>& vin);

    inv_list(std::vector<int>* vin);

    unsigned int
    _shift_bits_subsequence();
    void
    invert_bijectMap(std::vector<std::vector<int> > & vin);

    void
    invert_bijectMap(int *data, unsigned int item_num, unsigned int *index, unsigned int row_num);

    void
    invert_subsequence(std::vector<std::vector<int>> & vin);


    void
    invert_subsequence(int *data, unsigned int item_num, unsigned int * index, unsigned int row_num);

    void
    invert_sequence(std::vector<std::vector<int>> & vin, int shift_bits);
    //invert_sequence(vector<vector<int> > & vin, int & shift_bits, vector<int> & respective_id);


    inv_list(std::vector<std::string>& vin);

    inv_list(std::vector<std::string>* vin);

    int
    min();

    int
    max();

    int
    size();

    void
    invert(std::vector<int>& vin);

    void
    invert(std::vector<int>* vin);

    void
    invert(std::vector<std::string>& vin);

    void
    invert(std::vector<std::string>* vin);

    void
    invert(std::vector<std::string>& vin, int (*stoi)(std::string&));

    void
    invert(std::vector<std::string>* vin, int (*stoi)(std::string&));

    bool
    contains(int value);

    std::vector<int>*
    index(int value);

    int
    value_range();

};

} // namespace table
} // namespace genie

#endif