#include <smith.hpp>
Public Member Functions | |
void | preamble () |
void | conclusion () |
template<typename Q, typename B, typename P> | |
void | current_matrices (const Q &, const B &, const P &) |
template<typename I, typename J> | |
void | find_smallest_nonzero (const I &, const J &) |
template<typename I, typename J> | |
void | pivot_item (const I &, const J &j) |
void | after_pivoting () |
template<typename I, typename J> | |
void | nondivisor_entry (const I &k, const I &i, const J &l) |
void | pivot_adjustment () |
template<typename C, typename I, typename J, typename Q, typename B, typename P> | |
bool | stop (const C &corner, const I &i, const J &j, const Q &q, const B &b, const P &p) |
Definition at line 36 of file smith.hpp.
void Arageli::ctrl::smith_idler::after_pivoting | ( | ) | [inline] |
void Arageli::ctrl::smith_idler::current_matrices | ( | const Q & | , | |
const B & | , | |||
const P & | ||||
) | [inline] |
void Arageli::ctrl::smith_idler::find_smallest_nonzero | ( | const I & | , | |
const J & | ||||
) | [inline] |
void Arageli::ctrl::smith_idler::nondivisor_entry | ( | const I & | k, | |
const I & | i, | |||
const J & | l | |||
) | [inline] |
void Arageli::ctrl::smith_idler::pivot_adjustment | ( | ) | [inline] |
void Arageli::ctrl::smith_idler::pivot_item | ( | const I & | , | |
const J & | j | |||
) | [inline] |
bool Arageli::ctrl::smith_idler::stop | ( | const C & | corner, | |
const I & | i, | |||
const J & | j, | |||
const Q & | q, | |||
const B & | b, | |||
const P & | p | |||
) | [inline] |