barry: Your go-to motif accountant
0.0-1
Full enumeration of sample space and fast count of sufficient statistics for binary arrays
|
This is the complete list of members for BArray< Cell_Type, Data_Type >, including all inherited members.
BArray() | BArray< Cell_Type, Data_Type > | inline |
BArray(size_t N_, size_t M_) | BArray< Cell_Type, Data_Type > | inline |
BArray(size_t N_, size_t M_, const std::vector< size_t > &source, const std::vector< size_t > &target, const std::vector< Cell_Type > &value, bool add=true) | BArray< Cell_Type, Data_Type > | |
BArray(size_t N_, size_t M_, const std::vector< size_t > &source, const std::vector< size_t > &target, bool add=true) | BArray< Cell_Type, Data_Type > | |
BArray(const BArray< Cell_Type, Data_Type > &Array_, bool copy_data=false) | BArray< Cell_Type, Data_Type > | |
BArray(BArray< Cell_Type, Data_Type > &&x) noexcept | BArray< Cell_Type, Data_Type > | |
BArrayCell< Cell_Type, Data_Type > class | BArray< Cell_Type, Data_Type > | friend |
BArrayCell_const< Cell_Type, Data_Type > class | BArray< Cell_Type, Data_Type > | friend |
clear(bool hard=true) | BArray< Cell_Type, Data_Type > | |
col(size_t i, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
D() | BArray< Cell_Type, Data_Type > | |
D() const | BArray< Cell_Type, Data_Type > | |
D_ptr() | BArray< Cell_Type, Data_Type > | |
D_ptr() const | BArray< Cell_Type, Data_Type > | |
default_val() const | BArray< Cell_Type, Data_Type > | |
flush_data() | BArray< Cell_Type, Data_Type > | |
get_cell(size_t i, size_t j, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
get_col_vec(size_t i, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
get_col_vec(std::vector< Cell_Type > *x, size_t i, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
get_entries() const | BArray< Cell_Type, Data_Type > | |
get_row_vec(size_t i, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
get_row_vec(std::vector< Cell_Type > *x, size_t i, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
insert_cell(size_t i, size_t j, const Cell< Cell_Type > &v, bool check_bounds, bool check_exists) | BArray< Cell_Type, Data_Type > | |
insert_cell(size_t i, size_t j, Cell< Cell_Type > &&v, bool check_bounds, bool check_exists) | BArray< Cell_Type, Data_Type > | |
insert_cell(size_t i, size_t j, Cell_Type v, bool check_bounds, bool check_exists) | BArray< Cell_Type, Data_Type > | |
is_dense() const noexcept | BArray< Cell_Type, Data_Type > | inline |
is_empty(size_t i, size_t j, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
ncol() const noexcept | BArray< Cell_Type, Data_Type > | |
nnozero() const noexcept | BArray< Cell_Type, Data_Type > | |
nrow() const noexcept | BArray< Cell_Type, Data_Type > | |
operator()(size_t i, size_t j, bool check_bounds=true) | BArray< Cell_Type, Data_Type > | |
operator()(size_t i, size_t j, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
operator*=(const Cell_Type &rhs) | BArray< Cell_Type, Data_Type > | |
operator+=(const std::pair< size_t, size_t > &coords) | BArray< Cell_Type, Data_Type > | |
operator+=(const BArray< Cell_Type, Data_Type > &rhs) | BArray< Cell_Type, Data_Type > | |
operator+=(const Cell_Type &rhs) | BArray< Cell_Type, Data_Type > | |
operator-=(const std::pair< size_t, size_t > &coords) | BArray< Cell_Type, Data_Type > | |
operator-=(const BArray< Cell_Type, Data_Type > &rhs) | BArray< Cell_Type, Data_Type > | |
operator-=(const Cell_Type &rhs) | BArray< Cell_Type, Data_Type > | |
operator/=(const Cell_Type &rhs) | BArray< Cell_Type, Data_Type > | |
operator=(const BArray< Cell_Type, Data_Type > &Array_) | BArray< Cell_Type, Data_Type > | |
operator=(BArray< Cell_Type, Data_Type > &&x) noexcept | BArray< Cell_Type, Data_Type > | |
operator==(const BArray< Cell_Type, Data_Type > &Array_) | BArray< Cell_Type, Data_Type > | |
out_of_range(size_t i, size_t j) const | BArray< Cell_Type, Data_Type > | |
print(const char *fmt=nullptr,...) const | BArray< Cell_Type, Data_Type > | |
print_n(size_t nrow, size_t ncol, const char *fmt=nullptr,...) const | BArray< Cell_Type, Data_Type > | |
reserve() | BArray< Cell_Type, Data_Type > | |
resize(size_t N_, size_t M_) | BArray< Cell_Type, Data_Type > | |
rm_cell(size_t i, size_t j, bool check_bounds=true, bool check_exists=true) | BArray< Cell_Type, Data_Type > | |
row(size_t i, bool check_bounds=true) const | BArray< Cell_Type, Data_Type > | |
set_data(Data_Type *data_, bool delete_data_=false) | BArray< Cell_Type, Data_Type > | |
swap_cells(size_t i0, size_t j0, size_t i1, size_t j1, bool check_bounds=true, int check_exists=CHECK::BOTH, int *report=nullptr) | BArray< Cell_Type, Data_Type > | |
swap_cols(size_t j0, size_t j1, bool check_bounds=true) | BArray< Cell_Type, Data_Type > | |
swap_rows(size_t i0, size_t i1, bool check_bounds=true) | BArray< Cell_Type, Data_Type > | |
toggle_cell(size_t i, size_t j, bool check_bounds=true, int check_exists=EXISTS::UKNOWN) | BArray< Cell_Type, Data_Type > | |
toggle_lock(size_t i, size_t j, bool check_bounds=true) | BArray< Cell_Type, Data_Type > | |
transpose() | BArray< Cell_Type, Data_Type > | |
visited | BArray< Cell_Type, Data_Type > | |
zero_col(size_t j, bool check_bounds=true) | BArray< Cell_Type, Data_Type > | |
zero_row(size_t i, bool check_bounds=true) | BArray< Cell_Type, Data_Type > | |
~BArray() | BArray< Cell_Type, Data_Type > |