sdsl/include/sdsl/rank_support.hpp

Go to the documentation of this file.

/* sdsl - succinct data structures library
    Copyright (C) 2008 Simon Gog

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see http://www.gnu.org/licenses/ .
*/
#ifndef INCLUDED_SDSL_RANK_SUPPORT
#define INCLUDED_SDSL_RANK_SUPPORT

#include "int_vector.hpp"

namespace sdsl
{


class rank_support
{
    protected:
        const int_vector<1>* m_v; 
    public:
        typedef int_vector<1>::size_type size_type;


        rank_support(const int_vector<1>* v = NULL);
        rank_support(const rank_support& rs);
        virtual ~rank_support() {}

        virtual void init(const int_vector<1>* v=NULL) = 0;


        virtual const size_type rank(size_type i) const = 0;
        virtual const size_type operator()(size_type idx) const = 0;

        virtual size_type serialize(std::ostream& out, structure_tree_node* v, std::string name)const = 0;

        virtual void load(std::istream& in, const int_vector<1>* v=NULL) = 0;

        virtual void set_vector(const int_vector<1>* v=NULL) = 0;
};

inline rank_support::rank_support(const int_vector<1>* v)
{
    m_v = v;
}

inline rank_support::rank_support(const rank_support& rs)
{
    m_v = rs.m_v;
}

}// end namespace sdsl

#include "rank_support_v.hpp"
#include "rank_support_v5.hpp"
#include "rank_support_jmc.hpp"

#endif // end file