SDSL: Succinct Data Structure Library
A C++ template library for succinct data structures
|
bit_vector_type typedef (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | |
gap_rank_support(const bit_vector_type *v=NULL) (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
init(const bit_vector_type *v=NULL) (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
load(std::istream &in, const bit_vector_type *v=NULL) (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
operator!=(const gap_rank_support &rs) const (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
operator()(size_type i) const (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
operator=(const gap_rank_support &rs) (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
operator==(const gap_rank_support &ss) const (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
rank(size_type i) const (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
serialize(std::ostream &out, structure_tree_node *v=NULL, std::string name="") const (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
set_vector(const bit_vector_type *v=NULL) (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
size() const (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |
size_type typedef (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | |
swap(gap_rank_support &rs) (defined in sdsl::gap_rank_support< b >) | sdsl::gap_rank_support< b > | [inline] |