_neigh(size_type n, idx_type row, idx_type col, size_type level, std::vector< idx_type > &acc) const | sdsl::k2_tree< k, t_bv, t_rank > | inlineprotected |
_reverse_neigh(size_type n, idx_type row, idx_type col, size_type level, std::vector< idx_type > &acc) const | sdsl::k2_tree< k, t_bv, t_rank > | inlineprotected |
adj(idx_type i, idx_type j) const | sdsl::k2_tree< k, t_bv, t_rank > | inline |
build_from_edges(std::vector< std::tuple< idx_type, idx_type > > &edges, const size_type size) | sdsl::k2_tree< k, t_bv, t_rank > | inlineprotected |
build_from_matrix(const std::vector< std::vector< int > > &matrix) | sdsl::k2_tree< k, t_bv, t_rank > | inlineprotected |
CEREAL_LOAD_FUNCTION_NAME(archive_t &ar) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
CEREAL_SAVE_FUNCTION_NAME(archive_t &ar) const | sdsl::k2_tree< k, t_bv, t_rank > | inline |
get_l() | sdsl::k2_tree< k, t_bv, t_rank > | inline |
get_t() | sdsl::k2_tree< k, t_bv, t_rank > | inline |
idx_type typedef | sdsl::k2_tree< k, t_bv, t_rank > | |
k2_tree()=default | sdsl::k2_tree< k, t_bv, t_rank > | |
k2_tree(std::vector< std::vector< int > > &matrix) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
k2_tree(std::vector< std::tuple< idx_type, idx_type > > &edges, const size_type size) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
k2_tree(std::string filename, size_type size=0) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
k2_tree(const k2_tree &tr) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
k2_tree(k2_tree &&tr) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
load(std::istream &in) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
neigh(idx_type i) const | sdsl::k2_tree< k, t_bv, t_rank > | inline |
operator=(k2_tree &&tr) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
operator=(k2_tree &tr) | sdsl::k2_tree< k, t_bv, t_rank > | inline |
operator==(const k2_tree &tr) const | sdsl::k2_tree< k, t_bv, t_rank > | inline |
reverse_neigh(idx_type i) const | sdsl::k2_tree< k, t_bv, t_rank > | inline |
serialize(std::ostream &out, structure_tree_node *v=nullptr, std::string name="") const | sdsl::k2_tree< k, t_bv, t_rank > | inline |
size_type typedef | sdsl::k2_tree< k, t_bv, t_rank > | |