barry: Your go-to motif accountant
0.0-1
Full enumeration of sample space and fast count of sufficient statistics for binary arrays
|
#include "formula.hpp"
Go to the source code of this file.
Macros | |
#define | MAKE_DEFM_HASHER(hasher, a, cov) |
Data for the counters. More... | |
#define | DEFM_RULEDYN_LAMBDA(a) |
#define | UNI_SUB(a) |
Macros for defining counters | |
#define | DEFM_COUNTER(a) inline double (a) (const DEFMArray & Array, size_t i, size_t j, DEFMCounterData & data) |
#define | DEFM_COUNTER_LAMBDA(a) |
Macros for defining rules | |
#define | DEFM_RULE(a) inline bool (a) (const DEFMArray & Array, size_t i, size_t j, bool & data) |
#define | DEFM_RULE_LAMBDA(a) |
Functions | |||
void | counter_ones (DEFMCounters *counters, int covar_index=-1, std::string vname="", const std::vector< std::string > *x_names=nullptr) | ||
Prevalence of ones. More... | |||
void | counter_logit_intercept (DEFMCounters *counters, size_t n_y, std::vector< size_t > which={}, int covar_index=-1, std::string vname="", const std::vector< std::string > *x_names=nullptr, const std::vector< std::string > *y_names=nullptr) | ||
void | counter_transition (DEFMCounters *counters, std::vector< size_t > coords, std::vector< bool > signs, size_t m_order, size_t n_y, int covar_index=-1, std::string vname="", const std::vector< std::string > *x_names=nullptr, const std::vector< std::string > *y_names=nullptr) | ||
Prevalence of ones. More... | |||
void | counter_transition_formula (DEFMCounters *counters, std::string formula, size_t m_order, size_t n_y, int covar_index=-1, std::string vname="", const std::vector< std::string > *x_names=nullptr, const std::vector< std::string > *y_names=nullptr) | ||
Prevalence of ones. More... | |||
void | counter_fixed_effect (DEFMCounters *counters, int covar_index, double k, std::string vname="", const std::vector< std::string > *x_names=nullptr) | ||
Prevalence of ones. More... | |||
Returns true if the cell is free | |||
| |||
void | rules_markov_fixed (DEFMRules *rules, size_t markov_order) | ||
Number of edges. More... | |||
void | rules_dont_become_zero (DEFMSupport *support, std::vector< size_t > ids) | ||
Blocks switching a one to zero. More... | |||
void | rule_constrain_support (DEFMSupport *support, size_t pos, double lb, double ub) | ||
Overall functional gains. More... | |||
#define DEFM_COUNTER | ( | a | ) | inline double (a) (const DEFMArray & Array, size_t i, size_t j, DEFMCounterData & data) |
Function for definition of a network counter function
Definition at line 47 of file counters.hpp.
#define DEFM_COUNTER_LAMBDA | ( | a | ) |
Lambda function for definition of a network counter function
Definition at line 51 of file counters.hpp.
Function for definition of a network counter function
Definition at line 61 of file counters.hpp.
#define DEFM_RULE_LAMBDA | ( | a | ) |
Lambda function for definition of a network counter function
Definition at line 65 of file counters.hpp.
#define DEFM_RULEDYN_LAMBDA | ( | a | ) |
Lambda function for definition of a network counter function
Definition at line 71 of file counters.hpp.
#define UNI_SUB | ( | a | ) |