void mzd_apply_p_right_trans_even_capped(mzd_t *A, mzp_t const *P, rci_t start_row, rci_t start_col)
Definition: mzp.c:316
rci_t length
Definition: mzp.h:47
void mzd_apply_p_right(mzd_t *A, mzp_t const *P)
Definition: mzp.c:310
Dense matrices over GF(2).
Definition: mzd.h:86
int rci_t
Type of row and column indexes.
Definition: misc.h:72
void mzp_free_window(mzp_t *condemned)
Free a permutation window created with mzp_init_mzp_t_window().
Definition: mzp.c:50
mzp_t * mzp_copy(mzp_t *P, const mzp_t *Q)
copy permutation Q to P
Definition: mzp.c:54
void mzd_apply_p_left_trans(mzd_t *A, mzp_t const *P)
Definition: mzp.c:79
void _mzd_compress_l(mzd_t *A, rci_t r1, rci_t n1, rci_t r2)
Definition: mzp.c:351
void mzp_print(mzp_t const *P)
Definition: mzp.c:328
Permutations.
Definition: mzp.h:37
mzp_t * mzp_init(rci_t length)
Definition: mzp.c:27
rci_t * values
Definition: mzp.h:41
mzp_t * mzp_init_window(mzp_t *P, rci_t begin, rci_t end)
Create a window/view into the permutation P.
Definition: mzp.c:42
void mzd_apply_p_right_trans(mzd_t *A, mzp_t const *P)
Definition: mzp.c:304
void mzd_apply_p_right_even_capped(mzd_t *A, mzp_t const *P, rci_t start_row, rci_t start_col)
Definition: mzp.c:322
void mzd_apply_p_right_trans_tri(mzd_t *A, mzp_t const *Q)
Definition: mzp.c:336
void mzp_free(mzp_t *P)
Definition: mzp.c:37
struct mzp_t mzp_t
Permutations.
void mzd_apply_p_left(mzd_t *A, mzp_t const *P)
Definition: mzp.c:69
void mzp_set_ui(mzp_t *P, unsigned int value)
Set the permutation P to the identity permutation. The only allowed value is 1.
Definition: mzp.c:62